/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/mannadiv_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 04:17:27,028 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 04:17:27,098 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 04:17:27,103 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 04:17:27,103 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 04:17:27,125 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 04:17:27,126 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 04:17:27,126 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 04:17:27,126 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 04:17:27,129 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 04:17:27,129 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 04:17:27,130 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 04:17:27,130 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 04:17:27,131 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 04:17:27,131 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 04:17:27,131 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 04:17:27,132 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 04:17:27,132 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 04:17:27,132 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 04:17:27,133 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 04:17:27,133 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 04:17:27,133 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 04:17:27,134 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 04:17:27,134 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 04:17:27,134 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 04:17:27,134 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 04:17:27,134 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 04:17:27,134 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 04:17:27,135 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 04:17:27,135 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 04:17:27,135 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 04:17:27,136 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 04:17:27,136 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 04:17:27,136 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 04:17:27,136 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 04:17:27,136 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 04:17:27,136 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 04:17:27,136 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 04:17:27,136 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 04:17:27,137 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 04:17:27,137 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 04:17:27,137 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 04:17:27,137 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 04:17:27,137 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 04:17:27,137 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 04:17:27,138 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 04:17:27,138 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 04:17:27,284 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 04:17:27,295 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 04:17:27,297 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 04:17:27,297 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 04:17:27,297 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 04:17:27,298 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound50.c [2023-12-25 04:17:28,312 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 04:17:28,460 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 04:17:28,460 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound50.c [2023-12-25 04:17:28,465 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7e609fb6/3ef0472c3082422ea1a2fb4d8d1f6fc7/FLAG5cb77a3cd [2023-12-25 04:17:28,476 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7e609fb6/3ef0472c3082422ea1a2fb4d8d1f6fc7 [2023-12-25 04:17:28,479 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 04:17:28,480 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 04:17:28,481 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 04:17:28,481 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 04:17:28,484 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 04:17:28,485 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 04:17:28" (1/1) ... [2023-12-25 04:17:28,485 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dffda33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:17:28, skipping insertion in model container [2023-12-25 04:17:28,485 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 04:17:28" (1/1) ... [2023-12-25 04:17:28,506 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 04:17:28,623 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/mannadiv_unwindbound50.c[573,586] [2023-12-25 04:17:28,636 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 04:17:28,645 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 04:17:28,655 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/mannadiv_unwindbound50.c[573,586] [2023-12-25 04:17:28,661 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 04:17:28,671 INFO L206 MainTranslator]: Completed translation [2023-12-25 04:17:28,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:17:28 WrapperNode [2023-12-25 04:17:28,672 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 04:17:28,673 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 04:17:28,673 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 04:17:28,673 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 04:17:28,677 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:17:28" (1/1) ... [2023-12-25 04:17:28,688 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:17:28" (1/1) ... [2023-12-25 04:17:28,700 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 46 [2023-12-25 04:17:28,700 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 04:17:28,700 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 04:17:28,701 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 04:17:28,701 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 04:17:28,707 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:17:28" (1/1) ... [2023-12-25 04:17:28,707 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:17:28" (1/1) ... [2023-12-25 04:17:28,716 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:17:28" (1/1) ... [2023-12-25 04:17:28,723 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 04:17:28,724 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:17:28" (1/1) ... [2023-12-25 04:17:28,724 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:17:28" (1/1) ... [2023-12-25 04:17:28,726 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:17:28" (1/1) ... [2023-12-25 04:17:28,729 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:17:28" (1/1) ... [2023-12-25 04:17:28,735 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:17:28" (1/1) ... [2023-12-25 04:17:28,740 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:17:28" (1/1) ... [2023-12-25 04:17:28,741 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 04:17:28,742 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 04:17:28,742 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 04:17:28,742 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 04:17:28,743 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:17:28" (1/1) ... [2023-12-25 04:17:28,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 04:17:28,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 04:17:28,773 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 04:17:28,775 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 04:17:28,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 04:17:28,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 04:17:28,793 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 04:17:28,793 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 04:17:28,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 04:17:28,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 04:17:28,794 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 04:17:28,794 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 04:17:28,837 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 04:17:28,839 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 04:17:28,982 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 04:17:29,016 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 04:17:29,016 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 04:17:29,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 04:17:29 BoogieIcfgContainer [2023-12-25 04:17:29,017 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 04:17:29,018 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 04:17:29,018 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 04:17:29,020 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 04:17:29,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 04:17:28" (1/3) ... [2023-12-25 04:17:29,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@403464a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 04:17:29, skipping insertion in model container [2023-12-25 04:17:29,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:17:28" (2/3) ... [2023-12-25 04:17:29,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@403464a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 04:17:29, skipping insertion in model container [2023-12-25 04:17:29,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 04:17:29" (3/3) ... [2023-12-25 04:17:29,022 INFO L112 eAbstractionObserver]: Analyzing ICFG mannadiv_unwindbound50.c [2023-12-25 04:17:29,037 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 04:17:29,040 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 04:17:29,072 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 04:17:29,076 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;@5b5c9119, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 04:17:29,076 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 04:17:29,079 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 04:17:29,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-25 04:17:29,084 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:17:29,084 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:17:29,084 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:17:29,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:17:29,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1060579028, now seen corresponding path program 1 times [2023-12-25 04:17:29,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:17:29,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1043039541] [2023-12-25 04:17:29,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:17:29,096 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 04:17:29,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:17:29,115 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 04:17:29,124 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 04:17:29,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:17:29,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 04:17:29,197 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:17:29,216 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 04:17:29,216 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 04:17:29,216 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:17:29,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1043039541] [2023-12-25 04:17:29,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1043039541] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 04:17:29,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 04:17:29,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 04:17:29,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360227064] [2023-12-25 04:17:29,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 04:17:29,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 04:17:29,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:17:29,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 04:17:29,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 04:17:29,249 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 04:17:29,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:17:29,267 INFO L93 Difference]: Finished difference Result 42 states and 59 transitions. [2023-12-25 04:17:29,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 04:17:29,269 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-12-25 04:17:29,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:17:29,273 INFO L225 Difference]: With dead ends: 42 [2023-12-25 04:17:29,273 INFO L226 Difference]: Without dead ends: 20 [2023-12-25 04:17:29,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 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 04:17:29,278 INFO L413 NwaCegarLoop]: 24 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, 24 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 04:17:29,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 04:17:29,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-12-25 04:17:29,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-12-25 04:17:29,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-25 04:17:29,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2023-12-25 04:17:29,302 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 17 [2023-12-25 04:17:29,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:17:29,303 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2023-12-25 04:17:29,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 04:17:29,303 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2023-12-25 04:17:29,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-25 04:17:29,304 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:17:29,304 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:17:29,321 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 04:17:29,509 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 04:17:29,510 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:17:29,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:17:29,510 INFO L85 PathProgramCache]: Analyzing trace with hash -778881514, now seen corresponding path program 1 times [2023-12-25 04:17:29,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:17:29,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [352098463] [2023-12-25 04:17:29,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:17:29,511 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 04:17:29,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:17:29,512 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 04:17:29,531 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 04:17:29,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:17:29,553 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 04:17:29,554 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:17:29,611 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 04:17:29,612 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 04:17:29,612 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:17:29,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [352098463] [2023-12-25 04:17:29,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [352098463] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 04:17:29,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 04:17:29,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 04:17:29,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249042416] [2023-12-25 04:17:29,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 04:17:29,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 04:17:29,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:17:29,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 04:17:29,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 04:17:29,614 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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 04:17:29,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:17:29,640 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2023-12-25 04:17:29,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 04:17:29,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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 04:17:29,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:17:29,641 INFO L225 Difference]: With dead ends: 29 [2023-12-25 04:17:29,641 INFO L226 Difference]: Without dead ends: 22 [2023-12-25 04:17:29,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 04:17:29,642 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 04:17:29,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 04:17:29,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-25 04:17:29,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-12-25 04:17:29,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-25 04:17:29,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2023-12-25 04:17:29,647 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 18 [2023-12-25 04:17:29,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:17:29,648 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2023-12-25 04:17:29,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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 04:17:29,648 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2023-12-25 04:17:29,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-25 04:17:29,648 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:17:29,648 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:17:29,653 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 (3)] Forceful destruction successful, exit code 0 [2023-12-25 04:17:29,851 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 04:17:29,851 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:17:29,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:17:29,852 INFO L85 PathProgramCache]: Analyzing trace with hash -777094054, now seen corresponding path program 1 times [2023-12-25 04:17:29,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:17:29,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1964893652] [2023-12-25 04:17:29,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:17:29,852 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 04:17:29,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:17:29,856 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 04:17:29,857 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 04:17:29,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:17:29,892 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 04:17:29,894 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:17:29,998 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 04:17:29,998 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:17:30,268 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 04:17:30,268 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:17:30,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1964893652] [2023-12-25 04:17:30,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1964893652] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 04:17:30,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 04:17:30,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2023-12-25 04:17:30,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736619847] [2023-12-25 04:17:30,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 04:17:30,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 04:17:30,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:17:30,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 04:17:30,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-25 04:17:30,270 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 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 04:17:31,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:17:31,580 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2023-12-25 04:17:31,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 04:17:31,582 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 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 04:17:31,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:17:31,582 INFO L225 Difference]: With dead ends: 34 [2023-12-25 04:17:31,582 INFO L226 Difference]: Without dead ends: 32 [2023-12-25 04:17:31,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-25 04:17:31,583 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-25 04:17:31,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 64 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-25 04:17:31,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-25 04:17:31,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2023-12-25 04:17:31,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 04:17:31,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2023-12-25 04:17:31,589 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 18 [2023-12-25 04:17:31,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:17:31,590 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2023-12-25 04:17:31,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 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 04:17:31,590 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2023-12-25 04:17:31,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-25 04:17:31,590 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:17:31,590 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:17:31,599 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 04:17:31,793 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 04:17:31,793 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:17:31,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:17:31,794 INFO L85 PathProgramCache]: Analyzing trace with hash -331201790, now seen corresponding path program 1 times [2023-12-25 04:17:31,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:17:31,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1166647953] [2023-12-25 04:17:31,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:17:31,794 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 04:17:31,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:17:31,795 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 04:17:31,801 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 04:17:31,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:17:31,854 INFO L262 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 04:17:31,856 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:17:31,998 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-25 04:17:31,998 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:17:32,433 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:17:32,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1166647953] [2023-12-25 04:17:32,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1166647953] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 04:17:32,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1942110881] [2023-12-25 04:17:32,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:17:32,434 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 04:17:32,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 04:17:32,478 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 04:17:32,484 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 04:17:32,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:17:32,530 INFO L262 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 04:17:32,531 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:17:32,585 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 04:17:32,585 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 04:17:32,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1942110881] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 04:17:32,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 04:17:32,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 10 [2023-12-25 04:17:32,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17286272] [2023-12-25 04:17:32,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 04:17:32,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 04:17:32,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:17:32,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 04:17:32,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-12-25 04:17:32,586 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-25 04:17:32,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:17:32,727 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2023-12-25 04:17:32,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 04:17:32,727 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2023-12-25 04:17:32,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:17:32,728 INFO L225 Difference]: With dead ends: 45 [2023-12-25 04:17:32,729 INFO L226 Difference]: Without dead ends: 38 [2023-12-25 04:17:32,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2023-12-25 04:17:32,730 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 7 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 04:17:32,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 78 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 04:17:32,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-25 04:17:32,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2023-12-25 04:17:32,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-25 04:17:32,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2023-12-25 04:17:32,738 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 24 [2023-12-25 04:17:32,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:17:32,738 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2023-12-25 04:17:32,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-25 04:17:32,738 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2023-12-25 04:17:32,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-25 04:17:32,739 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:17:32,739 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:17:32,744 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 (5)] Forceful destruction successful, exit code 0 [2023-12-25 04:17:32,943 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 04:17:33,143 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 04:17:33,144 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:17:33,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:17:33,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1584280999, now seen corresponding path program 1 times [2023-12-25 04:17:33,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:17:33,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1485790413] [2023-12-25 04:17:33,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:17:33,145 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 04:17:33,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:17:33,147 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 04:17:33,176 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 04:17:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:17:33,182 INFO L262 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 04:17:33,183 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:17:33,240 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 04:17:33,240 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:17:33,282 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 04:17:33,282 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:17:33,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1485790413] [2023-12-25 04:17:33,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1485790413] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 04:17:33,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 04:17:33,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-12-25 04:17:33,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876424725] [2023-12-25 04:17:33,283 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 04:17:33,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 04:17:33,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:17:33,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 04:17:33,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 04:17:33,284 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-25 04:17:33,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:17:33,458 INFO L93 Difference]: Finished difference Result 91 states and 112 transitions. [2023-12-25 04:17:33,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 04:17:33,459 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 27 [2023-12-25 04:17:33,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:17:33,460 INFO L225 Difference]: With dead ends: 91 [2023-12-25 04:17:33,460 INFO L226 Difference]: Without dead ends: 84 [2023-12-25 04:17:33,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-12-25 04:17:33,461 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 27 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 04:17:33,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 108 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 04:17:33,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-12-25 04:17:33,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2023-12-25 04:17:33,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 59 states have (on average 1.305084745762712) internal successors, (77), 62 states have internal predecessors, (77), 12 states have call successors, (12), 8 states have call predecessors, (12), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 04:17:33,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 98 transitions. [2023-12-25 04:17:33,471 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 98 transitions. Word has length 27 [2023-12-25 04:17:33,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:17:33,471 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 98 transitions. [2023-12-25 04:17:33,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-25 04:17:33,471 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 98 transitions. [2023-12-25 04:17:33,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-25 04:17:33,472 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:17:33,472 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:17:33,477 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 04:17:33,674 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 04:17:33,674 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:17:33,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:17:33,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1582493539, now seen corresponding path program 1 times [2023-12-25 04:17:33,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:17:33,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [919057629] [2023-12-25 04:17:33,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:17:33,675 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 04:17:33,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:17:33,705 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 04:17:33,736 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 04:17:33,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:17:33,744 INFO L262 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 04:17:33,746 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:17:33,932 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-25 04:17:33,932 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:17:35,055 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 04:17:35,055 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:17:35,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [919057629] [2023-12-25 04:17:35,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [919057629] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 04:17:35,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 04:17:35,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2023-12-25 04:17:35,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174584852] [2023-12-25 04:17:35,056 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 04:17:35,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-25 04:17:35,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:17:35,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-25 04:17:35,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2023-12-25 04:17:35,058 INFO L87 Difference]: Start difference. First operand 80 states and 98 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 12 states have internal predecessors, (29), 6 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 04:17:38,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:17:42,746 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 04:17:43,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:17:43,957 INFO L93 Difference]: Finished difference Result 133 states and 164 transitions. [2023-12-25 04:17:43,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-25 04:17:43,959 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 12 states have internal predecessors, (29), 6 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 27 [2023-12-25 04:17:43,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:17:43,960 INFO L225 Difference]: With dead ends: 133 [2023-12-25 04:17:43,960 INFO L226 Difference]: Without dead ends: 105 [2023-12-25 04:17:43,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2023-12-25 04:17:43,961 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 48 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2023-12-25 04:17:43,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 126 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 132 Invalid, 1 Unknown, 0 Unchecked, 7.0s Time] [2023-12-25 04:17:43,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-12-25 04:17:43,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 84. [2023-12-25 04:17:43,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 65 states have internal predecessors, (78), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-25 04:17:43,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 100 transitions. [2023-12-25 04:17:43,987 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 100 transitions. Word has length 27 [2023-12-25 04:17:43,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:17:43,987 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 100 transitions. [2023-12-25 04:17:43,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 12 states have internal predecessors, (29), 6 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 04:17:43,987 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 100 transitions. [2023-12-25 04:17:43,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-25 04:17:43,988 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:17:43,988 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:17:43,993 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 (8)] Ended with exit code 0 [2023-12-25 04:17:44,188 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 04:17:44,188 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:17:44,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:17:44,189 INFO L85 PathProgramCache]: Analyzing trace with hash 943937797, now seen corresponding path program 1 times [2023-12-25 04:17:44,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:17:44,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1345697030] [2023-12-25 04:17:44,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:17:44,189 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 04:17:44,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:17:44,190 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 04:17:44,192 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 04:17:44,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:17:44,241 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 04:17:44,243 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:17:44,439 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-25 04:17:44,439 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:17:45,786 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-25 04:17:45,786 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:17:45,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1345697030] [2023-12-25 04:17:45,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1345697030] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 04:17:45,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 04:17:45,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2023-12-25 04:17:45,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060282022] [2023-12-25 04:17:45,787 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 04:17:45,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-25 04:17:45,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:17:45,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-25 04:17:45,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2023-12-25 04:17:45,788 INFO L87 Difference]: Start difference. First operand 84 states and 100 transitions. Second operand has 15 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 8 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-12-25 04:17:48,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:17:48,162 INFO L93 Difference]: Finished difference Result 101 states and 119 transitions. [2023-12-25 04:17:48,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-25 04:17:48,163 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 8 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 33 [2023-12-25 04:17:48,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:17:48,163 INFO L225 Difference]: With dead ends: 101 [2023-12-25 04:17:48,163 INFO L226 Difference]: Without dead ends: 90 [2023-12-25 04:17:48,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2023-12-25 04:17:48,164 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 37 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-25 04:17:48,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 125 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-25 04:17:48,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-12-25 04:17:48,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2023-12-25 04:17:48,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 68 states have internal predecessors, (79), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-25 04:17:48,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 103 transitions. [2023-12-25 04:17:48,177 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 103 transitions. Word has length 33 [2023-12-25 04:17:48,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:17:48,177 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 103 transitions. [2023-12-25 04:17:48,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 8 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-12-25 04:17:48,177 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 103 transitions. [2023-12-25 04:17:48,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-25 04:17:48,178 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:17:48,178 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:17:48,184 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 (9)] Ended with exit code 0 [2023-12-25 04:17:48,381 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 04:17:48,382 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:17:48,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:17:48,382 INFO L85 PathProgramCache]: Analyzing trace with hash -200746846, now seen corresponding path program 1 times [2023-12-25 04:17:48,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:17:48,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [277567577] [2023-12-25 04:17:48,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:17:48,382 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 04:17:48,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:17:48,383 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 04:17:48,387 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 04:17:48,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:17:48,420 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 04:17:48,422 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:17:48,687 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-25 04:17:48,687 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:17:49,602 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-12-25 04:17:49,603 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:17:49,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [277567577] [2023-12-25 04:17:49,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [277567577] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 04:17:49,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 04:17:49,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 18 [2023-12-25 04:17:49,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128898544] [2023-12-25 04:17:49,603 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 04:17:49,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-25 04:17:49,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:17:49,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-25 04:17:49,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2023-12-25 04:17:49,604 INFO L87 Difference]: Start difference. First operand 89 states and 103 transitions. Second operand has 18 states, 16 states have (on average 2.375) internal successors, (38), 14 states have internal predecessors, (38), 7 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2023-12-25 04:17:50,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:17:50,848 INFO L93 Difference]: Finished difference Result 103 states and 119 transitions. [2023-12-25 04:17:50,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-25 04:17:50,851 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.375) internal successors, (38), 14 states have internal predecessors, (38), 7 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) Word has length 42 [2023-12-25 04:17:50,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:17:50,853 INFO L225 Difference]: With dead ends: 103 [2023-12-25 04:17:50,853 INFO L226 Difference]: Without dead ends: 93 [2023-12-25 04:17:50,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2023-12-25 04:17:50,855 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 29 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 04:17:50,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 227 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 04:17:50,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-12-25 04:17:50,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2023-12-25 04:17:50,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 61 states have (on average 1.1475409836065573) internal successors, (70), 63 states have internal predecessors, (70), 11 states have call successors, (11), 8 states have call predecessors, (11), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-25 04:17:50,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2023-12-25 04:17:50,888 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 42 [2023-12-25 04:17:50,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:17:50,888 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2023-12-25 04:17:50,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.375) internal successors, (38), 14 states have internal predecessors, (38), 7 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2023-12-25 04:17:50,888 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2023-12-25 04:17:50,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-25 04:17:50,889 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:17:50,889 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:17:50,895 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 (10)] Forceful destruction successful, exit code 0 [2023-12-25 04:17:51,090 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 04:17:51,090 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:17:51,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:17:51,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1123591361, now seen corresponding path program 1 times [2023-12-25 04:17:51,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:17:51,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2063651401] [2023-12-25 04:17:51,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:17:51,091 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 04:17:51,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:17:51,093 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 04:17:51,101 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 04:17:51,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:17:51,154 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 04:17:51,156 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:17:51,199 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-25 04:17:51,199 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:17:51,265 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-25 04:17:51,265 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:17:51,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2063651401] [2023-12-25 04:17:51,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2063651401] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 04:17:51,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 04:17:51,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-12-25 04:17:51,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035839094] [2023-12-25 04:17:51,266 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 04:17:51,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 04:17:51,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:17:51,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 04:17:51,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-25 04:17:51,267 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-12-25 04:17:51,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:17:51,438 INFO L93 Difference]: Finished difference Result 155 states and 197 transitions. [2023-12-25 04:17:51,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 04:17:51,440 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 45 [2023-12-25 04:17:51,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:17:51,441 INFO L225 Difference]: With dead ends: 155 [2023-12-25 04:17:51,441 INFO L226 Difference]: Without dead ends: 141 [2023-12-25 04:17:51,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-25 04:17:51,442 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 12 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 04:17:51,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 147 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 04:17:51,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-12-25 04:17:51,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 130. [2023-12-25 04:17:51,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 101 states have (on average 1.2475247524752475) internal successors, (126), 102 states have internal predecessors, (126), 20 states have call successors, (20), 8 states have call predecessors, (20), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-25 04:17:51,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 165 transitions. [2023-12-25 04:17:51,460 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 165 transitions. Word has length 45 [2023-12-25 04:17:51,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:17:51,462 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 165 transitions. [2023-12-25 04:17:51,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-12-25 04:17:51,462 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 165 transitions. [2023-12-25 04:17:51,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-25 04:17:51,465 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:17:51,466 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:17:51,484 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 (11)] Ended with exit code 0 [2023-12-25 04:17:51,669 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 04:17:51,669 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:17:51,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:17:51,670 INFO L85 PathProgramCache]: Analyzing trace with hash -2144659715, now seen corresponding path program 2 times [2023-12-25 04:17:51,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:17:51,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [330182294] [2023-12-25 04:17:51,670 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 04:17:51,670 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 04:17:51,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:17:51,672 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 04:17:51,673 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 04:17:51,735 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 04:17:51,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 04:17:51,740 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-25 04:17:51,741 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:17:52,333 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 11 proven. 28 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-25 04:17:52,333 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:17:56,205 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-12-25 04:17:56,205 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:17:56,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [330182294] [2023-12-25 04:17:56,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [330182294] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 04:17:56,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 04:17:56,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8] total 21 [2023-12-25 04:17:56,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662713933] [2023-12-25 04:17:56,206 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 04:17:56,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-25 04:17:56,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:17:56,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-25 04:17:56,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2023-12-25 04:17:56,207 INFO L87 Difference]: Start difference. First operand 130 states and 165 transitions. Second operand has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 18 states have internal predecessors, (44), 7 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2023-12-25 04:17:58,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:18:02,997 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 04:18:07,000 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 04:18:08,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:18:08,058 INFO L93 Difference]: Finished difference Result 139 states and 174 transitions. [2023-12-25 04:18:08,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-25 04:18:08,058 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 18 states have internal predecessors, (44), 7 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) Word has length 45 [2023-12-25 04:18:08,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:18:08,060 INFO L225 Difference]: With dead ends: 139 [2023-12-25 04:18:08,060 INFO L226 Difference]: Without dead ends: 135 [2023-12-25 04:18:08,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2023-12-25 04:18:08,061 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 27 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2023-12-25 04:18:08,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 210 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 287 Invalid, 2 Unknown, 0 Unchecked, 11.3s Time] [2023-12-25 04:18:08,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-12-25 04:18:08,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2023-12-25 04:18:08,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 103 states have (on average 1.233009708737864) internal successors, (127), 103 states have internal predecessors, (127), 20 states have call successors, (20), 9 states have call predecessors, (20), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-25 04:18:08,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 166 transitions. [2023-12-25 04:18:08,084 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 166 transitions. Word has length 45 [2023-12-25 04:18:08,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:18:08,084 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 166 transitions. [2023-12-25 04:18:08,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 18 states have internal predecessors, (44), 7 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2023-12-25 04:18:08,085 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 166 transitions. [2023-12-25 04:18:08,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-25 04:18:08,086 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:18:08,086 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:18:08,094 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 (12)] Ended with exit code 0 [2023-12-25 04:18:08,289 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 04:18:08,289 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:18:08,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:18:08,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1262136106, now seen corresponding path program 2 times [2023-12-25 04:18:08,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:18:08,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [231411558] [2023-12-25 04:18:08,290 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 04:18:08,290 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 04:18:08,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:18:08,291 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 04:18:08,293 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 04:18:08,394 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 04:18:08,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 04:18:08,400 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-25 04:18:08,401 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:18:08,501 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 04:18:08,501 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:18:08,638 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-25 04:18:08,638 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:18:08,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [231411558] [2023-12-25 04:18:08,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [231411558] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 04:18:08,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 04:18:08,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-12-25 04:18:08,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395428819] [2023-12-25 04:18:08,638 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 04:18:08,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 04:18:08,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:18:08,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 04:18:08,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-12-25 04:18:08,639 INFO L87 Difference]: Start difference. First operand 132 states and 166 transitions. Second operand has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 11 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2023-12-25 04:18:09,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:18:09,377 INFO L93 Difference]: Finished difference Result 363 states and 484 transitions. [2023-12-25 04:18:09,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-25 04:18:09,378 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 11 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 54 [2023-12-25 04:18:09,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:18:09,379 INFO L225 Difference]: With dead ends: 363 [2023-12-25 04:18:09,379 INFO L226 Difference]: Without dead ends: 358 [2023-12-25 04:18:09,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=218, Invalid=484, Unknown=0, NotChecked=0, Total=702 [2023-12-25 04:18:09,380 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 73 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 04:18:09,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 263 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 04:18:09,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2023-12-25 04:18:09,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2023-12-25 04:18:09,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 283 states have (on average 1.1731448763250882) internal successors, (332), 283 states have internal predecessors, (332), 54 states have call successors, (54), 21 states have call predecessors, (54), 20 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2023-12-25 04:18:09,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 439 transitions. [2023-12-25 04:18:09,425 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 439 transitions. Word has length 54 [2023-12-25 04:18:09,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:18:09,425 INFO L495 AbstractCegarLoop]: Abstraction has 358 states and 439 transitions. [2023-12-25 04:18:09,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 11 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2023-12-25 04:18:09,425 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 439 transitions. [2023-12-25 04:18:09,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-25 04:18:09,427 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:18:09,427 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:18:09,446 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 04:18:09,631 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 04:18:09,631 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:18:09,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:18:09,632 INFO L85 PathProgramCache]: Analyzing trace with hash -254685450, now seen corresponding path program 3 times [2023-12-25 04:18:09,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:18:09,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [305045161] [2023-12-25 04:18:09,632 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 04:18:09,632 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 04:18:09,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:18:09,633 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 04:18:09,635 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 04:18:09,935 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-12-25 04:18:09,935 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 04:18:09,947 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-25 04:18:09,949 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:18:10,165 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 425 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 04:18:10,166 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:18:10,996 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 245 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2023-12-25 04:18:10,997 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:18:10,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [305045161] [2023-12-25 04:18:10,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [305045161] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 04:18:10,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 04:18:10,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 28 [2023-12-25 04:18:10,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457831016] [2023-12-25 04:18:10,997 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 04:18:10,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-25 04:18:10,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:18:10,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-25 04:18:10,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=555, Unknown=0, NotChecked=0, Total=756 [2023-12-25 04:18:10,999 INFO L87 Difference]: Start difference. First operand 358 states and 439 transitions. Second operand has 28 states, 28 states have (on average 4.642857142857143) internal successors, (130), 28 states have internal predecessors, (130), 23 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2023-12-25 04:18:14,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:18:14,213 INFO L93 Difference]: Finished difference Result 879 states and 1175 transitions. [2023-12-25 04:18:14,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-12-25 04:18:14,214 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.642857142857143) internal successors, (130), 28 states have internal predecessors, (130), 23 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) Word has length 108 [2023-12-25 04:18:14,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:18:14,226 INFO L225 Difference]: With dead ends: 879 [2023-12-25 04:18:14,226 INFO L226 Difference]: Without dead ends: 874 [2023-12-25 04:18:14,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1016, Invalid=2290, Unknown=0, NotChecked=0, Total=3306 [2023-12-25 04:18:14,229 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 345 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-25 04:18:14,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 950 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-25 04:18:14,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2023-12-25 04:18:14,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2023-12-25 04:18:14,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 691 states have (on average 1.1751085383502171) internal successors, (812), 691 states have internal predecessors, (812), 138 states have call successors, (138), 45 states have call predecessors, (138), 44 states have return successors, (137), 137 states have call predecessors, (137), 137 states have call successors, (137) [2023-12-25 04:18:14,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1087 transitions. [2023-12-25 04:18:14,315 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1087 transitions. Word has length 108 [2023-12-25 04:18:14,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:18:14,315 INFO L495 AbstractCegarLoop]: Abstraction has 874 states and 1087 transitions. [2023-12-25 04:18:14,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.642857142857143) internal successors, (130), 28 states have internal predecessors, (130), 23 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2023-12-25 04:18:14,315 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1087 transitions. [2023-12-25 04:18:14,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2023-12-25 04:18:14,318 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:18:14,318 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:18:14,334 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 04:18:14,525 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 04:18:14,526 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:18:14,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:18:14,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1987984182, now seen corresponding path program 4 times [2023-12-25 04:18:14,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:18:14,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1631117845] [2023-12-25 04:18:14,527 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-25 04:18:14,527 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 04:18:14,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:18:14,528 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 04:18:14,537 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 04:18:15,996 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-25 04:18:15,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 04:18:16,025 INFO L262 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 47 conjunts are in the unsatisfiable core [2023-12-25 04:18:16,028 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:18:16,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2171 backedges. 44 proven. 2123 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 04:18:16,555 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:18:18,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2171 backedges. 44 proven. 1199 refuted. 0 times theorem prover too weak. 928 trivial. 0 not checked. [2023-12-25 04:18:18,014 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:18:18,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1631117845] [2023-12-25 04:18:18,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1631117845] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 04:18:18,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 04:18:18,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2023-12-25 04:18:18,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933537562] [2023-12-25 04:18:18,014 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 04:18:18,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-12-25 04:18:18,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:18:18,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-12-25 04:18:18,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=627, Invalid=1823, Unknown=0, NotChecked=0, Total=2450 [2023-12-25 04:18:18,016 INFO L87 Difference]: Start difference. First operand 874 states and 1087 transitions. Second operand has 50 states, 50 states have (on average 5.24) internal successors, (262), 50 states have internal predecessors, (262), 47 states have call successors, (49), 25 states have call predecessors, (49), 24 states have return successors, (48), 46 states have call predecessors, (48), 46 states have call successors, (48) [2023-12-25 04:18:33,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:18:33,742 INFO L93 Difference]: Finished difference Result 1911 states and 2555 transitions. [2023-12-25 04:18:33,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2023-12-25 04:18:33,742 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.24) internal successors, (262), 50 states have internal predecessors, (262), 47 states have call successors, (49), 25 states have call predecessors, (49), 24 states have return successors, (48), 46 states have call predecessors, (48), 46 states have call successors, (48) Word has length 216 [2023-12-25 04:18:33,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:18:33,757 INFO L225 Difference]: With dead ends: 1911 [2023-12-25 04:18:33,757 INFO L226 Difference]: Without dead ends: 1906 [2023-12-25 04:18:33,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 404 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2718 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=4097, Invalid=9475, Unknown=0, NotChecked=0, Total=13572 [2023-12-25 04:18:33,761 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 1408 mSDsluCounter, 3423 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1408 SdHoareTripleChecker+Valid, 3611 SdHoareTripleChecker+Invalid, 2554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-12-25 04:18:33,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1408 Valid, 3611 Invalid, 2554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2023-12-25 04:18:33,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1906 states. [2023-12-25 04:18:33,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1906 to 1906. [2023-12-25 04:18:33,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1906 states, 1507 states have (on average 1.1758460517584606) internal successors, (1772), 1507 states have internal predecessors, (1772), 306 states have call successors, (306), 93 states have call predecessors, (306), 92 states have return successors, (305), 305 states have call predecessors, (305), 305 states have call successors, (305) [2023-12-25 04:18:33,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1906 states to 1906 states and 2383 transitions. [2023-12-25 04:18:33,933 INFO L78 Accepts]: Start accepts. Automaton has 1906 states and 2383 transitions. Word has length 216 [2023-12-25 04:18:33,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:18:33,935 INFO L495 AbstractCegarLoop]: Abstraction has 1906 states and 2383 transitions. [2023-12-25 04:18:33,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.24) internal successors, (262), 50 states have internal predecessors, (262), 47 states have call successors, (49), 25 states have call predecessors, (49), 24 states have return successors, (48), 46 states have call predecessors, (48), 46 states have call successors, (48) [2023-12-25 04:18:33,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1906 states and 2383 transitions. [2023-12-25 04:18:33,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2023-12-25 04:18:33,944 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:18:33,944 INFO L195 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 46, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:18:33,958 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 (15)] Forceful destruction successful, exit code 0 [2023-12-25 04:18:34,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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 04:18:34,157 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:18:34,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:18:34,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1235022774, now seen corresponding path program 5 times [2023-12-25 04:18:34,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:18:34,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2034274249] [2023-12-25 04:18:34,159 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-25 04:18:34,159 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 04:18:34,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:18:34,160 INFO L229 MonitoredProcess]: Starting monitored process 16 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 04:18:34,180 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 (16)] Waiting until timeout for monitored process [2023-12-25 04:18:40,050 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2023-12-25 04:18:40,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 04:18:40,117 INFO L262 TraceCheckSpWp]: Trace formula consists of 729 conjuncts, 98 conjunts are in the unsatisfiable core [2023-12-25 04:18:40,123 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:18:41,782 INFO L134 CoverageAnalysis]: Checked inductivity of 9503 backedges. 92 proven. 9407 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 04:18:41,782 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:18:48,637 INFO L134 CoverageAnalysis]: Checked inductivity of 9503 backedges. 92 proven. 5267 refuted. 0 times theorem prover too weak. 4144 trivial. 0 not checked. [2023-12-25 04:18:48,638 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:18:48,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2034274249] [2023-12-25 04:18:48,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2034274249] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 04:18:48,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 04:18:48,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 53] total 104 [2023-12-25 04:18:48,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608462441] [2023-12-25 04:18:48,638 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 04:18:48,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2023-12-25 04:18:48,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:18:48,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2023-12-25 04:18:48,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2668, Invalid=8044, Unknown=0, NotChecked=0, Total=10712 [2023-12-25 04:18:48,649 INFO L87 Difference]: Start difference. First operand 1906 states and 2383 transitions. Second operand has 104 states, 104 states have (on average 5.0576923076923075) internal successors, (526), 104 states have internal predecessors, (526), 95 states have call successors, (97), 49 states have call predecessors, (97), 48 states have return successors, (96), 94 states have call predecessors, (96), 94 states have call successors, (96) [2023-12-25 04:20:39,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:20:39,351 INFO L93 Difference]: Finished difference Result 3980 states and 5319 transitions. [2023-12-25 04:20:39,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2023-12-25 04:20:39,352 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 5.0576923076923075) internal successors, (526), 104 states have internal predecessors, (526), 95 states have call successors, (97), 49 states have call predecessors, (97), 48 states have return successors, (96), 94 states have call predecessors, (96), 94 states have call successors, (96) Word has length 432 [2023-12-25 04:20:39,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:20:39,365 INFO L225 Difference]: With dead ends: 3980 [2023-12-25 04:20:39,365 INFO L226 Difference]: Without dead ends: 3975 [2023-12-25 04:20:39,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1046 GetRequests, 807 SyntacticMatches, 0 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11763 ImplicationChecksByTransitivity, 107.9s TimeCoverageRelationStatistics Valid=13937, Invalid=43903, Unknown=0, NotChecked=0, Total=57840 [2023-12-25 04:20:39,374 INFO L413 NwaCegarLoop]: 379 mSDtfsCounter, 6189 mSDsluCounter, 7471 mSDsCounter, 0 mSdLazyCounter, 5030 mSolverCounterSat, 1362 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6189 SdHoareTripleChecker+Valid, 7850 SdHoareTripleChecker+Invalid, 6392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1362 IncrementalHoareTripleChecker+Valid, 5030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2023-12-25 04:20:39,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6189 Valid, 7850 Invalid, 6392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1362 Valid, 5030 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2023-12-25 04:20:39,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3975 states. [2023-12-25 04:20:39,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3975 to 3970. [2023-12-25 04:20:39,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3970 states, 3139 states have (on average 1.1784007645747052) internal successors, (3699), 3139 states have internal predecessors, (3699), 642 states have call successors, (642), 189 states have call predecessors, (642), 188 states have return successors, (641), 641 states have call predecessors, (641), 641 states have call successors, (641) [2023-12-25 04:20:39,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3970 states to 3970 states and 4982 transitions. [2023-12-25 04:20:39,763 INFO L78 Accepts]: Start accepts. Automaton has 3970 states and 4982 transitions. Word has length 432 [2023-12-25 04:20:39,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:20:39,764 INFO L495 AbstractCegarLoop]: Abstraction has 3970 states and 4982 transitions. [2023-12-25 04:20:39,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 5.0576923076923075) internal successors, (526), 104 states have internal predecessors, (526), 95 states have call successors, (97), 49 states have call predecessors, (97), 48 states have return successors, (96), 94 states have call predecessors, (96), 94 states have call successors, (96) [2023-12-25 04:20:39,764 INFO L276 IsEmpty]: Start isEmpty. Operand 3970 states and 4982 transitions. [2023-12-25 04:20:39,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2023-12-25 04:20:39,773 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:20:39,773 INFO L195 NwaCegarLoop]: trace histogram [51, 51, 50, 50, 50, 50, 50, 50, 50, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:20:39,799 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 (16)] Forceful destruction successful, exit code 0 [2023-12-25 04:20:39,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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 04:20:39,999 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:20:40,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:20:40,000 INFO L85 PathProgramCache]: Analyzing trace with hash -866598282, now seen corresponding path program 6 times [2023-12-25 04:20:40,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:20:40,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1085580209] [2023-12-25 04:20:40,000 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-25 04:20:40,001 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 04:20:40,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:20:40,002 INFO L229 MonitoredProcess]: Starting monitored process 17 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 04:20:40,025 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 (17)] Waiting until timeout for monitored process [2023-12-25 04:20:45,579 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) [2023-12-25 04:20:45,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-12-25 04:20:45,579 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-25 04:20:53,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 04:20:53,234 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-25 04:20:53,234 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-25 04:20:53,234 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 04:20:53,277 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 (17)] Forceful destruction successful, exit code 0 [2023-12-25 04:20:53,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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 04:20:53,461 INFO L445 BasicCegarLoop]: Path program histogram: [6, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:20:53,464 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 04:20:53,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 04:20:53 BoogieIcfgContainer [2023-12-25 04:20:53,623 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 04:20:53,624 INFO L158 Benchmark]: Toolchain (without parser) took 205144.06ms. Allocated memory was 170.9MB in the beginning and 216.0MB in the end (delta: 45.1MB). Free memory was 129.8MB in the beginning and 95.3MB in the end (delta: 34.5MB). Peak memory consumption was 80.9MB. Max. memory is 8.0GB. [2023-12-25 04:20:53,624 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 170.9MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 04:20:53,624 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.30ms. Allocated memory is still 170.9MB. Free memory was 129.5MB in the beginning and 118.3MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 04:20:53,625 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.19ms. Allocated memory is still 170.9MB. Free memory was 118.3MB in the beginning and 117.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 04:20:53,625 INFO L158 Benchmark]: Boogie Preprocessor took 40.88ms. Allocated memory is still 170.9MB. Free memory was 116.6MB in the beginning and 114.9MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 04:20:53,625 INFO L158 Benchmark]: RCFGBuilder took 274.74ms. Allocated memory is still 170.9MB. Free memory was 114.9MB in the beginning and 103.0MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-25 04:20:53,625 INFO L158 Benchmark]: TraceAbstraction took 204605.35ms. Allocated memory was 170.9MB in the beginning and 216.0MB in the end (delta: 45.1MB). Free memory was 102.3MB in the beginning and 95.3MB in the end (delta: 6.9MB). Peak memory consumption was 53.6MB. Max. memory is 8.0GB. [2023-12-25 04:20:53,629 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 170.9MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 191.30ms. Allocated memory is still 170.9MB. Free memory was 129.5MB in the beginning and 118.3MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.19ms. Allocated memory is still 170.9MB. Free memory was 118.3MB in the beginning and 117.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.88ms. Allocated memory is still 170.9MB. Free memory was 116.6MB in the beginning and 114.9MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 274.74ms. Allocated memory is still 170.9MB. Free memory was 114.9MB in the beginning and 103.0MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 204605.35ms. Allocated memory was 170.9MB in the beginning and 216.0MB in the end (delta: 45.1MB). Free memory was 102.3MB in the beginning and 95.3MB in the end (delta: 6.9MB). Peak memory consumption was 53.6MB. 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 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; [L24] int x1, x2; [L25] int y1, y2, y3; [L26] x1 = __VERIFIER_nondet_int() [L27] x2 = __VERIFIER_nondet_int() [L29] CALL assume_abort_if_not(x1 >= 0) VAL [\old(cond)=1, counter=0] [L13] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L29] RET assume_abort_if_not(x1 >= 0) VAL [counter=0, x1=1073741824] [L30] CALL assume_abort_if_not(x2 != 0) VAL [\old(cond)=1, counter=0] [L13] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L30] RET assume_abort_if_not(x2 != 0) VAL [counter=0, x1=1073741824, x2=1] [L32] y1 = 0 [L33] y2 = 0 [L34] y3 = x1 VAL [counter=0, x1=1073741824, x2=1, y1=0, y2=0, y3=1073741824] [L36] EXPR counter++ VAL [counter=1, x1=1073741824, x2=1, y1=0, y2=0, y3=1073741824] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=1] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=1, x1=1073741824, x2=1, y1=0, y2=0, y3=1073741824] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=1, x1=1073741824, x2=1, y1=0, y2=0, y3=1073741824] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=1, x1=1073741824, x2=1, y1=1, y2=0, y3=1073741823] [L36] EXPR counter++ VAL [counter=2, x1=1073741824, x2=1, y1=1, y2=0, y3=1073741823] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=2] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=2, x1=1073741824, x2=1, y1=1, y2=0, y3=1073741823] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=2, x1=1073741824, x2=1, y1=1, y2=0, y3=1073741823] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=2, x1=1073741824, x2=1, y1=2, y2=0, y3=1073741822] [L36] EXPR counter++ VAL [counter=3, x1=1073741824, x2=1, y1=2, y2=0, y3=1073741822] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=3] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=3, x1=1073741824, x2=1, y1=2, y2=0, y3=1073741822] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=3, x1=1073741824, x2=1, y1=2, y2=0, y3=1073741822] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=3, x1=1073741824, x2=1, y1=3, y2=0, y3=1073741821] [L36] EXPR counter++ VAL [counter=4, x1=1073741824, x2=1, y1=3, y2=0, y3=1073741821] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=4] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=4, x1=1073741824, x2=1, y1=3, y2=0, y3=1073741821] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=4, x1=1073741824, x2=1, y1=3, y2=0, y3=1073741821] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=4, x1=1073741824, x2=1, y1=4, y2=0, y3=1073741820] [L36] EXPR counter++ VAL [counter=5, x1=1073741824, x2=1, y1=4, y2=0, y3=1073741820] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=5] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=5, x1=1073741824, x2=1, y1=4, y2=0, y3=1073741820] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=5, x1=1073741824, x2=1, y1=4, y2=0, y3=1073741820] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=5, x1=1073741824, x2=1, y1=5, y2=0, y3=1073741819] [L36] EXPR counter++ VAL [counter=6, x1=1073741824, x2=1, y1=5, y2=0, y3=1073741819] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=6] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=6, x1=1073741824, x2=1, y1=5, y2=0, y3=1073741819] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=6, x1=1073741824, x2=1, y1=5, y2=0, y3=1073741819] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=6, x1=1073741824, x2=1, y1=6, y2=0, y3=1073741818] [L36] EXPR counter++ VAL [counter=7, x1=1073741824, x2=1, y1=6, y2=0, y3=1073741818] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=7] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=7, x1=1073741824, x2=1, y1=6, y2=0, y3=1073741818] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=7, x1=1073741824, x2=1, y1=6, y2=0, y3=1073741818] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=7, x1=1073741824, x2=1, y1=7, y2=0, y3=1073741817] [L36] EXPR counter++ VAL [counter=8, x1=1073741824, x2=1, y1=7, y2=0, y3=1073741817] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=8] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=8, x1=1073741824, x2=1, y1=7, y2=0, y3=1073741817] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=8, x1=1073741824, x2=1, y1=7, y2=0, y3=1073741817] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=8, x1=1073741824, x2=1, y1=8, y2=0, y3=1073741816] [L36] EXPR counter++ VAL [counter=9, x1=1073741824, x2=1, y1=8, y2=0, y3=1073741816] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=9] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=9, x1=1073741824, x2=1, y1=8, y2=0, y3=1073741816] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=9, x1=1073741824, x2=1, y1=8, y2=0, y3=1073741816] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=9, x1=1073741824, x2=1, y1=9, y2=0, y3=1073741815] [L36] EXPR counter++ VAL [counter=10, x1=1073741824, x2=1, y1=9, y2=0, y3=1073741815] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=10] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=10, x1=1073741824, x2=1, y1=9, y2=0, y3=1073741815] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=10, x1=1073741824, x2=1, y1=9, y2=0, y3=1073741815] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=10, x1=1073741824, x2=1, y1=10, y2=0, y3=1073741814] [L36] EXPR counter++ VAL [counter=11, x1=1073741824, x2=1, y1=10, y2=0, y3=1073741814] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=11] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=11, x1=1073741824, x2=1, y1=10, y2=0, y3=1073741814] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=11, x1=1073741824, x2=1, y1=10, y2=0, y3=1073741814] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=11, x1=1073741824, x2=1, y1=11, y2=0, y3=1073741813] [L36] EXPR counter++ VAL [counter=12, x1=1073741824, x2=1, y1=11, y2=0, y3=1073741813] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=12] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=12, x1=1073741824, x2=1, y1=11, y2=0, y3=1073741813] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=12, x1=1073741824, x2=1, y1=11, y2=0, y3=1073741813] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=12, x1=1073741824, x2=1, y1=12, y2=0, y3=1073741812] [L36] EXPR counter++ VAL [counter=13, x1=1073741824, x2=1, y1=12, y2=0, y3=1073741812] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=13] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=13, x1=1073741824, x2=1, y1=12, y2=0, y3=1073741812] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=13, x1=1073741824, x2=1, y1=12, y2=0, y3=1073741812] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=13, x1=1073741824, x2=1, y1=13, y2=0, y3=1073741811] [L36] EXPR counter++ VAL [counter=14, x1=1073741824, x2=1, y1=13, y2=0, y3=1073741811] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=14] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=14, x1=1073741824, x2=1, y1=13, y2=0, y3=1073741811] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=14, x1=1073741824, x2=1, y1=13, y2=0, y3=1073741811] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=14, x1=1073741824, x2=1, y1=14, y2=0, y3=1073741810] [L36] EXPR counter++ VAL [counter=15, x1=1073741824, x2=1, y1=14, y2=0, y3=1073741810] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=15] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=15, x1=1073741824, x2=1, y1=14, y2=0, y3=1073741810] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=15, x1=1073741824, x2=1, y1=14, y2=0, y3=1073741810] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=15, x1=1073741824, x2=1, y1=15, y2=0, y3=1073741809] [L36] EXPR counter++ VAL [counter=16, x1=1073741824, x2=1, y1=15, y2=0, y3=1073741809] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=16] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=16, x1=1073741824, x2=1, y1=15, y2=0, y3=1073741809] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=16, x1=1073741824, x2=1, y1=15, y2=0, y3=1073741809] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=16, x1=1073741824, x2=1, y1=16, y2=0, y3=1073741808] [L36] EXPR counter++ VAL [counter=17, x1=1073741824, x2=1, y1=16, y2=0, y3=1073741808] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=17] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=17, x1=1073741824, x2=1, y1=16, y2=0, y3=1073741808] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=17, x1=1073741824, x2=1, y1=16, y2=0, y3=1073741808] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=17, x1=1073741824, x2=1, y1=17, y2=0, y3=1073741807] [L36] EXPR counter++ VAL [counter=18, x1=1073741824, x2=1, y1=17, y2=0, y3=1073741807] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=18] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=18, x1=1073741824, x2=1, y1=17, y2=0, y3=1073741807] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=18, x1=1073741824, x2=1, y1=17, y2=0, y3=1073741807] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=18, x1=1073741824, x2=1, y1=18, y2=0, y3=1073741806] [L36] EXPR counter++ VAL [counter=19, x1=1073741824, x2=1, y1=18, y2=0, y3=1073741806] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=19] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=19, x1=1073741824, x2=1, y1=18, y2=0, y3=1073741806] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=19, x1=1073741824, x2=1, y1=18, y2=0, y3=1073741806] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=19, x1=1073741824, x2=1, y1=19, y2=0, y3=1073741805] [L36] EXPR counter++ VAL [counter=20, x1=1073741824, x2=1, y1=19, y2=0, y3=1073741805] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=20] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=20, x1=1073741824, x2=1, y1=19, y2=0, y3=1073741805] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=20, x1=1073741824, x2=1, y1=19, y2=0, y3=1073741805] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=20, x1=1073741824, x2=1, y1=20, y2=0, y3=1073741804] [L36] EXPR counter++ VAL [counter=21, x1=1073741824, x2=1, y1=20, y2=0, y3=1073741804] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=21] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=21, x1=1073741824, x2=1, y1=20, y2=0, y3=1073741804] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=21, x1=1073741824, x2=1, y1=20, y2=0, y3=1073741804] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=21, x1=1073741824, x2=1, y1=21, y2=0, y3=1073741803] [L36] EXPR counter++ VAL [counter=22, x1=1073741824, x2=1, y1=21, y2=0, y3=1073741803] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=22] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=22, x1=1073741824, x2=1, y1=21, y2=0, y3=1073741803] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=22, x1=1073741824, x2=1, y1=21, y2=0, y3=1073741803] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=22, x1=1073741824, x2=1, y1=22, y2=0, y3=1073741802] [L36] EXPR counter++ VAL [counter=23, x1=1073741824, x2=1, y1=22, y2=0, y3=1073741802] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=23] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=23, x1=1073741824, x2=1, y1=22, y2=0, y3=1073741802] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=23, x1=1073741824, x2=1, y1=22, y2=0, y3=1073741802] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=23, x1=1073741824, x2=1, y1=23, y2=0, y3=1073741801] [L36] EXPR counter++ VAL [counter=24, x1=1073741824, x2=1, y1=23, y2=0, y3=1073741801] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=24] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=24, x1=1073741824, x2=1, y1=23, y2=0, y3=1073741801] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=24, x1=1073741824, x2=1, y1=23, y2=0, y3=1073741801] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=24, x1=1073741824, x2=1, y1=24, y2=0, y3=1073741800] [L36] EXPR counter++ VAL [counter=25, x1=1073741824, x2=1, y1=24, y2=0, y3=1073741800] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=25] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=25, x1=1073741824, x2=1, y1=24, y2=0, y3=1073741800] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=25, x1=1073741824, x2=1, y1=24, y2=0, y3=1073741800] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=25, x1=1073741824, x2=1, y1=25, y2=0, y3=1073741799] [L36] EXPR counter++ VAL [counter=26, x1=1073741824, x2=1, y1=25, y2=0, y3=1073741799] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=26] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=26, x1=1073741824, x2=1, y1=25, y2=0, y3=1073741799] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=26, x1=1073741824, x2=1, y1=25, y2=0, y3=1073741799] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=26, x1=1073741824, x2=1, y1=26, y2=0, y3=1073741798] [L36] EXPR counter++ VAL [counter=27, x1=1073741824, x2=1, y1=26, y2=0, y3=1073741798] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=27] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=27, x1=1073741824, x2=1, y1=26, y2=0, y3=1073741798] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=27, x1=1073741824, x2=1, y1=26, y2=0, y3=1073741798] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=27, x1=1073741824, x2=1, y1=27, y2=0, y3=1073741797] [L36] EXPR counter++ VAL [counter=28, x1=1073741824, x2=1, y1=27, y2=0, y3=1073741797] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=28] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=28, x1=1073741824, x2=1, y1=27, y2=0, y3=1073741797] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=28, x1=1073741824, x2=1, y1=27, y2=0, y3=1073741797] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=28, x1=1073741824, x2=1, y1=28, y2=0, y3=1073741796] [L36] EXPR counter++ VAL [counter=29, x1=1073741824, x2=1, y1=28, y2=0, y3=1073741796] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=29] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=29, x1=1073741824, x2=1, y1=28, y2=0, y3=1073741796] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=29, x1=1073741824, x2=1, y1=28, y2=0, y3=1073741796] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=29, x1=1073741824, x2=1, y1=29, y2=0, y3=1073741795] [L36] EXPR counter++ VAL [counter=30, x1=1073741824, x2=1, y1=29, y2=0, y3=1073741795] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=30] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=30, x1=1073741824, x2=1, y1=29, y2=0, y3=1073741795] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=30, x1=1073741824, x2=1, y1=29, y2=0, y3=1073741795] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=30, x1=1073741824, x2=1, y1=30, y2=0, y3=1073741794] [L36] EXPR counter++ VAL [counter=31, x1=1073741824, x2=1, y1=30, y2=0, y3=1073741794] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=31] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=31, x1=1073741824, x2=1, y1=30, y2=0, y3=1073741794] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=31, x1=1073741824, x2=1, y1=30, y2=0, y3=1073741794] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=31, x1=1073741824, x2=1, y1=31, y2=0, y3=1073741793] [L36] EXPR counter++ VAL [counter=32, x1=1073741824, x2=1, y1=31, y2=0, y3=1073741793] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=32] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=32, x1=1073741824, x2=1, y1=31, y2=0, y3=1073741793] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=32, x1=1073741824, x2=1, y1=31, y2=0, y3=1073741793] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=32, x1=1073741824, x2=1, y1=32, y2=0, y3=1073741792] [L36] EXPR counter++ VAL [counter=33, x1=1073741824, x2=1, y1=32, y2=0, y3=1073741792] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=33] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=33, x1=1073741824, x2=1, y1=32, y2=0, y3=1073741792] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=33, x1=1073741824, x2=1, y1=32, y2=0, y3=1073741792] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=33, x1=1073741824, x2=1, y1=33, y2=0, y3=1073741791] [L36] EXPR counter++ VAL [counter=34, x1=1073741824, x2=1, y1=33, y2=0, y3=1073741791] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=34] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=34, x1=1073741824, x2=1, y1=33, y2=0, y3=1073741791] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=34, x1=1073741824, x2=1, y1=33, y2=0, y3=1073741791] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=34, x1=1073741824, x2=1, y1=34, y2=0, y3=1073741790] [L36] EXPR counter++ VAL [counter=35, x1=1073741824, x2=1, y1=34, y2=0, y3=1073741790] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=35] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=35, x1=1073741824, x2=1, y1=34, y2=0, y3=1073741790] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=35, x1=1073741824, x2=1, y1=34, y2=0, y3=1073741790] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=35, x1=1073741824, x2=1, y1=35, y2=0, y3=1073741789] [L36] EXPR counter++ VAL [counter=36, x1=1073741824, x2=1, y1=35, y2=0, y3=1073741789] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=36] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=36, x1=1073741824, x2=1, y1=35, y2=0, y3=1073741789] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=36, x1=1073741824, x2=1, y1=35, y2=0, y3=1073741789] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=36, x1=1073741824, x2=1, y1=36, y2=0, y3=1073741788] [L36] EXPR counter++ VAL [counter=37, x1=1073741824, x2=1, y1=36, y2=0, y3=1073741788] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=37] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=37, x1=1073741824, x2=1, y1=36, y2=0, y3=1073741788] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=37, x1=1073741824, x2=1, y1=36, y2=0, y3=1073741788] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=37, x1=1073741824, x2=1, y1=37, y2=0, y3=1073741787] [L36] EXPR counter++ VAL [counter=38, x1=1073741824, x2=1, y1=37, y2=0, y3=1073741787] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=38] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=38, x1=1073741824, x2=1, y1=37, y2=0, y3=1073741787] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=38, x1=1073741824, x2=1, y1=37, y2=0, y3=1073741787] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=38, x1=1073741824, x2=1, y1=38, y2=0, y3=1073741786] [L36] EXPR counter++ VAL [counter=39, x1=1073741824, x2=1, y1=38, y2=0, y3=1073741786] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=39] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=39, x1=1073741824, x2=1, y1=38, y2=0, y3=1073741786] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=39, x1=1073741824, x2=1, y1=38, y2=0, y3=1073741786] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=39, x1=1073741824, x2=1, y1=39, y2=0, y3=1073741785] [L36] EXPR counter++ VAL [counter=40, x1=1073741824, x2=1, y1=39, y2=0, y3=1073741785] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=40] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=40, x1=1073741824, x2=1, y1=39, y2=0, y3=1073741785] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=40, x1=1073741824, x2=1, y1=39, y2=0, y3=1073741785] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=40, x1=1073741824, x2=1, y1=40, y2=0, y3=1073741784] [L36] EXPR counter++ VAL [counter=41, x1=1073741824, x2=1, y1=40, y2=0, y3=1073741784] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=41] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=41, x1=1073741824, x2=1, y1=40, y2=0, y3=1073741784] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=41, x1=1073741824, x2=1, y1=40, y2=0, y3=1073741784] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=41, x1=1073741824, x2=1, y1=41, y2=0, y3=1073741783] [L36] EXPR counter++ VAL [counter=42, x1=1073741824, x2=1, y1=41, y2=0, y3=1073741783] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=42] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=42, x1=1073741824, x2=1, y1=41, y2=0, y3=1073741783] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=42, x1=1073741824, x2=1, y1=41, y2=0, y3=1073741783] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=42, x1=1073741824, x2=1, y1=42, y2=0, y3=1073741782] [L36] EXPR counter++ VAL [counter=43, x1=1073741824, x2=1, y1=42, y2=0, y3=1073741782] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=43] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=43, x1=1073741824, x2=1, y1=42, y2=0, y3=1073741782] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=43, x1=1073741824, x2=1, y1=42, y2=0, y3=1073741782] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=43, x1=1073741824, x2=1, y1=43, y2=0, y3=1073741781] [L36] EXPR counter++ VAL [counter=44, x1=1073741824, x2=1, y1=43, y2=0, y3=1073741781] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=44] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=44, x1=1073741824, x2=1, y1=43, y2=0, y3=1073741781] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=44, x1=1073741824, x2=1, y1=43, y2=0, y3=1073741781] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=44, x1=1073741824, x2=1, y1=44, y2=0, y3=1073741780] [L36] EXPR counter++ VAL [counter=45, x1=1073741824, x2=1, y1=44, y2=0, y3=1073741780] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=45] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=45, x1=1073741824, x2=1, y1=44, y2=0, y3=1073741780] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=45, x1=1073741824, x2=1, y1=44, y2=0, y3=1073741780] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=45, x1=1073741824, x2=1, y1=45, y2=0, y3=1073741779] [L36] EXPR counter++ VAL [counter=46, x1=1073741824, x2=1, y1=45, y2=0, y3=1073741779] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=46] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=46, x1=1073741824, x2=1, y1=45, y2=0, y3=1073741779] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=46, x1=1073741824, x2=1, y1=45, y2=0, y3=1073741779] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=46, x1=1073741824, x2=1, y1=46, y2=0, y3=1073741778] [L36] EXPR counter++ VAL [counter=47, x1=1073741824, x2=1, y1=46, y2=0, y3=1073741778] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=47] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=47, x1=1073741824, x2=1, y1=46, y2=0, y3=1073741778] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=47, x1=1073741824, x2=1, y1=46, y2=0, y3=1073741778] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=47, x1=1073741824, x2=1, y1=47, y2=0, y3=1073741777] [L36] EXPR counter++ VAL [counter=48, x1=1073741824, x2=1, y1=47, y2=0, y3=1073741777] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=48] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=48, x1=1073741824, x2=1, y1=47, y2=0, y3=1073741777] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=48, x1=1073741824, x2=1, y1=47, y2=0, y3=1073741777] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=48, x1=1073741824, x2=1, y1=48, y2=0, y3=1073741776] [L36] EXPR counter++ VAL [counter=49, x1=1073741824, x2=1, y1=48, y2=0, y3=1073741776] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=49] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=49, x1=1073741824, x2=1, y1=48, y2=0, y3=1073741776] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=49, x1=1073741824, x2=1, y1=48, y2=0, y3=1073741776] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=49, x1=1073741824, x2=1, y1=49, y2=0, y3=1073741775] [L36] EXPR counter++ VAL [counter=50, x1=1073741824, x2=1, y1=49, y2=0, y3=1073741775] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=50] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=50, x1=1073741824, x2=1, y1=49, y2=0, y3=1073741775] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=50, x1=1073741824, x2=1, y1=49, y2=0, y3=1073741775] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=50, x1=1073741824, x2=1, y1=50, y2=0, y3=1073741774] [L36] EXPR counter++ VAL [counter=51, x1=1073741824, x2=1, y1=50, y2=0, y3=1073741774] [L36] COND FALSE !(counter++<50) [L50] CALL __VERIFIER_assert(y1*x2 + y2 == x1) VAL [\old(cond)=0, counter=51] [L16] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=51] [L18] reach_error() VAL [\old(cond)=0, cond=0, counter=51] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 204.4s, OverallIterations: 15, TraceHistogramMax: 51, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 156.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 8217 SdHoareTripleChecker+Valid, 35.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8211 mSDsluCounter, 13837 SdHoareTripleChecker+Invalid, 33.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12931 mSDsCounter, 1797 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9024 IncrementalHoareTripleChecker+Invalid, 10824 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1797 mSolverCounterUnsat, 906 mSDtfsCounter, 9024 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2525 GetRequests, 1960 SyntacticMatches, 0 SemanticMatches, 565 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15526 ImplicationChecksByTransitivity, 135.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3970occurred in iteration=14, InterpolantAutomatonStates: 453, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 14 MinimizatonAttempts, 59 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 13.4s SatisfiabilityAnalysisTime, 21.8s InterpolantComputationTime, 1598 NumberOfCodeBlocks, 1598 NumberOfCodeBlocksAsserted, 124 NumberOfCheckSat, 2151 ConstructedInterpolants, 3 QuantifiedInterpolants, 8963 SizeOfPredicates, 103 NumberOfNonLiveVariables, 2005 ConjunctsInSsa, 285 ConjunctsInUnsatCore, 26 InterpolantComputations, 4 PerfectInterpolantSequences, 5874/24742 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 proved your program to be incorrect! [2023-12-25 04:20:53,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...