/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/bitvector/modulus-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 21:25:52,039 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 21:25:52,091 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-21 21:25:52,095 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 21:25:52,096 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 21:25:52,114 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 21:25:52,114 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 21:25:52,115 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 21:25:52,115 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 21:25:52,120 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 21:25:52,121 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 21:25:52,121 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 21:25:52,122 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 21:25:52,122 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 21:25:52,122 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 21:25:52,123 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 21:25:52,123 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 21:25:52,123 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 21:25:52,124 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 21:25:52,124 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 21:25:52,124 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 21:25:52,128 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 21:25:52,128 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 21:25:52,129 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-21 21:25:52,129 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-21 21:25:52,129 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 21:25:52,129 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-21 21:25:52,130 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 21:25:52,130 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 21:25:52,130 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 21:25:52,131 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 21:25:52,131 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 21:25:52,131 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 21:25:52,131 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 21:25:52,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 21:25:52,135 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 21:25:52,136 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 21:25:52,136 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 21:25:52,136 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-21 21:25:52,136 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-21 21:25:52,137 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 21:25:52,137 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 21:25:52,138 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 21:25:52,138 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 21:25:52,138 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 21:25:52,138 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-21 21:25:52,138 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-21 21:25:52,359 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 21:25:52,381 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 21:25:52,383 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 21:25:52,384 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 21:25:52,385 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 21:25:52,386 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/modulus-2.i [2023-12-21 21:25:53,545 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 21:25:53,712 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 21:25:53,713 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/modulus-2.i [2023-12-21 21:25:53,719 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74aa41741/116faf3075384925bbff9c7b0dfd652c/FLAG817998e66 [2023-12-21 21:25:53,731 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74aa41741/116faf3075384925bbff9c7b0dfd652c [2023-12-21 21:25:53,733 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 21:25:53,734 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 21:25:53,736 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 21:25:53,736 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 21:25:53,740 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 21:25:53,741 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 09:25:53" (1/1) ... [2023-12-21 21:25:53,742 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b3a0d85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:25:53, skipping insertion in model container [2023-12-21 21:25:53,742 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 09:25:53" (1/1) ... [2023-12-21 21:25:53,765 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 21:25:53,899 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/modulus-2.i[1252,1265] [2023-12-21 21:25:53,914 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 21:25:53,925 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 21:25:53,935 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/modulus-2.i[1252,1265] [2023-12-21 21:25:53,939 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 21:25:53,951 INFO L206 MainTranslator]: Completed translation [2023-12-21 21:25:53,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:25:53 WrapperNode [2023-12-21 21:25:53,952 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 21:25:53,953 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 21:25:53,953 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 21:25:53,953 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 21:25:53,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:25:53" (1/1) ... [2023-12-21 21:25:53,966 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:25:53" (1/1) ... [2023-12-21 21:25:53,981 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 46 [2023-12-21 21:25:53,981 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 21:25:53,982 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 21:25:53,982 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 21:25:53,982 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 21:25:53,991 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:25:53" (1/1) ... [2023-12-21 21:25:53,991 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:25:53" (1/1) ... [2023-12-21 21:25:53,993 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:25:53" (1/1) ... [2023-12-21 21:25:54,001 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-21 21:25:54,001 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:25:53" (1/1) ... [2023-12-21 21:25:54,001 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:25:53" (1/1) ... [2023-12-21 21:25:54,005 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:25:53" (1/1) ... [2023-12-21 21:25:54,008 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:25:53" (1/1) ... [2023-12-21 21:25:54,009 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:25:53" (1/1) ... [2023-12-21 21:25:54,010 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:25:53" (1/1) ... [2023-12-21 21:25:54,012 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 21:25:54,013 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 21:25:54,013 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 21:25:54,013 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 21:25:54,014 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:25:53" (1/1) ... [2023-12-21 21:25:54,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 21:25:54,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 21:25:54,040 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-21 21:25:54,060 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-21 21:25:54,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 21:25:54,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-21 21:25:54,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 21:25:54,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 21:25:54,119 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 21:25:54,121 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 21:25:54,262 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 21:25:54,297 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 21:25:54,298 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-21 21:25:54,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 09:25:54 BoogieIcfgContainer [2023-12-21 21:25:54,298 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 21:25:54,300 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 21:25:54,301 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 21:25:54,303 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 21:25:54,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 09:25:53" (1/3) ... [2023-12-21 21:25:54,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d1a61c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 09:25:54, skipping insertion in model container [2023-12-21 21:25:54,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:25:53" (2/3) ... [2023-12-21 21:25:54,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d1a61c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 09:25:54, skipping insertion in model container [2023-12-21 21:25:54,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 09:25:54" (3/3) ... [2023-12-21 21:25:54,313 INFO L112 eAbstractionObserver]: Analyzing ICFG modulus-2.i [2023-12-21 21:25:54,330 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 21:25:54,330 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 21:25:54,385 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 21:25:54,391 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;@51d32fab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 21:25:54,392 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 21:25:54,396 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 14 states have internal predecessors, (22), 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-21 21:25:54,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-21 21:25:54,407 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:25:54,408 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:25:54,408 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:25:54,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:25:54,414 INFO L85 PathProgramCache]: Analyzing trace with hash -25434384, now seen corresponding path program 1 times [2023-12-21 21:25:54,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:25:54,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [422494797] [2023-12-21 21:25:54,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 21:25:54,428 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-21 21:25:54,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:25:54,430 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-21 21:25:54,436 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-21 21:25:54,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 21:25:54,513 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-21 21:25:54,516 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:25:54,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 21:25:54,528 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 21:25:54,529 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:25:54,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [422494797] [2023-12-21 21:25:54,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [422494797] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 21:25:54,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 21:25:54,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 21:25:54,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452559579] [2023-12-21 21:25:54,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 21:25:54,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 21:25:54,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:25:54,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 21:25:54,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 21:25:54,564 INFO L87 Difference]: Start difference. First operand has 15 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 14 states have internal predecessors, (22), 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) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-21 21:25:54,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:25:54,591 INFO L93 Difference]: Finished difference Result 28 states and 41 transitions. [2023-12-21 21:25:54,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 21:25:54,593 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) Word has length 9 [2023-12-21 21:25:54,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:25:54,599 INFO L225 Difference]: With dead ends: 28 [2023-12-21 21:25:54,599 INFO L226 Difference]: Without dead ends: 12 [2023-12-21 21:25:54,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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-21 21:25:54,603 INFO L413 NwaCegarLoop]: 16 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, 16 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-21 21:25:54,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 21:25:54,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-12-21 21:25:54,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2023-12-21 21:25:54,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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-21 21:25:54,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2023-12-21 21:25:54,651 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2023-12-21 21:25:54,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:25:54,652 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2023-12-21 21:25:54,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-21 21:25:54,652 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2023-12-21 21:25:54,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-21 21:25:54,653 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:25:54,653 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:25:54,661 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-21 21:25:54,858 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-21 21:25:54,858 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:25:54,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:25:54,859 INFO L85 PathProgramCache]: Analyzing trace with hash -834781010, now seen corresponding path program 1 times [2023-12-21 21:25:54,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:25:54,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2038242119] [2023-12-21 21:25:54,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 21:25:54,860 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-21 21:25:54,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:25:54,861 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-21 21:25:54,864 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-21 21:25:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 21:25:54,958 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-21 21:25:54,961 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:25:55,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 21:25:55,409 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 21:25:55,410 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:25:55,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2038242119] [2023-12-21 21:25:55,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2038242119] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 21:25:55,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 21:25:55,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 21:25:55,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438168323] [2023-12-21 21:25:55,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 21:25:55,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 21:25:55,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:25:55,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 21:25:55,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-21 21:25:55,413 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 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-21 21:25:55,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:25:55,749 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2023-12-21 21:25:55,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 21:25:55,750 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 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) Word has length 9 [2023-12-21 21:25:55,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:25:55,750 INFO L225 Difference]: With dead ends: 22 [2023-12-21 21:25:55,750 INFO L226 Difference]: Without dead ends: 18 [2023-12-21 21:25:55,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-12-21 21:25:55,752 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 37 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 21:25:55,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 15 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 21:25:55,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-12-21 21:25:55,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 14. [2023-12-21 21:25:55,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 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-21 21:25:55,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2023-12-21 21:25:55,757 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 9 [2023-12-21 21:25:55,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:25:55,757 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2023-12-21 21:25:55,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 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-21 21:25:55,758 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2023-12-21 21:25:55,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-21 21:25:55,758 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:25:55,758 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:25:55,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-21 21:25:55,962 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-21 21:25:55,963 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:25:55,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:25:55,964 INFO L85 PathProgramCache]: Analyzing trace with hash -834721428, now seen corresponding path program 1 times [2023-12-21 21:25:55,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:25:55,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [661864684] [2023-12-21 21:25:55,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 21:25:55,964 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-21 21:25:55,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:25:55,966 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-21 21:25:55,967 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-21 21:25:56,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 21:25:56,527 WARN L260 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-21 21:25:56,528 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:25:57,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 21:25:57,175 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 21:25:57,175 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:25:57,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [661864684] [2023-12-21 21:25:57,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [661864684] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 21:25:57,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 21:25:57,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-21 21:25:57,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949478477] [2023-12-21 21:25:57,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 21:25:57,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 21:25:57,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:25:57,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 21:25:57,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-21 21:25:57,177 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand has 9 states, 9 states have (on average 1.0) internal successors, (9), 8 states have internal predecessors, (9), 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-21 21:25:57,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:25:57,500 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2023-12-21 21:25:57,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 21:25:57,501 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.0) internal successors, (9), 8 states have internal predecessors, (9), 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) Word has length 9 [2023-12-21 21:25:57,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:25:57,502 INFO L225 Difference]: With dead ends: 18 [2023-12-21 21:25:57,502 INFO L226 Difference]: Without dead ends: 13 [2023-12-21 21:25:57,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2023-12-21 21:25:57,503 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 30 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 21:25:57,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 15 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 21:25:57,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2023-12-21 21:25:57,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2023-12-21 21:25:57,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-21 21:25:57,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2023-12-21 21:25:57,508 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 9 [2023-12-21 21:25:57,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:25:57,508 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2023-12-21 21:25:57,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.0) internal successors, (9), 8 states have internal predecessors, (9), 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-21 21:25:57,508 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2023-12-21 21:25:57,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-21 21:25:57,509 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:25:57,509 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:25:57,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-21 21:25:57,719 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-21 21:25:57,719 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:25:57,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:25:57,720 INFO L85 PathProgramCache]: Analyzing trace with hash 12711593, now seen corresponding path program 1 times [2023-12-21 21:25:57,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:25:57,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [521865234] [2023-12-21 21:25:57,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 21:25:57,721 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-21 21:25:57,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:25:57,722 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-21 21:25:57,735 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-21 21:25:57,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 21:25:57,785 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 21:25:57,786 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:25:57,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 21:25:57,796 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 21:25:57,796 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:25:57,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [521865234] [2023-12-21 21:25:57,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [521865234] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 21:25:57,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 21:25:57,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 21:25:57,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857224771] [2023-12-21 21:25:57,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 21:25:57,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 21:25:57,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:25:57,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 21:25:57,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 21:25:57,798 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-21 21:25:57,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:25:57,841 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2023-12-21 21:25:57,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 21:25:57,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) Word has length 12 [2023-12-21 21:25:57,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:25:57,845 INFO L225 Difference]: With dead ends: 22 [2023-12-21 21:25:57,846 INFO L226 Difference]: Without dead ends: 14 [2023-12-21 21:25:57,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 21:25:57,847 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 21:25:57,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 21:25:57,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-12-21 21:25:57,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-12-21 21:25:57,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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-21 21:25:57,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2023-12-21 21:25:57,852 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 12 [2023-12-21 21:25:57,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:25:57,852 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2023-12-21 21:25:57,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-21 21:25:57,852 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2023-12-21 21:25:57,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-21 21:25:57,853 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:25:57,853 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:25:57,860 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-21 21:25:58,057 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-21 21:25:58,058 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:25:58,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:25:58,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1035420769, now seen corresponding path program 1 times [2023-12-21 21:25:58,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:25:58,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [8949686] [2023-12-21 21:25:58,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 21:25:58,059 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-21 21:25:58,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:25:58,061 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-21 21:25:58,063 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-21 21:25:58,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 21:25:58,133 INFO L262 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-21 21:25:58,134 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:25:58,361 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 21:25:58,362 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:25:58,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 21:25:58,593 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:25:58,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [8949686] [2023-12-21 21:25:58,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [8949686] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 21:25:58,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 21:25:58,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-12-21 21:25:58,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782667720] [2023-12-21 21:25:58,593 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 21:25:58,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-21 21:25:58,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:25:58,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-21 21:25:58,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-12-21 21:25:58,595 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 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-21 21:25:59,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:25:59,050 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2023-12-21 21:25:59,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 21:25:59,054 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 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) Word has length 13 [2023-12-21 21:25:59,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:25:59,055 INFO L225 Difference]: With dead ends: 28 [2023-12-21 21:25:59,055 INFO L226 Difference]: Without dead ends: 19 [2023-12-21 21:25:59,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2023-12-21 21:25:59,056 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 45 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 21:25:59,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 20 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 21:25:59,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-12-21 21:25:59,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2023-12-21 21:25:59,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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-21 21:25:59,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2023-12-21 21:25:59,061 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 13 [2023-12-21 21:25:59,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:25:59,062 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2023-12-21 21:25:59,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 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-21 21:25:59,062 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2023-12-21 21:25:59,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-21 21:25:59,062 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:25:59,062 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:25:59,069 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-21 21:25:59,267 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-21 21:25:59,267 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:25:59,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:25:59,268 INFO L85 PathProgramCache]: Analyzing trace with hash 832214377, now seen corresponding path program 2 times [2023-12-21 21:25:59,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:25:59,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2019336266] [2023-12-21 21:25:59,268 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 21:25:59,268 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-21 21:25:59,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:25:59,270 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-21 21:25:59,270 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-21 21:25:59,375 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 21:25:59,375 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 21:25:59,380 WARN L260 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-21 21:25:59,381 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:26:00,712 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 21:26:00,713 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:26:06,003 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 21:26:06,003 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:26:06,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2019336266] [2023-12-21 21:26:06,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2019336266] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-21 21:26:06,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 21:26:06,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 16 [2023-12-21 21:26:06,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012448403] [2023-12-21 21:26:06,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 21:26:06,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 21:26:06,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:26:06,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 21:26:06,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2023-12-21 21:26:06,005 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-21 21:26:06,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:26:06,694 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2023-12-21 21:26:06,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 21:26:06,697 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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) Word has length 14 [2023-12-21 21:26:06,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:26:06,697 INFO L225 Difference]: With dead ends: 19 [2023-12-21 21:26:06,697 INFO L226 Difference]: Without dead ends: 15 [2023-12-21 21:26:06,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2023-12-21 21:26:06,699 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 6 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-21 21:26:06,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 16 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-21 21:26:06,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-12-21 21:26:06,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-12-21 21:26:06,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 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-21 21:26:06,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2023-12-21 21:26:06,705 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 14 [2023-12-21 21:26:06,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:26:06,705 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2023-12-21 21:26:06,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-21 21:26:06,705 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2023-12-21 21:26:06,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-21 21:26:06,705 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:26:06,706 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:26:06,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-21 21:26:06,910 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-21 21:26:06,910 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:26:06,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:26:06,911 INFO L85 PathProgramCache]: Analyzing trace with hash 832273959, now seen corresponding path program 1 times [2023-12-21 21:26:06,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:26:06,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [236006283] [2023-12-21 21:26:06,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 21:26:06,912 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-21 21:26:06,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:26:06,913 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-21 21:26:06,914 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-21 21:26:07,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 21:26:07,577 WARN L260 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-21 21:26:07,579 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:26:13,787 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 21:26:13,788 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:26:16,125 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 21:26:16,126 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:26:16,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [236006283] [2023-12-21 21:26:16,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [236006283] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-21 21:26:16,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 21:26:16,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 18 [2023-12-21 21:26:16,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645218440] [2023-12-21 21:26:16,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 21:26:16,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 21:26:16,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:26:16,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 21:26:16,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=246, Unknown=1, NotChecked=0, Total=306 [2023-12-21 21:26:16,127 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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-21 21:26:16,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:26:16,916 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2023-12-21 21:26:16,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 21:26:16,916 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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) Word has length 14 [2023-12-21 21:26:16,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:26:16,917 INFO L225 Difference]: With dead ends: 15 [2023-12-21 21:26:16,917 INFO L226 Difference]: Without dead ends: 0 [2023-12-21 21:26:16,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=65, Invalid=276, Unknown=1, NotChecked=0, Total=342 [2023-12-21 21:26:16,918 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 1 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-21 21:26:16,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 13 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-21 21:26:16,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-21 21:26:16,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-21 21:26:16,919 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-21 21:26:16,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-21 21:26:16,920 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2023-12-21 21:26:16,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:26:16,920 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-21 21:26:16,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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-21 21:26:16,920 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-21 21:26:16,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-21 21:26:16,922 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 21:26:16,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-21 21:26:17,124 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-21 21:26:17,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-21 21:26:18,052 INFO L895 garLoopResultBuilder]: At program point L56-2(lines 56 59) the Hoare annotation is: (let ((.cse0 (bvadd |ULTIMATE.start_main_~d~0#1| (_ bv1 32)))) (and (= (bvshl (_ bv1 32) |ULTIMATE.start_main_~s~0#1|) .cse0) (exists ((v_subst_5 (_ BitVec 32))) (and (bvult v_subst_5 (_ bv31 32)) (= (bvshl (_ bv1 32) v_subst_5) .cse0))))) [2023-12-21 21:26:18,052 INFO L899 garLoopResultBuilder]: For program point L56-3(lines 56 59) no Hoare annotation was computed. [2023-12-21 21:26:18,052 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 66) no Hoare annotation was computed. [2023-12-21 21:26:18,052 INFO L899 garLoopResultBuilder]: For program point L52-2(lines 52 66) no Hoare annotation was computed. [2023-12-21 21:26:18,052 INFO L899 garLoopResultBuilder]: For program point L11(line 11) no Hoare annotation was computed. [2023-12-21 21:26:18,052 INFO L899 garLoopResultBuilder]: For program point L28(lines 28 30) no Hoare annotation was computed. [2023-12-21 21:26:18,052 INFO L899 garLoopResultBuilder]: For program point L28-2(lines 27 32) no Hoare annotation was computed. [2023-12-21 21:26:18,052 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 29) no Hoare annotation was computed. [2023-12-21 21:26:18,053 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-21 21:26:18,053 INFO L899 garLoopResultBuilder]: For program point L62-1(lines 62 64) no Hoare annotation was computed. [2023-12-21 21:26:18,053 INFO L899 garLoopResultBuilder]: For program point L29(line 29) no Hoare annotation was computed. [2023-12-21 21:26:18,053 INFO L895 garLoopResultBuilder]: At program point L54-2(lines 54 61) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse0 (bvurem |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse2 (bvadd |ULTIMATE.start_main_~d~0#1| (_ bv1 32)))) (and (or (= |ULTIMATE.start_main_~m~0#1| .cse0) (bvugt |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~d~0#1|) .cse1) (= (bvshl (_ bv1 32) |ULTIMATE.start_main_~s~0#1|) .cse2) (or (not (= |ULTIMATE.start_main_~d~0#1| (bvadd |ULTIMATE.start_main_~m~0#1| (bvand |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~d~0#1|)))) (not (bvugt |ULTIMATE.start_main_~n~0#1| (_ bv0 32))) (bvugt (bvlshr |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~s~0#1|) (_ bv0 32))) (or (not .cse1) (= (_ bv0 32) .cse0)) (exists ((v_subst_5 (_ BitVec 32))) (and (bvult v_subst_5 (_ bv31 32)) (= (bvshl (_ bv1 32) v_subst_5) .cse2))))) [2023-12-21 21:26:18,053 INFO L899 garLoopResultBuilder]: For program point L54-3(lines 52 66) no Hoare annotation was computed. [2023-12-21 21:26:18,053 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-21 21:26:18,053 INFO L899 garLoopResultBuilder]: For program point L10(lines 10 12) no Hoare annotation was computed. [2023-12-21 21:26:18,056 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2023-12-21 21:26:18,057 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 21:26:18,066 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~bvlshr~32 [2023-12-21 21:26:18,072 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_5 : bv32 :: ~bvult~32(v_subst_5, 31bv32) && ~bvshl~32(1bv32, v_subst_5) == ~bvadd~32(~d~0, 1bv32)) could not be translated [2023-12-21 21:26:18,077 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_5 : bv32 :: ~bvult~32(v_subst_5, 31bv32) && ~bvshl~32(1bv32, v_subst_5) == ~bvadd~32(~d~0, 1bv32)) could not be translated [2023-12-21 21:26:18,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 09:26:18 BoogieIcfgContainer [2023-12-21 21:26:18,080 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 21:26:18,080 INFO L158 Benchmark]: Toolchain (without parser) took 24345.58ms. Allocated memory is still 274.7MB. Free memory was 221.3MB in the beginning and 154.0MB in the end (delta: 67.3MB). Peak memory consumption was 68.3MB. Max. memory is 8.0GB. [2023-12-21 21:26:18,080 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 211.8MB. Free memory is still 160.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 21:26:18,080 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.49ms. Allocated memory is still 274.7MB. Free memory was 221.0MB in the beginning and 209.8MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-21 21:26:18,081 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.52ms. Allocated memory is still 274.7MB. Free memory was 209.8MB in the beginning and 208.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 21:26:18,081 INFO L158 Benchmark]: Boogie Preprocessor took 29.98ms. Allocated memory is still 274.7MB. Free memory was 208.2MB in the beginning and 206.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 21:26:18,081 INFO L158 Benchmark]: RCFGBuilder took 285.65ms. Allocated memory is still 274.7MB. Free memory was 206.3MB in the beginning and 195.1MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-21 21:26:18,082 INFO L158 Benchmark]: TraceAbstraction took 23779.14ms. Allocated memory is still 274.7MB. Free memory was 194.5MB in the beginning and 154.0MB in the end (delta: 40.5MB). Peak memory consumption was 41.1MB. Max. memory is 8.0GB. [2023-12-21 21:26:18,083 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.15ms. Allocated memory is still 211.8MB. Free memory is still 160.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 216.49ms. Allocated memory is still 274.7MB. Free memory was 221.0MB in the beginning and 209.8MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.52ms. Allocated memory is still 274.7MB. Free memory was 209.8MB in the beginning and 208.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.98ms. Allocated memory is still 274.7MB. Free memory was 208.2MB in the beginning and 206.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 285.65ms. Allocated memory is still 274.7MB. Free memory was 206.3MB in the beginning and 195.1MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 23779.14ms. Allocated memory is still 274.7MB. Free memory was 194.5MB in the beginning and 154.0MB in the end (delta: 40.5MB). Peak memory consumption was 41.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~bvlshr~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_5 : bv32 :: ~bvult~32(v_subst_5, 31bv32) && ~bvshl~32(1bv32, v_subst_5) == ~bvadd~32(~d~0, 1bv32)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_5 : bv32 :: ~bvult~32(v_subst_5, 31bv32) && ~bvshl~32(1bv32, v_subst_5) == ~bvadd~32(~d~0, 1bv32)) 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: 29]: 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 1 procedures, 15 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.7s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 119 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 119 mSDsluCounter, 113 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 241 IncrementalHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 53 mSDtfsCounter, 241 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 14.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=0, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 7 NumberOfFragments, 80 HoareAnnotationTreeSize, 2 FormulaSimplifications, 12 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FormulaSimplificationsInter, 213 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 16.8s InterpolantComputationTime, 80 NumberOfCodeBlocks, 80 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 111 ConstructedInterpolants, 23 QuantifiedInterpolants, 1060 SizeOfPredicates, 37 NumberOfNonLiveVariables, 190 ConjunctsInSsa, 73 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 10/21 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: 54]: Loop Invariant Derived loop invariant: (((((m == (n % d)) || (n > d)) || (m == d)) && ((1 << s) == ((d + 1) % 4294967296))) && (!((m == d)) || (0 == (n % d)))) - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: ((1 << s) == ((d + 1) % 4294967296)) RESULT: Ultimate proved your program to be correct! [2023-12-21 21:26:18,123 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...