/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/lcm2_valuebound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 04:15:57,221 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 04:15:57,290 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:15:57,293 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 04:15:57,294 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 04:15:57,316 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 04:15:57,317 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 04:15:57,317 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 04:15:57,317 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 04:15:57,320 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 04:15:57,321 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 04:15:57,321 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 04:15:57,322 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 04:15:57,323 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 04:15:57,323 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 04:15:57,323 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 04:15:57,323 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 04:15:57,324 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 04:15:57,324 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 04:15:57,324 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 04:15:57,324 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 04:15:57,325 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 04:15:57,325 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 04:15:57,325 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 04:15:57,325 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 04:15:57,325 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 04:15:57,325 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 04:15:57,325 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 04:15:57,326 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 04:15:57,326 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 04:15:57,327 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 04:15:57,327 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 04:15:57,327 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 04:15:57,327 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 04:15:57,327 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 04:15:57,327 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 04:15:57,327 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 04:15:57,327 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 04:15:57,328 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 04:15:57,328 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 04:15:57,328 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 04:15:57,328 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 04:15:57,328 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 04:15:57,328 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 04:15:57,328 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 04:15:57,329 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 04:15:57,329 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:15:57,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 04:15:57,543 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 04:15:57,545 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 04:15:57,546 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 04:15:57,546 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 04:15:57,547 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/lcm2_valuebound2.c [2023-12-25 04:15:58,649 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 04:15:58,819 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 04:15:58,820 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/lcm2_valuebound2.c [2023-12-25 04:15:58,826 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71206ece7/60bfe758c10c4cceadf656d35cd9524c/FLAG2262b6544 [2023-12-25 04:15:58,839 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71206ece7/60bfe758c10c4cceadf656d35cd9524c [2023-12-25 04:15:58,841 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 04:15:58,842 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 04:15:58,844 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 04:15:58,844 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 04:15:58,848 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 04:15:58,848 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 04:15:58" (1/1) ... [2023-12-25 04:15:58,849 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@697d2c1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:15:58, skipping insertion in model container [2023-12-25 04:15:58,850 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 04:15:58" (1/1) ... [2023-12-25 04:15:58,867 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 04:15:59,020 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/lcm2_valuebound2.c[537,550] [2023-12-25 04:15:59,030 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 04:15:59,039 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 04:15:59,048 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/lcm2_valuebound2.c[537,550] [2023-12-25 04:15:59,052 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 04:15:59,061 INFO L206 MainTranslator]: Completed translation [2023-12-25 04:15:59,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:15:59 WrapperNode [2023-12-25 04:15:59,062 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 04:15:59,063 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 04:15:59,063 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 04:15:59,063 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 04:15:59,067 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:15:59" (1/1) ... [2023-12-25 04:15:59,072 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:15:59" (1/1) ... [2023-12-25 04:15:59,083 INFO L138 Inliner]: procedures = 14, calls = 22, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53 [2023-12-25 04:15:59,083 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 04:15:59,084 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 04:15:59,084 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 04:15:59,084 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 04:15:59,092 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:15:59" (1/1) ... [2023-12-25 04:15:59,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:15:59" (1/1) ... [2023-12-25 04:15:59,093 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:15:59" (1/1) ... [2023-12-25 04:15:59,102 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2023-12-25 04:15:59,102 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:15:59" (1/1) ... [2023-12-25 04:15:59,102 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:15:59" (1/1) ... [2023-12-25 04:15:59,105 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:15:59" (1/1) ... [2023-12-25 04:15:59,107 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:15:59" (1/1) ... [2023-12-25 04:15:59,108 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:15:59" (1/1) ... [2023-12-25 04:15:59,109 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:15:59" (1/1) ... [2023-12-25 04:15:59,110 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 04:15:59,110 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 04:15:59,110 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 04:15:59,111 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 04:15:59,111 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:15:59" (1/1) ... [2023-12-25 04:15:59,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 04:15:59,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 04:15:59,148 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:15:59,150 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:15:59,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 04:15:59,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 04:15:59,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-25 04:15:59,168 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 04:15:59,168 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 04:15:59,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 04:15:59,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 04:15:59,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 04:15:59,169 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 04:15:59,211 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 04:15:59,213 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 04:15:59,366 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 04:15:59,398 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 04:15:59,398 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 04:15:59,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 04:15:59 BoogieIcfgContainer [2023-12-25 04:15:59,398 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 04:15:59,427 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 04:15:59,428 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 04:15:59,430 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 04:15:59,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 04:15:58" (1/3) ... [2023-12-25 04:15:59,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@440aed26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 04:15:59, skipping insertion in model container [2023-12-25 04:15:59,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:15:59" (2/3) ... [2023-12-25 04:15:59,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@440aed26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 04:15:59, skipping insertion in model container [2023-12-25 04:15:59,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 04:15:59" (3/3) ... [2023-12-25 04:15:59,432 INFO L112 eAbstractionObserver]: Analyzing ICFG lcm2_valuebound2.c [2023-12-25 04:15:59,446 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 04:15:59,446 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 04:15:59,497 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 04:15:59,508 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;@3d360403, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 04:15:59,509 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 04:15:59,512 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-25 04:15:59,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-25 04:15:59,518 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:15:59,519 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:15:59,519 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:15:59,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:15:59,525 INFO L85 PathProgramCache]: Analyzing trace with hash -928420541, now seen corresponding path program 1 times [2023-12-25 04:15:59,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:15:59,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1447006908] [2023-12-25 04:15:59,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:15:59,534 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:15:59,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:15:59,537 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:15:59,538 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:15:59,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:15:59,623 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 04:15:59,629 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:15:59,647 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-25 04:15:59,647 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 04:15:59,648 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:15:59,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1447006908] [2023-12-25 04:15:59,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1447006908] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 04:15:59,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 04:15:59,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 04:15:59,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225974919] [2023-12-25 04:15:59,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 04:15:59,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 04:15:59,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:15:59,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 04:15:59,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 04:15:59,676 INFO L87 Difference]: Start difference. First operand has 26 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-25 04:15:59,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:15:59,703 INFO L93 Difference]: Finished difference Result 50 states and 79 transitions. [2023-12-25 04:15:59,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 04:15:59,705 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 38 [2023-12-25 04:15:59,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:15:59,709 INFO L225 Difference]: With dead ends: 50 [2023-12-25 04:15:59,709 INFO L226 Difference]: Without dead ends: 24 [2023-12-25 04:15:59,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 37 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:15:59,714 INFO L413 NwaCegarLoop]: 31 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, 31 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:15:59,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 04:15:59,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-25 04:15:59,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-12-25 04:15:59,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-25 04:15:59,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2023-12-25 04:15:59,743 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 38 [2023-12-25 04:15:59,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:15:59,743 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2023-12-25 04:15:59,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-25 04:15:59,744 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2023-12-25 04:15:59,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-25 04:15:59,745 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:15:59,745 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:15:59,748 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 (2)] Ended with exit code 0 [2023-12-25 04:15:59,950 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:15:59,950 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:15:59,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:15:59,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1756515979, now seen corresponding path program 1 times [2023-12-25 04:15:59,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:15:59,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1083838661] [2023-12-25 04:15:59,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:15:59,952 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:15:59,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:15:59,953 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:15:59,955 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:16:00,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:16:00,054 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-25 04:16:00,058 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:16:00,404 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-25 04:16:00,405 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:16:01,545 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-25 04:16:01,545 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:16:01,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1083838661] [2023-12-25 04:16:01,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1083838661] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 04:16:01,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 04:16:01,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2023-12-25 04:16:01,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918507735] [2023-12-25 04:16:01,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 04:16:01,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 04:16:01,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:16:01,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 04:16:01,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-12-25 04:16:01,548 INFO L87 Difference]: Start difference. First operand 24 states and 31 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-25 04:16:06,006 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:16:10,076 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:16:10,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:16:10,382 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2023-12-25 04:16:10,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 04:16:10,389 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 38 [2023-12-25 04:16:10,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:16:10,390 INFO L225 Difference]: With dead ends: 35 [2023-12-25 04:16:10,390 INFO L226 Difference]: Without dead ends: 32 [2023-12-25 04:16:10,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2023-12-25 04:16:10,392 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 8 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2023-12-25 04:16:10,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 88 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 2 Unknown, 0 Unchecked, 8.8s Time] [2023-12-25 04:16:10,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-25 04:16:10,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2023-12-25 04:16:10,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-25 04:16:10,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2023-12-25 04:16:10,399 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 38 [2023-12-25 04:16:10,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:16:10,400 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2023-12-25 04:16:10,400 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-25 04:16:10,400 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2023-12-25 04:16:10,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-25 04:16:10,401 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:16:10,401 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:16:10,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-25 04:16:10,601 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:16:10,602 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:16:10,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:16:10,603 INFO L85 PathProgramCache]: Analyzing trace with hash 792120606, now seen corresponding path program 1 times [2023-12-25 04:16:10,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:16:10,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1319098792] [2023-12-25 04:16:10,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:16:10,603 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:16:10,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:16:10,610 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:16:10,611 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:16:10,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:16:10,685 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-25 04:16:10,687 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:16:11,648 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-25 04:16:11,648 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:16:15,109 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-25 04:16:15,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:16:15,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1319098792] [2023-12-25 04:16:15,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1319098792] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 04:16:15,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 04:16:15,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 16 [2023-12-25 04:16:15,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202053555] [2023-12-25 04:16:15,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 04:16:15,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 04:16:15,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:16:15,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 04:16:15,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2023-12-25 04:16:15,111 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-25 04:16:19,706 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:16:23,773 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:16:24,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:16:24,152 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2023-12-25 04:16:24,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 04:16:24,160 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 46 [2023-12-25 04:16:24,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:16:24,161 INFO L225 Difference]: With dead ends: 42 [2023-12-25 04:16:24,161 INFO L226 Difference]: Without dead ends: 39 [2023-12-25 04:16:24,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2023-12-25 04:16:24,162 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 9 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2023-12-25 04:16:24,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 88 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 2 Unknown, 0 Unchecked, 8.9s Time] [2023-12-25 04:16:24,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-25 04:16:24,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2023-12-25 04:16:24,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-25 04:16:24,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2023-12-25 04:16:24,167 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 46 [2023-12-25 04:16:24,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:16:24,168 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2023-12-25 04:16:24,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-25 04:16:24,168 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2023-12-25 04:16:24,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-25 04:16:24,169 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:16:24,169 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:16:24,173 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:16:24,373 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:16:24,374 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:16:24,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:16:24,374 INFO L85 PathProgramCache]: Analyzing trace with hash 849378908, now seen corresponding path program 1 times [2023-12-25 04:16:24,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:16:24,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [777706058] [2023-12-25 04:16:24,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:16:24,375 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:16:24,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:16:24,376 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:16:24,380 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:16:24,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:16:24,447 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-25 04:16:24,450 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:16:24,979 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-25 04:16:24,979 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:16:29,153 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-25 04:16:29,153 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:16:29,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [777706058] [2023-12-25 04:16:29,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [777706058] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 04:16:29,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 04:16:29,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 18 [2023-12-25 04:16:29,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561272664] [2023-12-25 04:16:29,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 04:16:29,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-25 04:16:29,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:16:29,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-25 04:16:29,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2023-12-25 04:16:29,155 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-25 04:16:33,868 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:16:37,874 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:16:41,917 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:16:42,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:16:42,460 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2023-12-25 04:16:42,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 04:16:42,466 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 46 [2023-12-25 04:16:42,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:16:42,467 INFO L225 Difference]: With dead ends: 51 [2023-12-25 04:16:42,467 INFO L226 Difference]: Without dead ends: 48 [2023-12-25 04:16:42,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2023-12-25 04:16:42,469 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 9 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2023-12-25 04:16:42,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 110 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 3 Unknown, 0 Unchecked, 13.1s Time] [2023-12-25 04:16:42,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-12-25 04:16:42,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2023-12-25 04:16:42,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 32 states have internal predecessors, (37), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-25 04:16:42,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2023-12-25 04:16:42,476 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 46 [2023-12-25 04:16:42,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:16:42,476 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2023-12-25 04:16:42,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-25 04:16:42,476 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2023-12-25 04:16:42,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-25 04:16:42,477 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:16:42,477 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:16:42,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-25 04:16:42,678 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 [2023-12-25 04:16:42,678 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:16:42,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:16:42,679 INFO L85 PathProgramCache]: Analyzing trace with hash 118667759, now seen corresponding path program 1 times [2023-12-25 04:16:42,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:16:42,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1079553625] [2023-12-25 04:16:42,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:16:42,683 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:16:42,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:16:42,689 INFO L229 MonitoredProcess]: Starting monitored process 6 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:16:42,690 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 (6)] Waiting until timeout for monitored process [2023-12-25 04:16:42,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:16:42,779 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-25 04:16:42,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:16:42,984 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-25 04:16:42,985 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:16:43,267 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 18 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-25 04:16:43,267 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:16:43,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1079553625] [2023-12-25 04:16:43,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1079553625] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 04:16:43,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 04:16:43,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2023-12-25 04:16:43,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925352149] [2023-12-25 04:16:43,268 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 04:16:43,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-25 04:16:43,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:16:43,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-25 04:16:43,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2023-12-25 04:16:43,269 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 15 states, 12 states have (on average 2.5) internal successors, (30), 10 states have internal predecessors, (30), 12 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 10 states have call predecessors, (15), 11 states have call successors, (15) [2023-12-25 04:16:43,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:16:43,537 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2023-12-25 04:16:43,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 04:16:43,537 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 2.5) internal successors, (30), 10 states have internal predecessors, (30), 12 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 10 states have call predecessors, (15), 11 states have call successors, (15) Word has length 54 [2023-12-25 04:16:43,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:16:43,538 INFO L225 Difference]: With dead ends: 68 [2023-12-25 04:16:43,538 INFO L226 Difference]: Without dead ends: 42 [2023-12-25 04:16:43,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2023-12-25 04:16:43,539 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 23 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 04:16:43,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 122 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 04:16:43,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-25 04:16:43,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2023-12-25 04:16:43,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 04:16:43,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2023-12-25 04:16:43,544 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 54 [2023-12-25 04:16:43,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:16:43,545 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2023-12-25 04:16:43,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 2.5) internal successors, (30), 10 states have internal predecessors, (30), 12 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 10 states have call predecessors, (15), 11 states have call successors, (15) [2023-12-25 04:16:43,545 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2023-12-25 04:16:43,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-25 04:16:43,546 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:16:43,546 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:16:43,553 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 (6)] Forceful destruction successful, exit code 0 [2023-12-25 04:16:43,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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:16:43,751 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:16:43,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:16:43,752 INFO L85 PathProgramCache]: Analyzing trace with hash -949707793, now seen corresponding path program 2 times [2023-12-25 04:16:43,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:16:43,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [436388883] [2023-12-25 04:16:43,752 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 04:16:43,752 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:16:43,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:16:43,757 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:16:43,758 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:16:43,859 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 04:16:43,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 04:16:43,865 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-25 04:16:43,867 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:16:44,131 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-25 04:16:44,131 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:16:44,483 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 18 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-25 04:16:44,483 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:16:44,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [436388883] [2023-12-25 04:16:44,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [436388883] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 04:16:44,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 04:16:44,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2023-12-25 04:16:44,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854333552] [2023-12-25 04:16:44,483 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 04:16:44,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-25 04:16:44,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:16:44,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-25 04:16:44,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2023-12-25 04:16:44,485 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 17 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 12 states have internal predecessors, (31), 12 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 11 states have call predecessors, (16), 11 states have call successors, (16) [2023-12-25 04:16:44,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:16:44,824 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2023-12-25 04:16:44,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 04:16:44,832 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 12 states have internal predecessors, (31), 12 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 11 states have call predecessors, (16), 11 states have call successors, (16) Word has length 54 [2023-12-25 04:16:44,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:16:44,833 INFO L225 Difference]: With dead ends: 49 [2023-12-25 04:16:44,833 INFO L226 Difference]: Without dead ends: 0 [2023-12-25 04:16:44,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2023-12-25 04:16:44,834 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 15 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 04:16:44,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 122 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 04:16:44,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-25 04:16:44,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-25 04:16:44,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 04:16:44,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-25 04:16:44,835 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2023-12-25 04:16:44,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:16:44,835 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-25 04:16:44,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 12 states have internal predecessors, (31), 12 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 11 states have call predecessors, (16), 11 states have call successors, (16) [2023-12-25 04:16:44,835 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-25 04:16:44,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-25 04:16:44,837 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 04:16:44,843 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:16:45,039 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:16:45,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-25 04:16:47,263 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-25 04:16:47,263 INFO L895 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: (and (bvuge |ULTIMATE.start_main_~a~0#1| (_ bv1 32)) (bvule |ULTIMATE.start_main_~b~0#1| (_ bv2 32)) (bvule |ULTIMATE.start_main_~a~0#1| (_ bv2 32)) (bvuge |ULTIMATE.start_main_~b~0#1| (_ bv1 32))) [2023-12-25 04:16:47,263 INFO L895 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: (and (bvuge |ULTIMATE.start_main_~a~0#1| (_ bv1 32)) (bvule |ULTIMATE.start_main_~b~0#1| (_ bv2 32)) (bvule |ULTIMATE.start_main_~a~0#1| (_ bv2 32)) (bvuge |ULTIMATE.start_main_~b~0#1| (_ bv1 32))) [2023-12-25 04:16:47,264 INFO L895 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: (bvule |ULTIMATE.start_main_~a~0#1| (_ bv2 32)) [2023-12-25 04:16:47,264 INFO L895 garLoopResultBuilder]: At program point L25-1(line 25) the Hoare annotation is: (and (bvule |ULTIMATE.start_main_~b~0#1| (_ bv2 32)) (bvule |ULTIMATE.start_main_~a~0#1| (_ bv2 32))) [2023-12-25 04:16:47,264 INFO L902 garLoopResultBuilder]: At program point L23(line 23) the Hoare annotation is: true [2023-12-25 04:16:47,264 INFO L899 garLoopResultBuilder]: For program point L23-1(line 23) no Hoare annotation was computed. [2023-12-25 04:16:47,264 INFO L899 garLoopResultBuilder]: For program point L52(line 52) no Hoare annotation was computed. [2023-12-25 04:16:47,264 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-25 04:16:47,265 INFO L895 garLoopResultBuilder]: At program point L38(line 38) the Hoare annotation is: (and (bvule |ULTIMATE.start_main_~y~0#1| (_ bv2 32)) (bvuge |ULTIMATE.start_main_~a~0#1| (_ bv1 32)) (bvuge |ULTIMATE.start_main_~x~0#1| (_ bv1 32)) (bvuge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (bvule |ULTIMATE.start_main_~b~0#1| (_ bv2 32)) (bvule |ULTIMATE.start_main_~x~0#1| (_ bv2 32)) (bvule |ULTIMATE.start_main_~a~0#1| (_ bv2 32)) (bvuge |ULTIMATE.start_main_~b~0#1| (_ bv1 32)) (= (bvadd (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~v~0#1|) (bvmul |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~u~0#1|)) (bvmul (bvmul |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~a~0#1|) (_ bv2 32)))) [2023-12-25 04:16:47,265 INFO L899 garLoopResultBuilder]: For program point L38-1(lines 37 50) no Hoare annotation was computed. [2023-12-25 04:16:47,265 INFO L899 garLoopResultBuilder]: For program point L30(line 30) no Hoare annotation was computed. [2023-12-25 04:16:47,265 INFO L895 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: (and (bvuge |ULTIMATE.start_main_~a~0#1| (_ bv1 32)) (bvule |ULTIMATE.start_main_~b~0#1| (_ bv2 32)) (bvule |ULTIMATE.start_main_~a~0#1| (_ bv2 32))) [2023-12-25 04:16:47,265 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 49) no Hoare annotation was computed. [2023-12-25 04:16:47,265 INFO L895 garLoopResultBuilder]: At program point L43-2(lines 37 50) the Hoare annotation is: (and (bvule |ULTIMATE.start_main_~y~0#1| (_ bv2 32)) (bvuge |ULTIMATE.start_main_~a~0#1| (_ bv1 32)) (bvuge |ULTIMATE.start_main_~x~0#1| (_ bv1 32)) (bvuge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (bvule |ULTIMATE.start_main_~b~0#1| (_ bv2 32)) (bvule |ULTIMATE.start_main_~x~0#1| (_ bv2 32)) (bvule |ULTIMATE.start_main_~a~0#1| (_ bv2 32)) (bvuge |ULTIMATE.start_main_~b~0#1| (_ bv1 32)) (= (bvadd (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~v~0#1|) (bvmul |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~u~0#1|)) (bvmul (bvmul |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~a~0#1|) (_ bv2 32)))) [2023-12-25 04:16:47,266 INFO L895 garLoopResultBuilder]: At program point L37-2(lines 37 50) the Hoare annotation is: (= (bvadd (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~v~0#1|) (bvmul |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~u~0#1|)) (bvmul (bvmul |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~a~0#1|) (_ bv2 32))) [2023-12-25 04:16:47,266 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 8 10) the Hoare annotation is: true [2023-12-25 04:16:47,266 INFO L899 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2023-12-25 04:16:47,266 INFO L899 garLoopResultBuilder]: For program point L9-2(lines 8 10) no Hoare annotation was computed. [2023-12-25 04:16:47,266 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 8 10) no Hoare annotation was computed. [2023-12-25 04:16:47,266 INFO L899 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2023-12-25 04:16:47,266 INFO L899 garLoopResultBuilder]: For program point L12(lines 12 15) no Hoare annotation was computed. [2023-12-25 04:16:47,266 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 17) no Hoare annotation was computed. [2023-12-25 04:16:47,266 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 11 17) no Hoare annotation was computed. [2023-12-25 04:16:47,268 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 11 17) the Hoare annotation is: true [2023-12-25 04:16:47,268 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2023-12-25 04:16:47,270 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2023-12-25 04:16:47,271 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 04:16:47,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 04:16:47 BoogieIcfgContainer [2023-12-25 04:16:47,296 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 04:16:47,296 INFO L158 Benchmark]: Toolchain (without parser) took 48454.17ms. Allocated memory is still 299.9MB. Free memory was 245.5MB in the beginning and 217.2MB in the end (delta: 28.2MB). Peak memory consumption was 27.9MB. Max. memory is 8.0GB. [2023-12-25 04:16:47,296 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 237.0MB. Free memory is still 187.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 04:16:47,297 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.04ms. Allocated memory is still 299.9MB. Free memory was 245.2MB in the beginning and 233.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 04:16:47,297 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.88ms. Allocated memory is still 299.9MB. Free memory was 233.7MB in the beginning and 232.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 04:16:47,297 INFO L158 Benchmark]: Boogie Preprocessor took 25.85ms. Allocated memory is still 299.9MB. Free memory was 232.1MB in the beginning and 230.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 04:16:47,297 INFO L158 Benchmark]: RCFGBuilder took 287.90ms. Allocated memory is still 299.9MB. Free memory was 230.0MB in the beginning and 217.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-25 04:16:47,298 INFO L158 Benchmark]: TraceAbstraction took 47868.44ms. Allocated memory is still 299.9MB. Free memory was 267.3MB in the beginning and 217.2MB in the end (delta: 50.0MB). Peak memory consumption was 50.0MB. Max. memory is 8.0GB. [2023-12-25 04:16:47,299 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.14ms. Allocated memory is still 237.0MB. Free memory is still 187.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 218.04ms. Allocated memory is still 299.9MB. Free memory was 245.2MB in the beginning and 233.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.88ms. Allocated memory is still 299.9MB. Free memory was 233.7MB in the beginning and 232.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.85ms. Allocated memory is still 299.9MB. Free memory was 232.1MB in the beginning and 230.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 287.90ms. Allocated memory is still 299.9MB. Free memory was 230.0MB in the beginning and 217.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 47868.44ms. Allocated memory is still 299.9MB. Free memory was 267.3MB in the beginning and 217.2MB in the end (delta: 50.0MB). Peak memory consumption was 50.0MB. 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 - PositiveResult [Line: 14]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 47.8s, OverallIterations: 6, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 31.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 68 SdHoareTripleChecker+Valid, 31.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 64 mSDsluCounter, 561 SdHoareTripleChecker+Invalid, 30.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 421 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 326 IncrementalHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 140 mSDtfsCounter, 326 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 514 GetRequests, 432 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 7.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=4, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 10 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 34 PreInvPairs, 47 NumberOfFragments, 138 HoareAnnotationTreeSize, 34 FormulaSimplifications, 40 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FormulaSimplificationsInter, 198 FormulaSimplificationTreeSizeReductionInter, 2.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 11.8s InterpolantComputationTime, 276 NumberOfCodeBlocks, 276 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 503 ConstructedInterpolants, 0 QuantifiedInterpolants, 2118 SizeOfPredicates, 33 NumberOfNonLiveVariables, 510 ConjunctsInSsa, 100 ConjunctsInUnsatCore, 11 InterpolantComputations, 4 PerfectInterpolantSequences, 580/740 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: (((((((((y <= 2) && (a >= 1)) && (x >= 1)) && (y >= 1)) && (b <= 2)) && (x <= 2)) && (a <= 2)) && (b >= 1)) && ((((y * v) + (x * u)) % 4294967296) == ((b * a) * 2))) RESULT: Ultimate proved your program to be correct! [2023-12-25 04:16:47,330 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...