/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/cohendiv-ll_valuebound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 00:57:11,322 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 00:57:11,392 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 00:57:11,396 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 00:57:11,397 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 00:57:11,418 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 00:57:11,419 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 00:57:11,419 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 00:57:11,419 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 00:57:11,423 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 00:57:11,423 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 00:57:11,423 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 00:57:11,423 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 00:57:11,425 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 00:57:11,425 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 00:57:11,425 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 00:57:11,425 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 00:57:11,426 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 00:57:11,426 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 00:57:11,427 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 00:57:11,427 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 00:57:11,427 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 00:57:11,427 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 00:57:11,428 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 00:57:11,428 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 00:57:11,428 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 00:57:11,428 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 00:57:11,428 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 00:57:11,428 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 00:57:11,429 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 00:57:11,429 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 00:57:11,429 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 00:57:11,430 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 00:57:11,430 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 00:57:11,430 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 00:57:11,430 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 00:57:11,430 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 00:57:11,430 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 00:57:11,430 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 00:57:11,430 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 00:57:11,431 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 00:57:11,431 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 00:57:11,431 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 00:57:11,431 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 00:57:11,431 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 00:57:11,431 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 00:57:11,432 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 00:57:11,604 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 00:57:11,622 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 00:57:11,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 00:57:11,624 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 00:57:11,625 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 00:57:11,626 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_valuebound10.c [2023-12-25 00:57:12,712 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 00:57:12,865 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 00:57:12,866 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_valuebound10.c [2023-12-25 00:57:12,872 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e600b8ada/fa83067f525e4cd08158838330608460/FLAG3f1f133f4 [2023-12-25 00:57:12,887 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e600b8ada/fa83067f525e4cd08158838330608460 [2023-12-25 00:57:12,889 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 00:57:12,890 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 00:57:12,892 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 00:57:12,892 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 00:57:12,896 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 00:57:12,896 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 12:57:12" (1/1) ... [2023-12-25 00:57:12,897 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55704ae4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:57:12, skipping insertion in model container [2023-12-25 00:57:12,898 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 12:57:12" (1/1) ... [2023-12-25 00:57:12,914 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 00:57:13,006 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/cohendiv-ll_valuebound10.c[576,589] [2023-12-25 00:57:13,018 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 00:57:13,027 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 00:57:13,035 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/cohendiv-ll_valuebound10.c[576,589] [2023-12-25 00:57:13,043 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 00:57:13,052 INFO L206 MainTranslator]: Completed translation [2023-12-25 00:57:13,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:57:13 WrapperNode [2023-12-25 00:57:13,053 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 00:57:13,053 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 00:57:13,054 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 00:57:13,054 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 00:57:13,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:57:13" (1/1) ... [2023-12-25 00:57:13,064 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:57:13" (1/1) ... [2023-12-25 00:57:13,075 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 55 [2023-12-25 00:57:13,075 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 00:57:13,076 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 00:57:13,076 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 00:57:13,076 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 00:57:13,083 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:57:13" (1/1) ... [2023-12-25 00:57:13,083 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:57:13" (1/1) ... [2023-12-25 00:57:13,085 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:57:13" (1/1) ... [2023-12-25 00:57:13,092 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 00:57:13,092 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:57:13" (1/1) ... [2023-12-25 00:57:13,092 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:57:13" (1/1) ... [2023-12-25 00:57:13,096 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:57:13" (1/1) ... [2023-12-25 00:57:13,098 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:57:13" (1/1) ... [2023-12-25 00:57:13,099 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:57:13" (1/1) ... [2023-12-25 00:57:13,099 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:57:13" (1/1) ... [2023-12-25 00:57:13,101 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 00:57:13,101 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 00:57:13,101 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 00:57:13,101 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 00:57:13,102 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:57:13" (1/1) ... [2023-12-25 00:57:13,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 00:57:13,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 00:57:13,124 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 00:57:13,135 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 00:57:13,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 00:57:13,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 00:57:13,152 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 00:57:13,153 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 00:57:13,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 00:57:13,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 00:57:13,153 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 00:57:13,153 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 00:57:13,194 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 00:57:13,197 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 00:57:13,308 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 00:57:13,325 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 00:57:13,326 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-25 00:57:13,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 12:57:13 BoogieIcfgContainer [2023-12-25 00:57:13,326 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 00:57:13,328 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 00:57:13,328 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 00:57:13,330 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 00:57:13,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 12:57:12" (1/3) ... [2023-12-25 00:57:13,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@106c12b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 12:57:13, skipping insertion in model container [2023-12-25 00:57:13,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:57:13" (2/3) ... [2023-12-25 00:57:13,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@106c12b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 12:57:13, skipping insertion in model container [2023-12-25 00:57:13,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 12:57:13" (3/3) ... [2023-12-25 00:57:13,332 INFO L112 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_valuebound10.c [2023-12-25 00:57:13,345 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 00:57:13,345 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 00:57:13,373 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 00:57:13,377 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;@4fe60955, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 00:57:13,378 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 00:57:13,380 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-25 00:57:13,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-25 00:57:13,385 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:57:13,386 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:57:13,386 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:57:13,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:57:13,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1096708698, now seen corresponding path program 1 times [2023-12-25 00:57:13,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:57:13,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1613332427] [2023-12-25 00:57:13,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:57:13,398 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 00:57:13,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:57:13,400 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 00:57:13,401 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 00:57:13,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:57:13,470 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 00:57:13,474 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:57:13,520 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-25 00:57:13,521 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 00:57:13,521 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:57:13,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1613332427] [2023-12-25 00:57:13,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1613332427] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 00:57:13,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 00:57:13,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 00:57:13,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814957661] [2023-12-25 00:57:13,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 00:57:13,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 00:57:13,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:57:13,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 00:57:13,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 00:57:13,554 INFO L87 Difference]: Start difference. First operand has 31 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-25 00:57:13,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:57:13,592 INFO L93 Difference]: Finished difference Result 60 states and 99 transitions. [2023-12-25 00:57:13,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 00:57:13,595 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2023-12-25 00:57:13,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:57:13,601 INFO L225 Difference]: With dead ends: 60 [2023-12-25 00:57:13,601 INFO L226 Difference]: Without dead ends: 29 [2023-12-25 00:57:13,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 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 00:57:13,609 INFO L413 NwaCegarLoop]: 38 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, 38 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 00:57:13,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 00:57:13,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-25 00:57:13,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-12-25 00:57:13,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 00:57:13,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2023-12-25 00:57:13,652 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 23 [2023-12-25 00:57:13,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:57:13,652 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2023-12-25 00:57:13,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-25 00:57:13,654 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2023-12-25 00:57:13,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-25 00:57:13,656 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:57:13,656 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:57:13,662 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 00:57:13,861 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 00:57:13,862 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:57:13,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:57:13,863 INFO L85 PathProgramCache]: Analyzing trace with hash 2049551268, now seen corresponding path program 1 times [2023-12-25 00:57:13,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:57:13,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1403339653] [2023-12-25 00:57:13,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:57:13,866 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 00:57:13,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:57:13,867 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 00:57:13,868 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 00:57:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:57:13,947 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 00:57:13,949 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:57:14,173 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 00:57:14,174 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:57:15,134 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 00:57:15,134 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:57:15,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1403339653] [2023-12-25 00:57:15,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1403339653] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 00:57:15,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 00:57:15,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2023-12-25 00:57:15,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810642849] [2023-12-25 00:57:15,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 00:57:15,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 00:57:15,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:57:15,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 00:57:15,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-25 00:57:15,137 INFO L87 Difference]: Start difference. First operand 29 states and 38 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-25 00:57:20,359 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 00:57:21,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:57:21,014 INFO L93 Difference]: Finished difference Result 48 states and 64 transitions. [2023-12-25 00:57:21,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 00:57:21,015 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2023-12-25 00:57:21,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:57:21,015 INFO L225 Difference]: With dead ends: 48 [2023-12-25 00:57:21,016 INFO L226 Difference]: Without dead ends: 46 [2023-12-25 00:57:21,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-25 00:57:21,017 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2023-12-25 00:57:21,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 100 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2023-12-25 00:57:21,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-25 00:57:21,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2023-12-25 00:57:21,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 23 states have (on average 1.173913043478261) internal successors, (27), 25 states have internal predecessors, (27), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-25 00:57:21,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 54 transitions. [2023-12-25 00:57:21,028 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 54 transitions. Word has length 23 [2023-12-25 00:57:21,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:57:21,028 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 54 transitions. [2023-12-25 00:57:21,028 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-25 00:57:21,028 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 54 transitions. [2023-12-25 00:57:21,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-25 00:57:21,029 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:57:21,029 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:57:21,051 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 00:57:21,229 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 00:57:21,230 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:57:21,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:57:21,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1906772284, now seen corresponding path program 1 times [2023-12-25 00:57:21,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:57:21,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [646685332] [2023-12-25 00:57:21,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:57:21,231 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 00:57:21,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:57:21,250 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 00:57:21,257 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 00:57:21,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:57:21,397 INFO L262 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-25 00:57:21,399 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:57:21,711 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 00:57:21,711 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:57:23,501 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 00:57:23,501 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:57:23,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [646685332] [2023-12-25 00:57:23,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [646685332] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 00:57:23,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 00:57:23,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2023-12-25 00:57:23,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586199602] [2023-12-25 00:57:23,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 00:57:23,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 00:57:23,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:57:23,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 00:57:23,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-25 00:57:23,503 INFO L87 Difference]: Start difference. First operand 41 states and 54 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-25 00:57:25,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:57:25,755 INFO L93 Difference]: Finished difference Result 66 states and 90 transitions. [2023-12-25 00:57:25,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 00:57:25,763 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2023-12-25 00:57:25,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:57:25,765 INFO L225 Difference]: With dead ends: 66 [2023-12-25 00:57:25,765 INFO L226 Difference]: Without dead ends: 63 [2023-12-25 00:57:25,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-12-25 00:57:25,766 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 10 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-12-25 00:57:25,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 110 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-12-25 00:57:25,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-12-25 00:57:25,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2023-12-25 00:57:25,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 35 states have internal predecessors, (39), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-25 00:57:25,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 84 transitions. [2023-12-25 00:57:25,793 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 84 transitions. Word has length 28 [2023-12-25 00:57:25,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:57:25,793 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 84 transitions. [2023-12-25 00:57:25,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-25 00:57:25,793 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 84 transitions. [2023-12-25 00:57:25,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-25 00:57:25,794 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:57:25,794 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:57:25,802 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 (4)] Ended with exit code 0 [2023-12-25 00:57:25,999 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 00:57:26,000 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:57:26,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:57:26,000 INFO L85 PathProgramCache]: Analyzing trace with hash -170967411, now seen corresponding path program 1 times [2023-12-25 00:57:26,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:57:26,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1484100202] [2023-12-25 00:57:26,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:57:26,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 00:57:26,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:57:26,002 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 00:57:26,015 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 00:57:26,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:57:26,110 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 00:57:26,112 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:57:26,301 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-25 00:57:26,301 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:57:26,459 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-25 00:57:26,459 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:57:26,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1484100202] [2023-12-25 00:57:26,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1484100202] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:57:26,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:57:26,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-12-25 00:57:26,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972716049] [2023-12-25 00:57:26,459 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:57:26,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-25 00:57:26,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:57:26,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-25 00:57:26,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2023-12-25 00:57:26,461 INFO L87 Difference]: Start difference. First operand 61 states and 84 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) [2023-12-25 00:57:27,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:57:27,381 INFO L93 Difference]: Finished difference Result 69 states and 91 transitions. [2023-12-25 00:57:27,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 00:57:27,385 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) Word has length 45 [2023-12-25 00:57:27,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:57:27,386 INFO L225 Difference]: With dead ends: 69 [2023-12-25 00:57:27,386 INFO L226 Difference]: Without dead ends: 67 [2023-12-25 00:57:27,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2023-12-25 00:57:27,387 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 46 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-25 00:57:27,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 182 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-25 00:57:27,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-12-25 00:57:27,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2023-12-25 00:57:27,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 38 states have internal predecessors, (42), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-25 00:57:27,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 87 transitions. [2023-12-25 00:57:27,400 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 87 transitions. Word has length 45 [2023-12-25 00:57:27,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:57:27,400 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 87 transitions. [2023-12-25 00:57:27,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) [2023-12-25 00:57:27,400 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2023-12-25 00:57:27,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-25 00:57:27,401 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:57:27,401 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:57:27,409 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 00:57:27,602 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 00:57:27,602 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:57:27,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:57:27,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1378270461, now seen corresponding path program 1 times [2023-12-25 00:57:27,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:57:27,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [466391873] [2023-12-25 00:57:27,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:57:27,606 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 00:57:27,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:57:27,607 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 00:57:27,608 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 00:57:27,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:57:27,761 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-25 00:57:27,763 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:57:28,315 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-25 00:57:28,315 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:57:51,233 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-25 00:57:51,234 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:57:51,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [466391873] [2023-12-25 00:57:51,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [466391873] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:57:51,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:57:51,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 22 [2023-12-25 00:57:51,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453217449] [2023-12-25 00:57:51,234 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:57:51,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-25 00:57:51,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:57:51,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-25 00:57:51,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=388, Unknown=3, NotChecked=0, Total=462 [2023-12-25 00:57:51,236 INFO L87 Difference]: Start difference. First operand 65 states and 87 transitions. Second operand has 22 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 17 states have internal predecessors, (34), 10 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 9 states have call predecessors, (16), 8 states have call successors, (16) [2023-12-25 00:57:55,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.20s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:58:08,390 WARN L293 SmtUtils]: Spent 11.46s on a formula simplification. DAG size of input: 26 DAG size of output: 9 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:58:11,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.19s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:58:18,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:58:27,733 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 [0] [2023-12-25 00:58:31,828 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 00:58:35,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.24s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:58:39,139 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 00:58:43,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 00:59:00,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.52s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:59:07,099 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 00:59:11,305 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 00:59:15,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:59:19,377 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 00:59:22,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.40s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:59:22,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:59:22,786 INFO L93 Difference]: Finished difference Result 102 states and 138 transitions. [2023-12-25 00:59:22,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-25 00:59:22,801 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 17 states have internal predecessors, (34), 10 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 9 states have call predecessors, (16), 8 states have call successors, (16) Word has length 51 [2023-12-25 00:59:22,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:59:22,802 INFO L225 Difference]: With dead ends: 102 [2023-12-25 00:59:22,802 INFO L226 Difference]: Without dead ends: 100 [2023-12-25 00:59:22,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 56.2s TimeCoverageRelationStatistics Valid=226, Invalid=960, Unknown=4, NotChecked=0, Total=1190 [2023-12-25 00:59:22,804 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 105 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 93 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 54.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 55.3s IncrementalHoareTripleChecker+Time [2023-12-25 00:59:22,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 165 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 206 Invalid, 8 Unknown, 0 Unchecked, 55.3s Time] [2023-12-25 00:59:22,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-12-25 00:59:22,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 90. [2023-12-25 00:59:22,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 50 states have (on average 1.18) internal successors, (59), 52 states have internal predecessors, (59), 32 states have call successors, (32), 7 states have call predecessors, (32), 7 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2023-12-25 00:59:22,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 122 transitions. [2023-12-25 00:59:22,819 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 122 transitions. Word has length 51 [2023-12-25 00:59:22,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:59:22,820 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 122 transitions. [2023-12-25 00:59:22,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 17 states have internal predecessors, (34), 10 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 9 states have call predecessors, (16), 8 states have call successors, (16) [2023-12-25 00:59:22,820 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 122 transitions. [2023-12-25 00:59:22,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-25 00:59:22,821 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:59:22,821 INFO L195 NwaCegarLoop]: trace histogram [7, 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, 1, 1, 1] [2023-12-25 00:59:22,836 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 00:59:23,032 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 00:59:23,032 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:59:23,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:59:23,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1550111725, now seen corresponding path program 1 times [2023-12-25 00:59:23,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:59:23,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1207163276] [2023-12-25 00:59:23,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:59:23,033 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 00:59:23,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:59:23,034 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 00:59:23,035 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 00:59:23,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:59:23,178 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-25 00:59:23,180 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:59:24,510 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-12-25 00:59:24,510 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:59:44,089 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-12-25 00:59:44,090 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:59:44,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1207163276] [2023-12-25 00:59:44,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1207163276] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 00:59:44,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 00:59:44,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 19 [2023-12-25 00:59:44,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210737478] [2023-12-25 00:59:44,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 00:59:44,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 00:59:44,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:59:44,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 00:59:44,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2023-12-25 00:59:44,091 INFO L87 Difference]: Start difference. First operand 90 states and 122 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2023-12-25 00:59:50,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:59:59,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:00:03,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:00:08,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:00:13,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:00:21,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:00:21,224 INFO L93 Difference]: Finished difference Result 106 states and 138 transitions. [2023-12-25 01:00:21,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 01:00:21,246 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 58 [2023-12-25 01:00:21,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:00:21,247 INFO L225 Difference]: With dead ends: 106 [2023-12-25 01:00:21,247 INFO L226 Difference]: Without dead ends: 103 [2023-12-25 01:00:21,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 21.4s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2023-12-25 01:00:21,248 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 31 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 34 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.0s IncrementalHoareTripleChecker+Time [2023-12-25 01:00:21,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 135 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 86 Invalid, 4 Unknown, 0 Unchecked, 30.0s Time] [2023-12-25 01:00:21,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-12-25 01:00:21,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 98. [2023-12-25 01:00:21,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 58 states have internal predecessors, (64), 32 states have call successors, (32), 9 states have call predecessors, (32), 9 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2023-12-25 01:00:21,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 127 transitions. [2023-12-25 01:00:21,265 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 127 transitions. Word has length 58 [2023-12-25 01:00:21,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:00:21,266 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 127 transitions. [2023-12-25 01:00:21,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2023-12-25 01:00:21,266 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 127 transitions. [2023-12-25 01:00:21,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-25 01:00:21,267 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:00:21,267 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:00:21,274 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 (7)] Ended with exit code 0 [2023-12-25 01:00:21,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:00:21,474 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:00:21,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:00:21,475 INFO L85 PathProgramCache]: Analyzing trace with hash -426664645, now seen corresponding path program 1 times [2023-12-25 01:00:21,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:00:21,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [597990105] [2023-12-25 01:00:21,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:00:21,475 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:00:21,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:00:21,476 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:00:21,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-25 01:00:21,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:00:21,668 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-25 01:00:21,669 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:00:22,439 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-12-25 01:00:22,439 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:00:28,598 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-12-25 01:00:28,598 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:00:28,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [597990105] [2023-12-25 01:00:28,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [597990105] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 01:00:28,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 01:00:28,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 17 [2023-12-25 01:00:28,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304869179] [2023-12-25 01:00:28,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:00:28,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-25 01:00:28,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:00:28,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-25 01:00:28,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2023-12-25 01:00:28,600 INFO L87 Difference]: Start difference. First operand 98 states and 127 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-25 01:00:31,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:00:31,246 INFO L93 Difference]: Finished difference Result 104 states and 132 transitions. [2023-12-25 01:00:31,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 01:00:31,272 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 58 [2023-12-25 01:00:31,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:00:31,273 INFO L225 Difference]: With dead ends: 104 [2023-12-25 01:00:31,273 INFO L226 Difference]: Without dead ends: 102 [2023-12-25 01:00:31,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2023-12-25 01:00:31,274 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 19 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-12-25 01:00:31,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 92 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-12-25 01:00:31,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-12-25 01:00:31,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-12-25 01:00:31,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 61 states have internal predecessors, (67), 32 states have call successors, (32), 10 states have call predecessors, (32), 10 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2023-12-25 01:00:31,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 130 transitions. [2023-12-25 01:00:31,297 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 130 transitions. Word has length 58 [2023-12-25 01:00:31,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:00:31,299 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 130 transitions. [2023-12-25 01:00:31,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-25 01:00:31,300 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 130 transitions. [2023-12-25 01:00:31,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-12-25 01:00:31,306 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:00:31,306 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:00:31,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-25 01:00:31,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:00:31,512 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:00:31,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:00:31,512 INFO L85 PathProgramCache]: Analyzing trace with hash 673882661, now seen corresponding path program 1 times [2023-12-25 01:00:31,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:00:31,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1069078601] [2023-12-25 01:00:31,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:00:31,513 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:00:31,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:00:31,514 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:00:31,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-25 01:00:31,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:00:31,722 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-25 01:00:31,725 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:00:33,503 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 36 proven. 40 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-25 01:00:33,503 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:01:54,151 WARN L293 SmtUtils]: Spent 5.63s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:02:03,338 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 39 proven. 37 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-25 01:02:03,338 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:02:03,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1069078601] [2023-12-25 01:02:03,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1069078601] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:02:03,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:02:03,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 27 [2023-12-25 01:02:03,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753368520] [2023-12-25 01:02:03,338 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:02:03,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-25 01:02:03,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:02:03,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-25 01:02:03,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=571, Unknown=0, NotChecked=0, Total=702 [2023-12-25 01:02:03,340 INFO L87 Difference]: Start difference. First operand 102 states and 130 transitions. Second operand has 27 states, 25 states have (on average 1.68) internal successors, (42), 22 states have internal predecessors, (42), 14 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (26), 14 states have call predecessors, (26), 14 states have call successors, (26) [2023-12-25 01:02:40,219 WARN L293 SmtUtils]: Spent 14.33s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:02:56,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:03:00,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:03:04,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:03:08,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:03:12,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:03:18,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.21s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:03:20,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:03:25,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:03:29,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:03:33,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:03:37,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:03:45,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.55s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:03:47,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:03:51,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:03:55,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:03:59,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:04:03,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:04:07,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:04:12,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:04:16,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:04:20,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:04:24,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:04:31,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:04:35,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:04:39,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:04:43,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:04:47,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:04:52,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:04:56,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:05:00,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:05:04,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:05:08,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:05:08,774 INFO L93 Difference]: Finished difference Result 155 states and 199 transitions. [2023-12-25 01:05:08,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-25 01:05:08,783 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 1.68) internal successors, (42), 22 states have internal predecessors, (42), 14 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (26), 14 states have call predecessors, (26), 14 states have call successors, (26) Word has length 81 [2023-12-25 01:05:08,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:05:08,786 INFO L225 Difference]: With dead ends: 155 [2023-12-25 01:05:08,786 INFO L226 Difference]: Without dead ends: 151 [2023-12-25 01:05:08,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 109.2s TimeCoverageRelationStatistics Valid=265, Invalid=1067, Unknown=0, NotChecked=0, Total=1332 [2023-12-25 01:05:08,787 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 78 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 96 mSolverCounterUnsat, 27 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 137.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 27 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 140.9s IncrementalHoareTripleChecker+Time [2023-12-25 01:05:08,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 394 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 508 Invalid, 27 Unknown, 0 Unchecked, 140.9s Time] [2023-12-25 01:05:08,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-12-25 01:05:08,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 148. [2023-12-25 01:05:08,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 86 states have (on average 1.1162790697674418) internal successors, (96), 89 states have internal predecessors, (96), 47 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 44 states have call predecessors, (47), 47 states have call successors, (47) [2023-12-25 01:05:08,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 190 transitions. [2023-12-25 01:05:08,841 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 190 transitions. Word has length 81 [2023-12-25 01:05:08,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:05:08,842 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 190 transitions. [2023-12-25 01:05:08,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 1.68) internal successors, (42), 22 states have internal predecessors, (42), 14 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (26), 14 states have call predecessors, (26), 14 states have call successors, (26) [2023-12-25 01:05:08,842 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 190 transitions. [2023-12-25 01:05:08,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-25 01:05:08,844 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:05:08,844 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:05:08,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-25 01:05:09,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:05:09,054 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:05:09,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:05:09,054 INFO L85 PathProgramCache]: Analyzing trace with hash 2103046358, now seen corresponding path program 2 times [2023-12-25 01:05:09,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:05:09,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [255618263] [2023-12-25 01:05:09,055 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 01:05:09,055 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:05:09,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:05:09,056 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:05:09,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-25 01:05:09,409 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 01:05:09,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:05:09,435 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 01:05:09,437 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:05:10,002 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 37 proven. 15 refuted. 0 times theorem prover too weak. 571 trivial. 0 not checked. [2023-12-25 01:05:10,002 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:05:10,470 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 37 proven. 15 refuted. 0 times theorem prover too weak. 571 trivial. 0 not checked. [2023-12-25 01:05:10,470 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:05:10,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [255618263] [2023-12-25 01:05:10,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [255618263] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:05:10,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:05:10,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-12-25 01:05:10,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223929546] [2023-12-25 01:05:10,470 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:05:10,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-25 01:05:10,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:05:10,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-25 01:05:10,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-12-25 01:05:10,471 INFO L87 Difference]: Start difference. First operand 148 states and 190 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 11 states have internal predecessors, (38), 5 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) [2023-12-25 01:05:11,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:05:11,306 INFO L93 Difference]: Finished difference Result 156 states and 196 transitions. [2023-12-25 01:05:11,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 01:05:11,318 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 11 states have internal predecessors, (38), 5 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) Word has length 121 [2023-12-25 01:05:11,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:05:11,319 INFO L225 Difference]: With dead ends: 156 [2023-12-25 01:05:11,319 INFO L226 Difference]: Without dead ends: 0 [2023-12-25 01:05:11,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2023-12-25 01:05:11,320 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 11 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-25 01:05:11,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 190 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-25 01:05:11,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-25 01:05:11,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-25 01:05:11,321 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 01:05:11,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-25 01:05:11,321 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 121 [2023-12-25 01:05:11,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:05:11,321 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-25 01:05:11,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 11 states have internal predecessors, (38), 5 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) [2023-12-25 01:05:11,321 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-25 01:05:11,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-25 01:05:11,323 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 01:05:11,352 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 01:05:11,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:05:11,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-25 01:05:56,538 WARN L293 SmtUtils]: Spent 34.44s on a formula simplification. DAG size of input: 118 DAG size of output: 33 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-25 01:06:34,015 WARN L293 SmtUtils]: Spent 37.46s on a formula simplification. DAG size of input: 110 DAG size of output: 28 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-25 01:07:00,910 WARN L293 SmtUtils]: Spent 26.89s on a formula simplification. DAG size of input: 110 DAG size of output: 28 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-25 01:07:16,822 WARN L293 SmtUtils]: Spent 15.91s on a formula simplification. DAG size of input: 131 DAG size of output: 28 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-25 01:07:36,689 WARN L293 SmtUtils]: Spent 19.87s on a formula simplification. DAG size of input: 131 DAG size of output: 28 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-25 01:07:41,523 INFO L899 garLoopResultBuilder]: For program point L64(line 64) no Hoare annotation was computed. [2023-12-25 01:07:41,524 INFO L899 garLoopResultBuilder]: For program point L31(line 31) no Hoare annotation was computed. [2023-12-25 01:07:41,524 INFO L902 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: true [2023-12-25 01:07:41,524 INFO L899 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2023-12-25 01:07:41,524 INFO L895 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (let ((.cse0 ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|))) (and (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv0 32)) (= (bvmul |ULTIMATE.start_main_~a~0#1| .cse0) |ULTIMATE.start_main_~b~0#1|) (exists ((v_subst_8 (_ BitVec 32))) (and (bvsge v_subst_8 (_ bv0 32)) (bvsge |ULTIMATE.start_main_~r~0#1| ((_ sign_extend 32) v_subst_8)) (bvsle v_subst_8 (_ bv10 32)))) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~x~0#1| (_ bv10 32)) (= ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|) (bvadd |ULTIMATE.start_main_~r~0#1| (bvmul |ULTIMATE.start_main_~q~0#1| .cse0))) (bvsle |ULTIMATE.start_main_~y~0#1| (_ bv10 32)))) [2023-12-25 01:07:41,525 INFO L895 garLoopResultBuilder]: At program point L48-1(line 48) the Hoare annotation is: (let ((.cse0 ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|))) (and (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv0 32)) (= (bvmul |ULTIMATE.start_main_~a~0#1| .cse0) |ULTIMATE.start_main_~b~0#1|) (exists ((v_subst_8 (_ BitVec 32))) (and (bvsge v_subst_8 (_ bv0 32)) (bvsge |ULTIMATE.start_main_~r~0#1| ((_ sign_extend 32) v_subst_8)) (bvsle v_subst_8 (_ bv10 32)))) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~x~0#1| (_ bv10 32)) (= ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|) (bvadd |ULTIMATE.start_main_~r~0#1| (bvmul |ULTIMATE.start_main_~q~0#1| .cse0))) (bvsle |ULTIMATE.start_main_~y~0#1| (_ bv10 32)))) [2023-12-25 01:07:41,525 INFO L899 garLoopResultBuilder]: For program point L40(lines 38 62) no Hoare annotation was computed. [2023-12-25 01:07:41,525 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (let ((.cse0 ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|))) (and (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv0 32)) (= (bvmul |ULTIMATE.start_main_~a~0#1| .cse0) |ULTIMATE.start_main_~b~0#1|) (exists ((v_subst_8 (_ BitVec 32))) (and (bvsge v_subst_8 (_ bv0 32)) (bvsge |ULTIMATE.start_main_~r~0#1| ((_ sign_extend 32) v_subst_8)) (bvsle v_subst_8 (_ bv10 32)))) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~x~0#1| (_ bv10 32)) (= ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|) (bvadd |ULTIMATE.start_main_~r~0#1| (bvmul |ULTIMATE.start_main_~q~0#1| .cse0))) (bvsle |ULTIMATE.start_main_~y~0#1| (_ bv10 32)))) [2023-12-25 01:07:41,526 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-25 01:07:41,526 INFO L895 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: (and (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv0 32)) (bvsle |ULTIMATE.start_main_~x~0#1| (_ bv10 32))) [2023-12-25 01:07:41,526 INFO L895 garLoopResultBuilder]: At program point L29-1(line 29) the Hoare annotation is: (and (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv0 32)) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv0 32)) (bvsle |ULTIMATE.start_main_~x~0#1| (_ bv10 32)) (bvsle |ULTIMATE.start_main_~y~0#1| (_ bv10 32))) [2023-12-25 01:07:41,526 INFO L899 garLoopResultBuilder]: For program point L50(lines 47 59) no Hoare annotation was computed. [2023-12-25 01:07:41,526 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-25 01:07:41,526 INFO L895 garLoopResultBuilder]: At program point L38-2(lines 38 62) the Hoare annotation is: (let ((.cse0 ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|))) (and (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv0 32)) (= (bvmul |ULTIMATE.start_main_~a~0#1| .cse0) |ULTIMATE.start_main_~b~0#1|) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~x~0#1| (_ bv10 32)) (= ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|) (bvadd |ULTIMATE.start_main_~r~0#1| (bvmul |ULTIMATE.start_main_~q~0#1| .cse0))) (bvsle |ULTIMATE.start_main_~y~0#1| (_ bv10 32)))) [2023-12-25 01:07:41,526 INFO L895 garLoopResultBuilder]: At program point L38-3(lines 38 62) the Hoare annotation is: (= ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|) (bvadd |ULTIMATE.start_main_~r~0#1| (bvmul |ULTIMATE.start_main_~q~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|)))) [2023-12-25 01:07:41,526 INFO L895 garLoopResultBuilder]: At program point L55(line 55) the Hoare annotation is: (let ((.cse0 ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|))) (and (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv0 32)) (= (bvmul |ULTIMATE.start_main_~a~0#1| .cse0) |ULTIMATE.start_main_~b~0#1|) (exists ((v_subst_8 (_ BitVec 32))) (and (bvsge v_subst_8 (_ bv0 32)) (bvsge |ULTIMATE.start_main_~r~0#1| ((_ sign_extend 32) v_subst_8)) (bvsle v_subst_8 (_ bv10 32)))) (bvsge |ULTIMATE.start_main_~r~0#1| (bvmul |ULTIMATE.start_main_~a~0#1| ((_ sign_extend 32) (bvmul |ULTIMATE.start_main_~y~0#1| (_ bv2 32))))) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~x~0#1| (_ bv10 32)) (= ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|) (bvadd |ULTIMATE.start_main_~r~0#1| (bvmul |ULTIMATE.start_main_~q~0#1| .cse0))) (bvsle |ULTIMATE.start_main_~y~0#1| (_ bv10 32)))) [2023-12-25 01:07:41,526 INFO L899 garLoopResultBuilder]: For program point L55-1(line 55) no Hoare annotation was computed. [2023-12-25 01:07:41,526 INFO L895 garLoopResultBuilder]: At program point L47-2(lines 47 59) the Hoare annotation is: (let ((.cse0 ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|))) (and (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv0 32)) (= (bvmul |ULTIMATE.start_main_~a~0#1| .cse0) |ULTIMATE.start_main_~b~0#1|) (exists ((v_subst_8 (_ BitVec 32))) (and (bvsge v_subst_8 (_ bv0 32)) (bvsge |ULTIMATE.start_main_~r~0#1| ((_ sign_extend 32) v_subst_8)) (bvsle v_subst_8 (_ bv10 32)))) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~x~0#1| (_ bv10 32)) (= ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|) (bvadd |ULTIMATE.start_main_~r~0#1| (bvmul |ULTIMATE.start_main_~q~0#1| .cse0))) (bvsle |ULTIMATE.start_main_~y~0#1| (_ bv10 32)))) [2023-12-25 01:07:41,526 INFO L899 garLoopResultBuilder]: For program point L47-3(lines 47 59) no Hoare annotation was computed. [2023-12-25 01:07:41,526 INFO L895 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (let ((.cse0 ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|))) (and (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv0 32)) (= (bvmul |ULTIMATE.start_main_~a~0#1| .cse0) |ULTIMATE.start_main_~b~0#1|) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~x~0#1| (_ bv10 32)) (= ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|) (bvadd |ULTIMATE.start_main_~r~0#1| (bvmul |ULTIMATE.start_main_~q~0#1| .cse0))) (bvsle |ULTIMATE.start_main_~y~0#1| (_ bv10 32)))) [2023-12-25 01:07:41,527 INFO L895 garLoopResultBuilder]: At program point L39-1(line 39) the Hoare annotation is: (let ((.cse0 ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|))) (and (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv0 32)) (= (bvmul |ULTIMATE.start_main_~a~0#1| .cse0) |ULTIMATE.start_main_~b~0#1|) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~x~0#1| (_ bv10 32)) (= ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|) (bvadd |ULTIMATE.start_main_~r~0#1| (bvmul |ULTIMATE.start_main_~q~0#1| .cse0))) (bvsle |ULTIMATE.start_main_~y~0#1| (_ bv10 32)))) [2023-12-25 01:07:41,527 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2023-12-25 01:07:41,527 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 13) no Hoare annotation was computed. [2023-12-25 01:07:41,527 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 11 13) the Hoare annotation is: true [2023-12-25 01:07:41,527 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed. [2023-12-25 01:07:41,527 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2023-12-25 01:07:41,527 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2023-12-25 01:07:41,527 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2023-12-25 01:07:41,527 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2023-12-25 01:07:41,527 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 14 20) the Hoare annotation is: true [2023-12-25 01:07:41,527 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2023-12-25 01:07:41,529 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:07:41,530 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 01:07:41,538 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_8 : bv32 :: (~bvsge~64(v_subst_8, 0bv32) && ~bvsge~64(~r~0, ~sign_extend~64~32(v_subst_8))) && ~bvsle~32(v_subst_8, 10bv32)) could not be translated [2023-12-25 01:07:41,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 01:07:41 BoogieIcfgContainer [2023-12-25 01:07:41,540 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 01:07:41,540 INFO L158 Benchmark]: Toolchain (without parser) took 628650.78ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 124.7MB in the beginning and 126.6MB in the end (delta: -1.9MB). Peak memory consumption was 103.9MB. Max. memory is 8.0GB. [2023-12-25 01:07:41,540 INFO L158 Benchmark]: CDTParser took 0.49ms. Allocated memory is still 186.6MB. Free memory is still 137.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 01:07:41,541 INFO L158 Benchmark]: CACSL2BoogieTranslator took 160.84ms. Allocated memory is still 186.6MB. Free memory was 124.5MB in the beginning and 112.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 01:07:41,541 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.90ms. Allocated memory is still 186.6MB. Free memory was 112.9MB in the beginning and 111.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 01:07:41,541 INFO L158 Benchmark]: Boogie Preprocessor took 24.94ms. Allocated memory is still 186.6MB. Free memory was 111.4MB in the beginning and 109.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 01:07:41,541 INFO L158 Benchmark]: RCFGBuilder took 224.88ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 109.5MB in the beginning and 185.7MB in the end (delta: -76.2MB). Peak memory consumption was 13.5MB. Max. memory is 8.0GB. [2023-12-25 01:07:41,541 INFO L158 Benchmark]: TraceAbstraction took 628212.18ms. Allocated memory is still 224.4MB. Free memory was 184.7MB in the beginning and 126.6MB in the end (delta: 58.1MB). Peak memory consumption was 125.1MB. Max. memory is 8.0GB. [2023-12-25 01:07:41,542 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.49ms. Allocated memory is still 186.6MB. Free memory is still 137.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 160.84ms. Allocated memory is still 186.6MB. Free memory was 124.5MB in the beginning and 112.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 21.90ms. Allocated memory is still 186.6MB. Free memory was 112.9MB in the beginning and 111.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.94ms. Allocated memory is still 186.6MB. Free memory was 111.4MB in the beginning and 109.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 224.88ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 109.5MB in the beginning and 185.7MB in the end (delta: -76.2MB). Peak memory consumption was 13.5MB. Max. memory is 8.0GB. * TraceAbstraction took 628212.18ms. Allocated memory is still 224.4MB. Free memory was 184.7MB in the beginning and 126.6MB in the end (delta: 58.1MB). Peak memory consumption was 125.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_8 : bv32 :: (~bvsge~64(v_subst_8, 0bv32) && ~bvsge~64(~r~0, ~sign_extend~64~32(v_subst_8))) && ~bvsle~32(v_subst_8, 10bv32)) could not be translated * 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: 17]: 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, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 628.2s, OverallIterations: 9, TraceHistogramMax: 18, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 326.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 150.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 40 mSolverCounterUnknown, 342 SdHoareTripleChecker+Valid, 238.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 311 mSDsluCounter, 1406 SdHoareTripleChecker+Invalid, 232.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1156 mSDsCounter, 270 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1168 IncrementalHoareTripleChecker+Invalid, 1478 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 270 mSolverCounterUnsat, 250 mSDtfsCounter, 1168 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 972 GetRequests, 819 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 194.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=148occurred in iteration=8, InterpolantAutomatonStates: 90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 27 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 72 PreInvPairs, 132 NumberOfFragments, 324 HoareAnnotationTreeSize, 72 FormulaSimplifications, 1605 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 14 FormulaSimplificationsInter, 4797 FormulaSimplificationTreeSizeReductionInter, 149.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 147.8s InterpolantComputationTime, 488 NumberOfCodeBlocks, 488 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 936 ConstructedInterpolants, 35 QuantifiedInterpolants, 4412 SizeOfPredicates, 40 NumberOfNonLiveVariables, 805 ConjunctsInSsa, 118 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 2155/2308 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: 47]: Loop Invariant Derived loop invariant: ((((((x >= 0) && ((a * y) == b)) && (y >= 1)) && (x <= 10)) && (x == ((r + (q * y)) % 1))) && (y <= 10)) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: ((((((x >= 0) && ((a * y) == b)) && (y >= 1)) && (x <= 10)) && (x == ((r + (q * y)) % 1))) && (y <= 10)) RESULT: Ultimate proved your program to be correct! [2023-12-25 01:07:41,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...