/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 01:10:23,410 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 01:10:23,448 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-25 01:10:23,451 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 01:10:23,452 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 01:10:23,467 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 01:10:23,467 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 01:10:23,467 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 01:10:23,468 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 01:10:23,468 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 01:10:23,468 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 01:10:23,468 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 01:10:23,469 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 01:10:23,469 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 01:10:23,469 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 01:10:23,469 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 01:10:23,470 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 01:10:23,470 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 01:10:23,470 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 01:10:23,470 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 01:10:23,471 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 01:10:23,471 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 01:10:23,471 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 01:10:23,471 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 01:10:23,472 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 01:10:23,472 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 01:10:23,472 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 01:10:23,472 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 01:10:23,472 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 01:10:23,473 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 01:10:23,473 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 01:10:23,473 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 01:10:23,473 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 01:10:23,474 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 01:10:23,474 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 01:10:23,474 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 01:10:23,474 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 01:10:23,474 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 01:10:23,475 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 01:10:23,475 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 01:10:23,475 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 01:10:23,488 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 01:10:23,488 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 01:10:23,488 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 01:10:23,489 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 01:10:23,489 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 01:10:23,489 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-25 01:10:23,646 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 01:10:23,664 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 01:10:23,666 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 01:10:23,667 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 01:10:23,667 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 01:10:23,668 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound50.c [2023-12-25 01:10:24,722 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 01:10:24,864 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 01:10:24,865 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound50.c [2023-12-25 01:10:24,870 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2feb6489/579d7a25659f41cfb3470a2b343612b4/FLAG41bcbb8ba [2023-12-25 01:10:24,880 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2feb6489/579d7a25659f41cfb3470a2b343612b4 [2023-12-25 01:10:24,882 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 01:10:24,883 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 01:10:24,884 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 01:10:24,884 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 01:10:24,887 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 01:10:24,887 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 01:10:24" (1/1) ... [2023-12-25 01:10:24,888 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b26141 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:10:24, skipping insertion in model container [2023-12-25 01:10:24,888 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 01:10:24" (1/1) ... [2023-12-25 01:10:24,908 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 01:10:25,046 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound50.c[525,538] [2023-12-25 01:10:25,078 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 01:10:25,090 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 01:10:25,101 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound50.c[525,538] [2023-12-25 01:10:25,111 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 01:10:25,123 INFO L206 MainTranslator]: Completed translation [2023-12-25 01:10:25,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:10:25 WrapperNode [2023-12-25 01:10:25,123 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 01:10:25,124 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 01:10:25,124 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 01:10:25,124 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 01:10:25,131 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:10:25" (1/1) ... [2023-12-25 01:10:25,139 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:10:25" (1/1) ... [2023-12-25 01:10:25,158 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53 [2023-12-25 01:10:25,158 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 01:10:25,159 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 01:10:25,159 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 01:10:25,159 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 01:10:25,167 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:10:25" (1/1) ... [2023-12-25 01:10:25,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:10:25" (1/1) ... [2023-12-25 01:10:25,170 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:10:25" (1/1) ... [2023-12-25 01:10:25,179 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-25 01:10:25,180 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:10:25" (1/1) ... [2023-12-25 01:10:25,180 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:10:25" (1/1) ... [2023-12-25 01:10:25,184 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:10:25" (1/1) ... [2023-12-25 01:10:25,187 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:10:25" (1/1) ... [2023-12-25 01:10:25,188 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:10:25" (1/1) ... [2023-12-25 01:10:25,188 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:10:25" (1/1) ... [2023-12-25 01:10:25,190 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 01:10:25,190 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 01:10:25,191 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 01:10:25,191 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 01:10:25,191 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:10:25" (1/1) ... [2023-12-25 01:10:25,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 01:10:25,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 01:10:25,228 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-25 01:10:25,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-25 01:10:25,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 01:10:25,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 01:10:25,267 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 01:10:25,268 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 01:10:25,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 01:10:25,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 01:10:25,269 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 01:10:25,269 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 01:10:25,314 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 01:10:25,317 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 01:10:25,505 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 01:10:25,520 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 01:10:25,520 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-25 01:10:25,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 01:10:25 BoogieIcfgContainer [2023-12-25 01:10:25,520 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 01:10:25,522 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 01:10:25,522 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 01:10:25,524 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 01:10:25,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 01:10:24" (1/3) ... [2023-12-25 01:10:25,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3894674d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 01:10:25, skipping insertion in model container [2023-12-25 01:10:25,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:10:25" (2/3) ... [2023-12-25 01:10:25,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3894674d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 01:10:25, skipping insertion in model container [2023-12-25 01:10:25,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 01:10:25" (3/3) ... [2023-12-25 01:10:25,526 INFO L112 eAbstractionObserver]: Analyzing ICFG dijkstra-u_valuebound50.c [2023-12-25 01:10:25,539 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 01:10:25,540 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 01:10:25,578 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 01:10:25,583 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6d0d3443, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 01:10:25,584 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 01:10:25,589 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-25 01:10:25,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-25 01:10:25,594 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:10:25,595 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:10:25,595 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:10:25,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:10:25,600 INFO L85 PathProgramCache]: Analyzing trace with hash -10312671, now seen corresponding path program 1 times [2023-12-25 01:10:25,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:10:25,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [662722899] [2023-12-25 01:10:25,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:10:25,609 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:10:25,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:10:25,611 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:10:25,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-25 01:10:25,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:10:25,709 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 01:10:25,712 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:10:25,732 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 01:10:25,732 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:10:25,732 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:10:25,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [662722899] [2023-12-25 01:10:25,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [662722899] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:10:25,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 01:10:25,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 01:10:25,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967354851] [2023-12-25 01:10:25,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:10:25,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 01:10:25,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:10:25,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 01:10:25,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 01:10:25,789 INFO L87 Difference]: Start difference. First operand has 30 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 01:10:25,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:10:25,815 INFO L93 Difference]: Finished difference Result 58 states and 102 transitions. [2023-12-25 01:10:25,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 01:10:25,816 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2023-12-25 01:10:25,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:10:25,822 INFO L225 Difference]: With dead ends: 58 [2023-12-25 01:10:25,822 INFO L226 Difference]: Without dead ends: 28 [2023-12-25 01:10:25,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 01:10:25,828 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 01:10:25,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 01:10:25,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-25 01:10:25,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-12-25 01:10:25,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-25 01:10:25,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2023-12-25 01:10:25,857 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 18 [2023-12-25 01:10:25,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:10:25,858 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2023-12-25 01:10:25,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 01:10:25,858 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2023-12-25 01:10:25,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-25 01:10:25,859 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:10:25,859 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:10:25,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-25 01:10:26,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:10:26,065 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:10:26,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:10:26,065 INFO L85 PathProgramCache]: Analyzing trace with hash 763841584, now seen corresponding path program 1 times [2023-12-25 01:10:26,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:10:26,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1751298477] [2023-12-25 01:10:26,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:10:26,068 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:10:26,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:10:26,069 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:10:26,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:10:26,105 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 01:10:26,107 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:10:26,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-25 01:10:26,312 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-25 01:10:26,312 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:10:26,443 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 01:10:26,444 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:10:26,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1751298477] [2023-12-25 01:10:26,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1751298477] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 01:10:26,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 01:10:26,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2023-12-25 01:10:26,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893406365] [2023-12-25 01:10:26,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:10:26,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 01:10:26,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:10:26,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 01:10:26,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-12-25 01:10:26,449 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 01:10:28,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:10:28,226 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2023-12-25 01:10:28,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 01:10:28,241 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2023-12-25 01:10:28,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:10:28,242 INFO L225 Difference]: With dead ends: 47 [2023-12-25 01:10:28,242 INFO L226 Difference]: Without dead ends: 45 [2023-12-25 01:10:28,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-12-25 01:10:28,243 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 8 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-25 01:10:28,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 149 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-25 01:10:28,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-12-25 01:10:28,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2023-12-25 01:10:28,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-25 01:10:28,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2023-12-25 01:10:28,252 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 19 [2023-12-25 01:10:28,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:10:28,252 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2023-12-25 01:10:28,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 01:10:28,252 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2023-12-25 01:10:28,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-25 01:10:28,253 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:10:28,253 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:10:28,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-25 01:10:28,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:10:28,454 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:10:28,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:10:28,454 INFO L85 PathProgramCache]: Analyzing trace with hash -82339253, now seen corresponding path program 1 times [2023-12-25 01:10:28,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:10:28,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1882721223] [2023-12-25 01:10:28,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:10:28,455 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:10:28,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:10:28,459 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:10:28,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-25 01:10:28,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:10:28,483 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-25 01:10:28,484 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:10:28,950 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-25 01:10:28,950 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:10:29,408 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 01:10:29,408 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:10:29,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1882721223] [2023-12-25 01:10:29,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1882721223] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:10:29,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:10:29,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2023-12-25 01:10:29,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954541792] [2023-12-25 01:10:29,409 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:10:29,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-25 01:10:29,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:10:29,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-25 01:10:29,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2023-12-25 01:10:29,410 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 15 states, 15 states have (on average 1.6) internal successors, (24), 12 states have internal predecessors, (24), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-25 01:10:35,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:10:39,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:10:44,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.07s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:10:52,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:10:56,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:11:00,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:11:04,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:11:08,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:11:12,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:11:12,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:11:12,811 INFO L93 Difference]: Finished difference Result 128 states and 204 transitions. [2023-12-25 01:11:12,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-25 01:11:12,828 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6) internal successors, (24), 12 states have internal predecessors, (24), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 21 [2023-12-25 01:11:12,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:11:12,830 INFO L225 Difference]: With dead ends: 128 [2023-12-25 01:11:12,830 INFO L226 Difference]: Without dead ends: 108 [2023-12-25 01:11:12,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2023-12-25 01:11:12,832 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 51 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 120 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.9s IncrementalHoareTripleChecker+Time [2023-12-25 01:11:12,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 387 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 369 Invalid, 8 Unknown, 0 Unchecked, 42.9s Time] [2023-12-25 01:11:12,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-12-25 01:11:12,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 74. [2023-12-25 01:11:12,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 33 states have call successors, (33), 4 states have call predecessors, (33), 4 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2023-12-25 01:11:12,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 109 transitions. [2023-12-25 01:11:12,867 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 109 transitions. Word has length 21 [2023-12-25 01:11:12,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:11:12,867 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 109 transitions. [2023-12-25 01:11:12,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6) internal successors, (24), 12 states have internal predecessors, (24), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-25 01:11:12,867 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 109 transitions. [2023-12-25 01:11:12,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-25 01:11:12,868 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:11:12,868 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:11:12,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-25 01:11:13,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:11:13,071 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:11:13,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:11:13,072 INFO L85 PathProgramCache]: Analyzing trace with hash -93184560, now seen corresponding path program 1 times [2023-12-25 01:11:13,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:11:13,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [579581152] [2023-12-25 01:11:13,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:11:13,072 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:11:13,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:11:13,073 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:11:13,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-25 01:11:13,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:11:13,234 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 01:11:13,236 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:11:13,539 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-25 01:11:13,540 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:11:17,063 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:11:17,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [579581152] [2023-12-25 01:11:17,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [579581152] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 01:11:17,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [549029854] [2023-12-25 01:11:17,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:11:17,064 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 01:11:17,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 01:11:17,113 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 01:11:17,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2023-12-25 01:11:17,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:11:17,363 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 01:11:17,365 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:11:17,972 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-25 01:11:17,972 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:11:17,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [549029854] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:11:17,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 01:11:17,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2023-12-25 01:11:17,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892632140] [2023-12-25 01:11:17,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:11:17,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 01:11:17,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:11:17,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 01:11:17,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-25 01:11:17,974 INFO L87 Difference]: Start difference. First operand 74 states and 109 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-25 01:11:20,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:11:20,172 INFO L93 Difference]: Finished difference Result 95 states and 137 transitions. [2023-12-25 01:11:20,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 01:11:20,186 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2023-12-25 01:11:20,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:11:20,188 INFO L225 Difference]: With dead ends: 95 [2023-12-25 01:11:20,189 INFO L226 Difference]: Without dead ends: 79 [2023-12-25 01:11:20,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-12-25 01:11:20,190 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 7 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-25 01:11:20,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 122 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-25 01:11:20,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-12-25 01:11:20,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2023-12-25 01:11:20,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 43 states have internal predecessors, (48), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-25 01:11:20,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 114 transitions. [2023-12-25 01:11:20,205 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 114 transitions. Word has length 29 [2023-12-25 01:11:20,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:11:20,205 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 114 transitions. [2023-12-25 01:11:20,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-25 01:11:20,206 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 114 transitions. [2023-12-25 01:11:20,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-25 01:11:20,206 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:11:20,206 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:11:20,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-25 01:11:20,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2023-12-25 01:11:20,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-25 01:11:20,618 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:11:20,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:11:20,619 INFO L85 PathProgramCache]: Analyzing trace with hash 471953405, now seen corresponding path program 1 times [2023-12-25 01:11:20,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:11:20,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [571597640] [2023-12-25 01:11:20,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:11:20,619 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:11:20,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:11:20,620 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:11:20,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-25 01:11:20,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:11:20,661 INFO L262 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 01:11:20,662 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:11:21,371 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-25 01:11:21,371 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:11:28,107 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 01:11:28,108 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:11:28,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [571597640] [2023-12-25 01:11:28,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [571597640] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:11:28,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:11:28,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2023-12-25 01:11:28,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347302632] [2023-12-25 01:11:28,108 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:11:28,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-25 01:11:28,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:11:28,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-25 01:11:28,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2023-12-25 01:11:28,109 INFO L87 Difference]: Start difference. First operand 79 states and 114 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 14 states have internal predecessors, (31), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-25 01:11:41,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:11:45,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:11:49,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:11:53,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:11:59,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:12:03,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:12:09,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:12:13,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:12:23,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:12:27,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:12:31,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:12:35,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:12:40,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:12:44,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:12:44,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:12:44,669 INFO L93 Difference]: Finished difference Result 164 states and 249 transitions. [2023-12-25 01:12:44,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-25 01:12:44,670 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 14 states have internal predecessors, (31), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 28 [2023-12-25 01:12:44,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:12:44,671 INFO L225 Difference]: With dead ends: 164 [2023-12-25 01:12:44,671 INFO L226 Difference]: Without dead ends: 140 [2023-12-25 01:12:44,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2023-12-25 01:12:44,672 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 61 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 68 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 69.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 71.0s IncrementalHoareTripleChecker+Time [2023-12-25 01:12:44,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 574 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 441 Invalid, 14 Unknown, 0 Unchecked, 71.0s Time] [2023-12-25 01:12:44,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-12-25 01:12:44,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 126. [2023-12-25 01:12:44,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 64 states have internal predecessors, (71), 60 states have call successors, (60), 7 states have call predecessors, (60), 7 states have return successors, (58), 54 states have call predecessors, (58), 58 states have call successors, (58) [2023-12-25 01:12:44,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 189 transitions. [2023-12-25 01:12:44,720 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 189 transitions. Word has length 28 [2023-12-25 01:12:44,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:12:44,720 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 189 transitions. [2023-12-25 01:12:44,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 14 states have internal predecessors, (31), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-25 01:12:44,721 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 189 transitions. [2023-12-25 01:12:44,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-25 01:12:44,721 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:12:44,721 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:12:44,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-25 01:12:44,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:12:44,932 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:12:44,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:12:44,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1813470180, now seen corresponding path program 2 times [2023-12-25 01:12:44,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:12:44,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [360772111] [2023-12-25 01:12:44,933 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 01:12:44,933 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:12:44,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:12:44,934 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:12:44,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-25 01:12:44,954 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-25 01:12:44,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:12:44,955 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 01:12:44,958 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:12:45,259 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 01:12:45,259 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:12:45,259 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:12:45,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [360772111] [2023-12-25 01:12:45,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [360772111] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:12:45,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 01:12:45,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-25 01:12:45,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263720731] [2023-12-25 01:12:45,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:12:45,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 01:12:45,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:12:45,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 01:12:45,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-25 01:12:45,261 INFO L87 Difference]: Start difference. First operand 126 states and 189 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 01:12:49,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:12:53,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:12:58,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:13:02,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:13:06,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:13:11,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:13:16,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:13:20,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:13:24,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:13:24,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:13:24,940 INFO L93 Difference]: Finished difference Result 152 states and 222 transitions. [2023-12-25 01:13:24,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 01:13:24,941 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2023-12-25 01:13:24,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:13:24,942 INFO L225 Difference]: With dead ends: 152 [2023-12-25 01:13:24,942 INFO L226 Difference]: Without dead ends: 148 [2023-12-25 01:13:24,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-25 01:13:24,943 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 12 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 18 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 39.6s IncrementalHoareTripleChecker+Time [2023-12-25 01:13:24,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 139 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 67 Invalid, 9 Unknown, 0 Unchecked, 39.6s Time] [2023-12-25 01:13:24,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-12-25 01:13:24,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2023-12-25 01:13:24,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 70 states have (on average 1.2) internal successors, (84), 76 states have internal predecessors, (84), 66 states have call successors, (66), 10 states have call predecessors, (66), 10 states have return successors, (65), 60 states have call predecessors, (65), 65 states have call successors, (65) [2023-12-25 01:13:24,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 215 transitions. [2023-12-25 01:13:24,983 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 215 transitions. Word has length 27 [2023-12-25 01:13:24,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:13:24,984 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 215 transitions. [2023-12-25 01:13:24,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 01:13:24,984 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 215 transitions. [2023-12-25 01:13:24,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-25 01:13:24,988 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:13:24,988 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:13:24,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-25 01:13:25,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:13:25,190 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:13:25,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:13:25,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1319121432, now seen corresponding path program 1 times [2023-12-25 01:13:25,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:13:25,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [408777149] [2023-12-25 01:13:25,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:13:25,192 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:13:25,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:13:25,193 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:13:25,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-25 01:13:25,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:13:25,486 INFO L262 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 01:13:25,488 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:13:26,211 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-25 01:13:26,211 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:14:14,082 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-25 01:14:14,082 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:14:14,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [408777149] [2023-12-25 01:14:14,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [408777149] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:14:14,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:14:14,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2023-12-25 01:14:14,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809336467] [2023-12-25 01:14:14,083 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:14:14,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-25 01:14:14,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:14:14,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-25 01:14:14,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2023-12-25 01:14:14,084 INFO L87 Difference]: Start difference. First operand 147 states and 215 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 12 states have internal predecessors, (27), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-25 01:14:36,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:14:55,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:15:07,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:15:10,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:15:14,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:15:19,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.70s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:15:23,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:15:28,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:15:29,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:15:35,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:15:40,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:15:44,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:15:49,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:15:51,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:15:56,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:15:56,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:15:56,410 INFO L93 Difference]: Finished difference Result 174 states and 243 transitions. [2023-12-25 01:15:56,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-25 01:15:56,459 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 12 states have internal predecessors, (27), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 36 [2023-12-25 01:15:56,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:15:56,460 INFO L225 Difference]: With dead ends: 174 [2023-12-25 01:15:56,460 INFO L226 Difference]: Without dead ends: 172 [2023-12-25 01:15:56,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 65.4s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2023-12-25 01:15:56,461 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 43 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 64 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 67.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 71.2s IncrementalHoareTripleChecker+Time [2023-12-25 01:15:56,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 182 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 240 Invalid, 4 Unknown, 0 Unchecked, 71.2s Time] [2023-12-25 01:15:56,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2023-12-25 01:15:56,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 166. [2023-12-25 01:15:56,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 82 states have (on average 1.170731707317073) internal successors, (96), 88 states have internal predecessors, (96), 69 states have call successors, (69), 14 states have call predecessors, (69), 14 states have return successors, (68), 63 states have call predecessors, (68), 68 states have call successors, (68) [2023-12-25 01:15:56,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 233 transitions. [2023-12-25 01:15:56,517 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 233 transitions. Word has length 36 [2023-12-25 01:15:56,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:15:56,518 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 233 transitions. [2023-12-25 01:15:56,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 12 states have internal predecessors, (27), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-25 01:15:56,518 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 233 transitions. [2023-12-25 01:15:56,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-25 01:15:56,526 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:15:56,526 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:15:56,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-25 01:15:56,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:15:56,735 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:15:56,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:15:56,736 INFO L85 PathProgramCache]: Analyzing trace with hash 2080784785, now seen corresponding path program 2 times [2023-12-25 01:15:56,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:15:56,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [505153578] [2023-12-25 01:15:56,736 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 01:15:56,736 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:15:56,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:15:56,737 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:15:56,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-25 01:15:56,776 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 01:15:56,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:15:56,779 INFO L262 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 01:15:56,780 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:15:57,231 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-25 01:15:57,232 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:15:57,819 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 26 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-25 01:15:57,819 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:15:57,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [505153578] [2023-12-25 01:15:57,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [505153578] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:15:57,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:15:57,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2023-12-25 01:15:57,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545042046] [2023-12-25 01:15:57,820 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:15:57,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-25 01:15:57,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:15:57,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-25 01:15:57,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2023-12-25 01:15:57,821 INFO L87 Difference]: Start difference. First operand 166 states and 233 transitions. Second operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 13 states have internal predecessors, (39), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-25 01:16:08,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:16:08,021 INFO L93 Difference]: Finished difference Result 278 states and 420 transitions. [2023-12-25 01:16:08,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-25 01:16:08,026 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 13 states have internal predecessors, (39), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 36 [2023-12-25 01:16:08,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:16:08,027 INFO L225 Difference]: With dead ends: 278 [2023-12-25 01:16:08,027 INFO L226 Difference]: Without dead ends: 216 [2023-12-25 01:16:08,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2023-12-25 01:16:08,029 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 61 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2023-12-25 01:16:08,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 505 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 9.8s Time] [2023-12-25 01:16:08,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2023-12-25 01:16:08,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 176. [2023-12-25 01:16:08,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 81 states have (on average 1.1358024691358024) internal successors, (92), 85 states have internal predecessors, (92), 81 states have call successors, (81), 13 states have call predecessors, (81), 13 states have return successors, (80), 77 states have call predecessors, (80), 80 states have call successors, (80) [2023-12-25 01:16:08,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 253 transitions. [2023-12-25 01:16:08,079 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 253 transitions. Word has length 36 [2023-12-25 01:16:08,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:16:08,079 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 253 transitions. [2023-12-25 01:16:08,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 13 states have internal predecessors, (39), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-25 01:16:08,079 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 253 transitions. [2023-12-25 01:16:08,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-25 01:16:08,080 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:16:08,081 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:16:08,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-12-25 01:16:08,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:16:08,284 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:16:08,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:16:08,285 INFO L85 PathProgramCache]: Analyzing trace with hash -2119770422, now seen corresponding path program 1 times [2023-12-25 01:16:08,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:16:08,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [19146212] [2023-12-25 01:16:08,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:16:08,285 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:16:08,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:16:08,293 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:16:08,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-25 01:16:08,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:16:08,639 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-25 01:16:08,641 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:16:09,826 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-12-25 01:16:09,826 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:16:12,057 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-12-25 01:16:12,057 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:16:12,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [19146212] [2023-12-25 01:16:12,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [19146212] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:16:12,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:16:12,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2023-12-25 01:16:12,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503082674] [2023-12-25 01:16:12,058 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:16:12,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-25 01:16:12,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:16:12,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-25 01:16:12,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2023-12-25 01:16:12,059 INFO L87 Difference]: Start difference. First operand 176 states and 253 transitions. Second operand has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 16 states have internal predecessors, (33), 6 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2023-12-25 01:16:19,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.67s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:16:22,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.85s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:16:27,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:16:31,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:16:41,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:16:41,246 INFO L93 Difference]: Finished difference Result 231 states and 333 transitions. [2023-12-25 01:16:41,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-25 01:16:41,253 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 16 states have internal predecessors, (33), 6 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 54 [2023-12-25 01:16:41,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:16:41,254 INFO L225 Difference]: With dead ends: 231 [2023-12-25 01:16:41,254 INFO L226 Difference]: Without dead ends: 210 [2023-12-25 01:16:41,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=150, Invalid=842, Unknown=0, NotChecked=0, Total=992 [2023-12-25 01:16:41,257 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 61 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 149 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.6s IncrementalHoareTripleChecker+Time [2023-12-25 01:16:41,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 512 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 460 Invalid, 1 Unknown, 0 Unchecked, 26.6s Time] [2023-12-25 01:16:41,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2023-12-25 01:16:41,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 174. [2023-12-25 01:16:41,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 84 states have (on average 1.119047619047619) internal successors, (94), 89 states have internal predecessors, (94), 75 states have call successors, (75), 14 states have call predecessors, (75), 14 states have return successors, (74), 70 states have call predecessors, (74), 74 states have call successors, (74) [2023-12-25 01:16:41,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 243 transitions. [2023-12-25 01:16:41,306 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 243 transitions. Word has length 54 [2023-12-25 01:16:41,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:16:41,308 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 243 transitions. [2023-12-25 01:16:41,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 16 states have internal predecessors, (33), 6 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2023-12-25 01:16:41,308 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 243 transitions. [2023-12-25 01:16:41,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-25 01:16:41,309 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:16:41,309 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:16:41,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-25 01:16:41,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:16:41,520 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:16:41,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:16:41,520 INFO L85 PathProgramCache]: Analyzing trace with hash -749177843, now seen corresponding path program 1 times [2023-12-25 01:16:41,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:16:41,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [122633575] [2023-12-25 01:16:41,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:16:41,520 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:16:41,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:16:41,521 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:16:41,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-25 01:16:41,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:16:41,847 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 01:16:41,849 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:16:42,793 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-12-25 01:16:42,793 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:16:43,610 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-12-25 01:16:43,610 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:16:43,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [122633575] [2023-12-25 01:16:43,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [122633575] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:16:43,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:16:43,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2023-12-25 01:16:43,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578921881] [2023-12-25 01:16:43,611 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:16:43,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-25 01:16:43,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:16:43,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-25 01:16:43,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2023-12-25 01:16:43,612 INFO L87 Difference]: Start difference. First operand 174 states and 243 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2023-12-25 01:16:49,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:16:49,368 INFO L93 Difference]: Finished difference Result 212 states and 299 transitions. [2023-12-25 01:16:49,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-25 01:16:49,373 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 56 [2023-12-25 01:16:49,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:16:49,374 INFO L225 Difference]: With dead ends: 212 [2023-12-25 01:16:49,374 INFO L226 Difference]: Without dead ends: 134 [2023-12-25 01:16:49,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2023-12-25 01:16:49,375 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 44 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-12-25 01:16:49,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 330 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2023-12-25 01:16:49,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-12-25 01:16:49,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 126. [2023-12-25 01:16:49,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 72 states have internal predecessors, (74), 43 states have call successors, (43), 13 states have call predecessors, (43), 13 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-25 01:16:49,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 159 transitions. [2023-12-25 01:16:49,448 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 159 transitions. Word has length 56 [2023-12-25 01:16:49,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:16:49,449 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 159 transitions. [2023-12-25 01:16:49,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2023-12-25 01:16:49,449 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 159 transitions. [2023-12-25 01:16:49,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-25 01:16:49,450 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:16:49,450 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:16:49,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-25 01:16:49,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:16:49,651 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:16:49,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:16:49,651 INFO L85 PathProgramCache]: Analyzing trace with hash -665291431, now seen corresponding path program 2 times [2023-12-25 01:16:49,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:16:49,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1494410794] [2023-12-25 01:16:49,651 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 01:16:49,651 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:16:49,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:16:49,652 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:16:49,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-25 01:16:49,943 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 01:16:49,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:16:49,976 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-25 01:16:49,977 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:16:51,683 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 31 proven. 9 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2023-12-25 01:16:51,684 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:17:14,904 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 31 proven. 6 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-25 01:17:14,904 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:17:14,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1494410794] [2023-12-25 01:17:14,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1494410794] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:17:14,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:17:14,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 22 [2023-12-25 01:17:14,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436573845] [2023-12-25 01:17:14,905 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:17:14,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-25 01:17:14,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:17:14,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-25 01:17:14,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2023-12-25 01:17:14,906 INFO L87 Difference]: Start difference. First operand 126 states and 159 transitions. Second operand has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 19 states have internal predecessors, (38), 7 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2023-12-25 01:17:42,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:17:45,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.40s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:17:51,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:17:55,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:17:59,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:18:19,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:18:20,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:18:22,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:18:22,989 INFO L93 Difference]: Finished difference Result 152 states and 190 transitions. [2023-12-25 01:18:23,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-25 01:18:23,002 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 19 states have internal predecessors, (38), 7 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) Word has length 59 [2023-12-25 01:18:23,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:18:23,003 INFO L225 Difference]: With dead ends: 152 [2023-12-25 01:18:23,003 INFO L226 Difference]: Without dead ends: 150 [2023-12-25 01:18:23,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 40.1s TimeCoverageRelationStatistics Valid=160, Invalid=770, Unknown=0, NotChecked=0, Total=930 [2023-12-25 01:18:23,004 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 45 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 64 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 45.4s IncrementalHoareTripleChecker+Time [2023-12-25 01:18:23,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 287 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 446 Invalid, 4 Unknown, 0 Unchecked, 45.4s Time] [2023-12-25 01:18:23,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-12-25 01:18:23,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2023-12-25 01:18:23,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 79 states have (on average 1.0632911392405062) internal successors, (84), 82 states have internal predecessors, (84), 51 states have call successors, (51), 16 states have call predecessors, (51), 16 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2023-12-25 01:18:23,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 185 transitions. [2023-12-25 01:18:23,066 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 185 transitions. Word has length 59 [2023-12-25 01:18:23,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:18:23,066 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 185 transitions. [2023-12-25 01:18:23,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 19 states have internal predecessors, (38), 7 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2023-12-25 01:18:23,066 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 185 transitions. [2023-12-25 01:18:23,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-25 01:18:23,067 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:18:23,067 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:18:23,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-25 01:18:23,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:18:23,283 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:18:23,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:18:23,285 INFO L85 PathProgramCache]: Analyzing trace with hash -212420630, now seen corresponding path program 3 times [2023-12-25 01:18:23,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:18:23,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [836784509] [2023-12-25 01:18:23,285 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 01:18:23,285 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:18:23,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:18:23,286 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:18:23,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-25 01:18:23,394 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-25 01:18:23,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:18:23,406 INFO L262 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-25 01:18:23,408 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:18:25,088 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2023-12-25 01:18:25,088 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:20:00,199 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2023-12-25 01:20:00,203 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:20:00,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [836784509] [2023-12-25 01:20:00,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [836784509] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:20:00,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:20:00,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2023-12-25 01:20:00,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752194879] [2023-12-25 01:20:00,204 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:20:00,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-25 01:20:00,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:20:00,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-25 01:20:00,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2023-12-25 01:20:00,205 INFO L87 Difference]: Start difference. First operand 147 states and 185 transitions. Second operand has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 16 states have internal predecessors, (33), 6 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) [2023-12-25 01:20:39,219 WARN L293 SmtUtils]: Spent 11.95s on a formula simplification that was a NOOP. DAG size: 110 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:20:41,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:21:04,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:21:25,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:21:29,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.67s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:21:31,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:21:36,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:21:40,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.59s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:21:43,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:21:46,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:21:51,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:22:06,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:22:18,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:22:21,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:22:23,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:22:27,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:22:52,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:22:52,763 INFO L93 Difference]: Finished difference Result 184 states and 238 transitions. [2023-12-25 01:22:52,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-25 01:22:52,890 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 16 states have internal predecessors, (33), 6 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) Word has length 64 [2023-12-25 01:22:52,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:22:52,892 INFO L225 Difference]: With dead ends: 184 [2023-12-25 01:22:52,892 INFO L226 Difference]: Without dead ends: 134 [2023-12-25 01:22:52,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 131.6s TimeCoverageRelationStatistics Valid=126, Invalid=576, Unknown=0, NotChecked=0, Total=702 [2023-12-25 01:22:52,893 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 38 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 73 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 89.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 97.3s IncrementalHoareTripleChecker+Time [2023-12-25 01:22:52,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 429 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 456 Invalid, 3 Unknown, 0 Unchecked, 97.3s Time] [2023-12-25 01:22:52,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-12-25 01:22:52,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 109. [2023-12-25 01:22:52,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 61 states have internal predecessors, (63), 38 states have call successors, (38), 11 states have call predecessors, (38), 11 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2023-12-25 01:22:52,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 138 transitions. [2023-12-25 01:22:52,976 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 138 transitions. Word has length 64 [2023-12-25 01:22:52,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:22:52,976 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 138 transitions. [2023-12-25 01:22:52,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 16 states have internal predecessors, (33), 6 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) [2023-12-25 01:22:52,976 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 138 transitions. [2023-12-25 01:22:52,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-25 01:22:52,976 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:22:52,977 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:22:52,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-25 01:22:53,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:22:53,183 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:22:53,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:22:53,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1791652116, now seen corresponding path program 4 times [2023-12-25 01:22:53,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:22:53,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [393868018] [2023-12-25 01:22:53,183 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-25 01:22:53,183 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:22:53,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:22:53,184 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:22:53,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-25 01:22:53,634 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-25 01:22:53,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:22:53,683 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-25 01:22:53,685 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:22:56,483 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 52 proven. 22 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2023-12-25 01:22:56,484 INFO L327 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2023-12-25 01:25:08,564 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 01:25:08,564 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 01:25:09,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-12-25 01:25:09,765 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-25 01:25:09,796 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 01:25:09,796 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 72 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while executing Executor. [2023-12-25 01:25:09,799 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1] [2023-12-25 01:25:09,801 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 01:25:09,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 01:25:09 BoogieIcfgContainer [2023-12-25 01:25:09,802 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 01:25:09,802 INFO L158 Benchmark]: Toolchain (without parser) took 884919.73ms. Allocated memory is still 256.9MB. Free memory was 208.6MB in the beginning and 74.0MB in the end (delta: 134.7MB). Peak memory consumption was 136.2MB. Max. memory is 8.0GB. [2023-12-25 01:25:09,803 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 187.7MB. Free memory is still 140.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 01:25:09,803 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.00ms. Allocated memory is still 256.9MB. Free memory was 208.6MB in the beginning and 196.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-25 01:25:09,803 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.02ms. Allocated memory is still 256.9MB. Free memory was 196.1MB in the beginning and 194.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 01:25:09,803 INFO L158 Benchmark]: Boogie Preprocessor took 31.19ms. Allocated memory is still 256.9MB. Free memory was 194.3MB in the beginning and 192.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 01:25:09,803 INFO L158 Benchmark]: RCFGBuilder took 330.09ms. Allocated memory is still 256.9MB. Free memory was 192.2MB in the beginning and 175.8MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-25 01:25:09,803 INFO L158 Benchmark]: TraceAbstraction took 884279.91ms. Allocated memory is still 256.9MB. Free memory was 175.1MB in the beginning and 74.0MB in the end (delta: 101.1MB). Peak memory consumption was 102.7MB. Max. memory is 8.0GB. [2023-12-25 01:25:09,804 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### [2023-12-25 01:25:09,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 187.7MB. Free memory is still 140.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 240.00ms. Allocated memory is still 256.9MB. Free memory was 208.6MB in the beginning and 196.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.02ms. Allocated memory is still 256.9MB. Free memory was 196.1MB in the beginning and 194.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.19ms. Allocated memory is still 256.9MB. Free memory was 194.3MB in the beginning and 192.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 330.09ms. Allocated memory is still 256.9MB. Free memory was 192.2MB in the beginning and 175.8MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 884279.91ms. Allocated memory is still 256.9MB. Free memory was 175.1MB in the beginning and 74.0MB in the end (delta: 101.1MB). Peak memory consumption was 102.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 14]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 14). Cancelled while NwaCegarLoop was analyzing trace of length 72 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 884.2s, OverallIterations: 13, TraceHistogramMax: 10, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 552.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 43 mSolverCounterUnknown, 572 SdHoareTripleChecker+Valid, 412.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 431 mSDsluCounter, 3655 SdHoareTripleChecker+Invalid, 389.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3152 mSDsCounter, 778 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3057 IncrementalHoareTripleChecker+Invalid, 3878 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 778 mSolverCounterUnsat, 503 mSDtfsCounter, 3057 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 901 GetRequests, 686 SyntacticMatches, 0 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 259.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=176occurred in iteration=8, InterpolantAutomatonStates: 163, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 176 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 190.2s InterpolantComputationTime, 476 NumberOfCodeBlocks, 433 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 827 ConstructedInterpolants, 0 QuantifiedInterpolants, 7538 SizeOfPredicates, 33 NumberOfNonLiveVariables, 784 ConjunctsInSsa, 144 ConjunctsInUnsatCore, 22 InterpolantComputations, 4 PerfectInterpolantSequences, 937/1058 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown