/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/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-33.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 13:52:12,272 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 13:52:12,345 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-16 13:52:12,350 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 13:52:12,350 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 13:52:12,371 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 13:52:12,371 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 13:52:12,371 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 13:52:12,372 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 13:52:12,374 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 13:52:12,375 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 13:52:12,375 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 13:52:12,375 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 13:52:12,376 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 13:52:12,376 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 13:52:12,377 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 13:52:12,377 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 13:52:12,377 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 13:52:12,377 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 13:52:12,377 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 13:52:12,378 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 13:52:12,378 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 13:52:12,378 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 13:52:12,378 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 13:52:12,379 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 13:52:12,379 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 13:52:12,379 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 13:52:12,379 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 13:52:12,379 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 13:52:12,379 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 13:52:12,380 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 13:52:12,380 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 13:52:12,380 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 13:52:12,380 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 13:52:12,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 13:52:12,381 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 13:52:12,381 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 13:52:12,381 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 13:52:12,381 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 13:52:12,381 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 13:52:12,381 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 13:52:12,381 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 13:52:12,381 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 13:52:12,381 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 13:52:12,382 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 13:52:12,382 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 13:52:12,382 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-16 13:52:12,549 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 13:52:12,563 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 13:52:12,565 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 13:52:12,565 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 13:52:12,567 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 13:52:12,567 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-33.i [2023-12-16 13:52:13,548 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 13:52:13,680 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 13:52:13,680 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-33.i [2023-12-16 13:52:13,685 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/276864c65/892ed9edb45a4835a0bf7a74f161a745/FLAG4c7776416 [2023-12-16 13:52:13,695 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/276864c65/892ed9edb45a4835a0bf7a74f161a745 [2023-12-16 13:52:13,697 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 13:52:13,698 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 13:52:13,698 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 13:52:13,698 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 13:52:13,701 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 13:52:13,702 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 01:52:13" (1/1) ... [2023-12-16 13:52:13,702 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@650d302e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:52:13, skipping insertion in model container [2023-12-16 13:52:13,702 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 01:52:13" (1/1) ... [2023-12-16 13:52:13,725 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 13:52:13,817 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-33.i[915,928] [2023-12-16 13:52:13,842 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 13:52:13,857 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 13:52:13,865 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-33.i[915,928] [2023-12-16 13:52:13,877 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 13:52:13,890 INFO L206 MainTranslator]: Completed translation [2023-12-16 13:52:13,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:52:13 WrapperNode [2023-12-16 13:52:13,890 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 13:52:13,891 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 13:52:13,891 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 13:52:13,891 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 13:52:13,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:52:13" (1/1) ... [2023-12-16 13:52:13,901 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:52:13" (1/1) ... [2023-12-16 13:52:13,922 INFO L138 Inliner]: procedures = 27, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 94 [2023-12-16 13:52:13,922 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 13:52:13,923 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 13:52:13,923 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 13:52:13,923 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 13:52:13,929 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:52:13" (1/1) ... [2023-12-16 13:52:13,929 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:52:13" (1/1) ... [2023-12-16 13:52:13,932 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:52:13" (1/1) ... [2023-12-16 13:52:13,940 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-16 13:52:13,940 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:52:13" (1/1) ... [2023-12-16 13:52:13,940 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:52:13" (1/1) ... [2023-12-16 13:52:13,945 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:52:13" (1/1) ... [2023-12-16 13:52:13,948 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:52:13" (1/1) ... [2023-12-16 13:52:13,950 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:52:13" (1/1) ... [2023-12-16 13:52:13,950 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:52:13" (1/1) ... [2023-12-16 13:52:13,952 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 13:52:13,953 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 13:52:13,953 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 13:52:13,953 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 13:52:13,954 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:52:13" (1/1) ... [2023-12-16 13:52:13,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 13:52:13,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 13:52:13,979 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-16 13:52:13,997 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-16 13:52:14,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 13:52:14,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 13:52:14,006 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 13:52:14,007 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 13:52:14,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 13:52:14,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 13:52:14,083 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 13:52:14,086 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 13:52:14,331 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 13:52:14,363 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 13:52:14,363 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 13:52:14,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 01:52:14 BoogieIcfgContainer [2023-12-16 13:52:14,364 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 13:52:14,365 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 13:52:14,365 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 13:52:14,367 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 13:52:14,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 01:52:13" (1/3) ... [2023-12-16 13:52:14,368 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6436581f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 01:52:14, skipping insertion in model container [2023-12-16 13:52:14,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:52:13" (2/3) ... [2023-12-16 13:52:14,368 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6436581f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 01:52:14, skipping insertion in model container [2023-12-16 13:52:14,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 01:52:14" (3/3) ... [2023-12-16 13:52:14,369 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-33.i [2023-12-16 13:52:14,380 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 13:52:14,380 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 13:52:14,416 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 13:52:14,421 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;@4140e065, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 13:52:14,422 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 13:52:14,425 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 25 states have internal predecessors, (35), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-16 13:52:14,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-16 13:52:14,431 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 13:52:14,432 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 13:52:14,432 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 13:52:14,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 13:52:14,436 INFO L85 PathProgramCache]: Analyzing trace with hash -440859390, now seen corresponding path program 1 times [2023-12-16 13:52:14,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 13:52:14,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [738304090] [2023-12-16 13:52:14,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 13:52:14,444 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-16 13:52:14,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 13:52:14,446 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-16 13:52:14,449 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-16 13:52:14,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 13:52:14,580 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 13:52:14,585 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 13:52:14,799 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 13:52:14,800 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 13:52:14,800 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 13:52:14,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [738304090] [2023-12-16 13:52:14,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [738304090] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 13:52:14,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 13:52:14,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 13:52:14,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568729285] [2023-12-16 13:52:14,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 13:52:14,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 13:52:14,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 13:52:14,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 13:52:14,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 13:52:14,832 INFO L87 Difference]: Start difference. First operand has 35 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 25 states have internal predecessors, (35), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 13:52:15,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 13:52:15,122 INFO L93 Difference]: Finished difference Result 140 states and 229 transitions. [2023-12-16 13:52:15,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 13:52:15,125 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 57 [2023-12-16 13:52:15,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 13:52:15,132 INFO L225 Difference]: With dead ends: 140 [2023-12-16 13:52:15,132 INFO L226 Difference]: Without dead ends: 98 [2023-12-16 13:52:15,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-16 13:52:15,137 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 105 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 13:52:15,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 239 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 13:52:15,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-16 13:52:15,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 56. [2023-12-16 13:52:15,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-16 13:52:15,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2023-12-16 13:52:15,190 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 76 transitions. Word has length 57 [2023-12-16 13:52:15,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 13:52:15,191 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 76 transitions. [2023-12-16 13:52:15,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 13:52:15,192 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2023-12-16 13:52:15,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-16 13:52:15,195 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 13:52:15,195 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 13:52:15,200 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-16 13:52:15,400 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-16 13:52:15,401 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 13:52:15,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 13:52:15,401 INFO L85 PathProgramCache]: Analyzing trace with hash -383601088, now seen corresponding path program 1 times [2023-12-16 13:52:15,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 13:52:15,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [743612832] [2023-12-16 13:52:15,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 13:52:15,403 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-16 13:52:15,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 13:52:15,404 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-16 13:52:15,414 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-16 13:52:15,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 13:52:15,506 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 13:52:15,509 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 13:52:15,633 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-12-16 13:52:15,634 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 13:52:15,634 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 13:52:15,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [743612832] [2023-12-16 13:52:15,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [743612832] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 13:52:15,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 13:52:15,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 13:52:15,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26507706] [2023-12-16 13:52:15,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 13:52:15,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 13:52:15,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 13:52:15,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 13:52:15,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-16 13:52:15,637 INFO L87 Difference]: Start difference. First operand 56 states and 76 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-16 13:52:15,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 13:52:15,924 INFO L93 Difference]: Finished difference Result 108 states and 136 transitions. [2023-12-16 13:52:15,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 13:52:15,924 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 57 [2023-12-16 13:52:15,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 13:52:15,925 INFO L225 Difference]: With dead ends: 108 [2023-12-16 13:52:15,925 INFO L226 Difference]: Without dead ends: 76 [2023-12-16 13:52:15,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2023-12-16 13:52:15,927 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 83 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 13:52:15,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 98 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 13:52:15,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-12-16 13:52:15,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2023-12-16 13:52:15,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 49 states have internal predecessors, (55), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-16 13:52:15,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2023-12-16 13:52:15,937 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 57 [2023-12-16 13:52:15,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 13:52:15,937 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2023-12-16 13:52:15,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-16 13:52:15,937 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2023-12-16 13:52:15,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-16 13:52:15,938 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 13:52:15,938 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 13:52:15,948 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-16 13:52:16,138 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-16 13:52:16,139 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 13:52:16,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 13:52:16,139 INFO L85 PathProgramCache]: Analyzing trace with hash 978685959, now seen corresponding path program 1 times [2023-12-16 13:52:16,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 13:52:16,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [937547652] [2023-12-16 13:52:16,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 13:52:16,140 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-16 13:52:16,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 13:52:16,141 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-16 13:52:16,143 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-16 13:52:16,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 13:52:16,231 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-16 13:52:16,234 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 13:53:16,069 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 13:53:16,069 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 13:53:16,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 13:53:16,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [937547652] [2023-12-16 13:53:16,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [937547652] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 13:53:16,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 13:53:16,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 13:53:16,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439058986] [2023-12-16 13:53:16,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 13:53:16,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 13:53:16,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 13:53:16,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 13:53:16,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-16 13:53:16,072 INFO L87 Difference]: Start difference. First operand 72 states and 87 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 13:53:16,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 13:53:16,324 INFO L93 Difference]: Finished difference Result 96 states and 116 transitions. [2023-12-16 13:53:16,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 13:53:16,326 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 58 [2023-12-16 13:53:16,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 13:53:16,327 INFO L225 Difference]: With dead ends: 96 [2023-12-16 13:53:16,327 INFO L226 Difference]: Without dead ends: 94 [2023-12-16 13:53:16,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-12-16 13:53:16,328 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 45 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 13:53:16,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 139 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 13:53:16,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-12-16 13:53:16,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 78. [2023-12-16 13:53:16,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 55 states have internal predecessors, (63), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-16 13:53:16,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 95 transitions. [2023-12-16 13:53:16,337 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 95 transitions. Word has length 58 [2023-12-16 13:53:16,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 13:53:16,338 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 95 transitions. [2023-12-16 13:53:16,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 13:53:16,338 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2023-12-16 13:53:16,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-16 13:53:16,339 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 13:53:16,339 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 13:53:16,347 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-16 13:53:16,546 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-16 13:53:16,546 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 13:53:16,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 13:53:16,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1497385981, now seen corresponding path program 1 times [2023-12-16 13:53:16,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 13:53:16,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1752977821] [2023-12-16 13:53:16,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 13:53:16,548 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-16 13:53:16,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 13:53:16,549 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-16 13:53:16,551 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-16 13:53:16,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 13:53:16,642 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 13:53:16,643 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 13:53:16,700 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 13:53:16,700 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 13:53:16,700 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 13:53:16,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1752977821] [2023-12-16 13:53:16,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1752977821] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 13:53:16,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 13:53:16,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 13:53:16,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641944827] [2023-12-16 13:53:16,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 13:53:16,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 13:53:16,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 13:53:16,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 13:53:16,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 13:53:16,702 INFO L87 Difference]: Start difference. First operand 78 states and 95 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 13:53:16,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 13:53:16,945 INFO L93 Difference]: Finished difference Result 164 states and 199 transitions. [2023-12-16 13:53:16,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 13:53:16,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 58 [2023-12-16 13:53:16,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 13:53:16,946 INFO L225 Difference]: With dead ends: 164 [2023-12-16 13:53:16,946 INFO L226 Difference]: Without dead ends: 124 [2023-12-16 13:53:16,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-16 13:53:16,947 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 58 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 13:53:16,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 157 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 13:53:16,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-12-16 13:53:16,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 116. [2023-12-16 13:53:16,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-16 13:53:16,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 141 transitions. [2023-12-16 13:53:16,964 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 141 transitions. Word has length 58 [2023-12-16 13:53:16,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 13:53:16,965 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 141 transitions. [2023-12-16 13:53:16,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 13:53:16,965 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 141 transitions. [2023-12-16 13:53:16,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-16 13:53:16,966 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 13:53:16,966 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 13:53:16,971 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-16 13:53:17,169 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-16 13:53:17,170 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 13:53:17,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 13:53:17,170 INFO L85 PathProgramCache]: Analyzing trace with hash 265303627, now seen corresponding path program 1 times [2023-12-16 13:53:17,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 13:53:17,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [129962329] [2023-12-16 13:53:17,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 13:53:17,171 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-16 13:53:17,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 13:53:17,172 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-16 13:53:17,173 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-16 13:53:17,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 13:53:17,263 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 13:53:17,264 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 13:53:17,275 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 13:53:17,275 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 13:53:17,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 13:53:17,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [129962329] [2023-12-16 13:53:17,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [129962329] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 13:53:17,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 13:53:17,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 13:53:17,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95389564] [2023-12-16 13:53:17,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 13:53:17,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 13:53:17,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 13:53:17,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 13:53:17,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 13:53:17,277 INFO L87 Difference]: Start difference. First operand 116 states and 141 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 13:53:17,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 13:53:17,345 INFO L93 Difference]: Finished difference Result 118 states and 142 transitions. [2023-12-16 13:53:17,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 13:53:17,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 59 [2023-12-16 13:53:17,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 13:53:17,347 INFO L225 Difference]: With dead ends: 118 [2023-12-16 13:53:17,347 INFO L226 Difference]: Without dead ends: 78 [2023-12-16 13:53:17,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 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-16 13:53:17,348 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 13:53:17,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 67 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 13:53:17,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-12-16 13:53:17,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-12-16 13:53:17,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 55 states have internal predecessors, (59), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-16 13:53:17,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2023-12-16 13:53:17,356 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 91 transitions. Word has length 59 [2023-12-16 13:53:17,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 13:53:17,356 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 91 transitions. [2023-12-16 13:53:17,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 13:53:17,356 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2023-12-16 13:53:17,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-16 13:53:17,357 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 13:53:17,358 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 13:53:17,366 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-16 13:53:17,558 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-16 13:53:17,561 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 13:53:17,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 13:53:17,561 INFO L85 PathProgramCache]: Analyzing trace with hash 233526000, now seen corresponding path program 1 times [2023-12-16 13:53:17,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 13:53:17,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1366135011] [2023-12-16 13:53:17,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 13:53:17,562 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-16 13:53:17,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 13:53:17,563 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-16 13:53:17,564 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-16 13:53:17,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 13:53:17,692 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 13:53:17,695 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 13:53:17,731 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 279 proven. 1 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2023-12-16 13:53:17,731 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 13:53:17,813 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 13:53:17,814 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 13:53:17,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1366135011] [2023-12-16 13:53:17,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1366135011] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 13:53:17,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 13:53:17,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-16 13:53:17,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727054119] [2023-12-16 13:53:17,814 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 13:53:17,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 13:53:17,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 13:53:17,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 13:53:17,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-16 13:53:17,815 INFO L87 Difference]: Start difference. First operand 78 states and 91 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 3 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2023-12-16 13:53:17,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 13:53:17,902 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2023-12-16 13:53:17,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 13:53:17,913 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 3 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) Word has length 115 [2023-12-16 13:53:17,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 13:53:17,914 INFO L225 Difference]: With dead ends: 80 [2023-12-16 13:53:17,914 INFO L226 Difference]: Without dead ends: 0 [2023-12-16 13:53:17,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-16 13:53:17,915 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 2 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 13:53:17,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 84 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 13:53:17,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-16 13:53:17,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-16 13:53:17,916 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-16 13:53:17,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-16 13:53:17,916 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 115 [2023-12-16 13:53:17,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 13:53:17,916 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-16 13:53:17,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 3 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2023-12-16 13:53:17,916 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-16 13:53:17,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-16 13:53:17,918 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 13:53:17,926 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-16 13:53:18,126 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-16 13:53:18,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-16 13:53:18,315 INFO L899 garLoopResultBuilder]: For program point L56(lines 56 60) no Hoare annotation was computed. [2023-12-16 13:53:18,316 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-16 13:53:18,316 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-16 13:53:18,316 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-16 13:53:18,316 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (let ((.cse1 ((_ zero_extend 24) ~var_1_17~0)) (.cse0 ((_ zero_extend 24) ~var_1_16~0))) (and (bvsle .cse0 (_ bv1 32)) (= (_ bv0 8) (bvadd ~var_1_7~0 (_ bv56 8))) (bvsle .cse1 (_ bv1 32)) (bvsge .cse1 (_ bv1 32)) (= ~var_1_9~0 (_ bv50 8)) (= ~last_1_var_1_9~0 (_ bv50 8)) (bvsge .cse0 (_ bv1 32)) (= |ULTIMATE.start_main_~k_loop~0#1| (_ bv0 32)) (= (bvadd ~last_1_var_1_7~0 (_ bv56 8)) (_ bv0 8)))) [2023-12-16 13:53:18,316 INFO L899 garLoopResultBuilder]: For program point L73-1(line 73) no Hoare annotation was computed. [2023-12-16 13:53:18,316 INFO L899 garLoopResultBuilder]: For program point L69(line 69) no Hoare annotation was computed. [2023-12-16 13:53:18,317 INFO L895 garLoopResultBuilder]: At program point L65(line 65) the Hoare annotation is: (let ((.cse1 ((_ zero_extend 24) ~var_1_17~0)) (.cse0 ((_ zero_extend 24) ~var_1_16~0))) (and (bvsle .cse0 (_ bv1 32)) (= (_ bv0 8) (bvadd ~var_1_7~0 (_ bv56 8))) (bvsle .cse1 (_ bv1 32)) (bvsge .cse1 (_ bv1 32)) (= ~var_1_9~0 (_ bv50 8)) (= ~last_1_var_1_9~0 (_ bv50 8)) (bvsge .cse0 (_ bv1 32)) (= |ULTIMATE.start_main_~k_loop~0#1| (_ bv0 32)) (= (bvadd ~last_1_var_1_7~0 (_ bv56 8)) (_ bv0 8)))) [2023-12-16 13:53:18,317 INFO L895 garLoopResultBuilder]: At program point L65-1(line 65) the Hoare annotation is: (let ((.cse1 ((_ zero_extend 24) ~var_1_17~0)) (.cse0 ((_ zero_extend 24) ~var_1_16~0))) (and (bvsle .cse0 (_ bv1 32)) (= (_ bv0 8) (bvadd ~var_1_7~0 (_ bv56 8))) (bvsle .cse1 (_ bv1 32)) (bvsge .cse1 (_ bv1 32)) (= ~var_1_9~0 (_ bv50 8)) (= ~last_1_var_1_9~0 (_ bv50 8)) (bvsge .cse0 (_ bv1 32)) (= |ULTIMATE.start_main_~k_loop~0#1| (_ bv0 32)) (= (bvadd ~last_1_var_1_7~0 (_ bv56 8)) (_ bv0 8)))) [2023-12-16 13:53:18,317 INFO L899 garLoopResultBuilder]: For program point L57(lines 57 59) no Hoare annotation was computed. [2023-12-16 13:53:18,317 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-16 13:53:18,317 INFO L895 garLoopResultBuilder]: At program point L90-3(lines 90 96) the Hoare annotation is: (let ((.cse7 ((_ zero_extend 24) ~var_1_17~0)) (.cse6 ((_ zero_extend 24) ~var_1_16~0))) (let ((.cse0 (bvsle .cse6 (_ bv1 32))) (.cse1 (bvsle .cse7 (_ bv1 32))) (.cse2 (bvsge .cse7 (_ bv1 32))) (.cse3 (= ~var_1_9~0 (_ bv50 8))) (.cse4 (= ~last_1_var_1_9~0 (_ bv50 8))) (.cse5 (bvsge .cse6 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_main_~k_loop~0#1| (_ bv1 32))) (and .cse0 (= (_ bv0 8) (bvadd ~var_1_7~0 (_ bv56 8))) .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_main_~k_loop~0#1| (_ bv0 32)) (= (bvadd ~last_1_var_1_7~0 (_ bv56 8)) (_ bv0 8)))))) [2023-12-16 13:53:18,317 INFO L899 garLoopResultBuilder]: For program point L90-4(lines 90 96) no Hoare annotation was computed. [2023-12-16 13:53:18,317 INFO L899 garLoopResultBuilder]: For program point L37(lines 37 62) no Hoare annotation was computed. [2023-12-16 13:53:18,317 INFO L899 garLoopResultBuilder]: For program point L66(line 66) no Hoare annotation was computed. [2023-12-16 13:53:18,317 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-16 13:53:18,317 INFO L899 garLoopResultBuilder]: For program point L50(lines 50 52) no Hoare annotation was computed. [2023-12-16 13:53:18,317 INFO L899 garLoopResultBuilder]: For program point L50-2(lines 50 52) no Hoare annotation was computed. [2023-12-16 13:53:18,318 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 48) no Hoare annotation was computed. [2023-12-16 13:53:18,318 INFO L899 garLoopResultBuilder]: For program point L46-2(lines 46 48) no Hoare annotation was computed. [2023-12-16 13:53:18,318 INFO L895 garLoopResultBuilder]: At program point L75(line 75) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_16~0))) (and (bvsle .cse0 (_ bv1 32)) (= (_ bv0 8) (bvadd ~var_1_7~0 (_ bv56 8))) (= ~var_1_9~0 (_ bv50 8)) (= ~last_1_var_1_9~0 (_ bv50 8)) (bvsge .cse0 (_ bv1 32)) (= |ULTIMATE.start_main_~k_loop~0#1| (_ bv0 32)) (= (bvadd ~last_1_var_1_7~0 (_ bv56 8)) (_ bv0 8)))) [2023-12-16 13:53:18,318 INFO L895 garLoopResultBuilder]: At program point L75-1(line 75) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_16~0))) (and (bvsle .cse0 (_ bv1 32)) (= (_ bv0 8) (bvadd ~var_1_7~0 (_ bv56 8))) (bvsge ((_ zero_extend 24) ~var_1_17~0) (_ bv1 32)) (= ~var_1_9~0 (_ bv50 8)) (= ~last_1_var_1_9~0 (_ bv50 8)) (bvsge .cse0 (_ bv1 32)) (= |ULTIMATE.start_main_~k_loop~0#1| (_ bv0 32)) (= (bvadd ~last_1_var_1_7~0 (_ bv56 8)) (_ bv0 8)))) [2023-12-16 13:53:18,318 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-16 13:53:18,318 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (let ((.cse1 ((_ zero_extend 24) ~var_1_17~0)) (.cse0 ((_ zero_extend 24) ~var_1_16~0))) (and (bvsle .cse0 (_ bv1 32)) (= (_ bv0 8) (bvadd ~var_1_7~0 (_ bv56 8))) (bvsle .cse1 (_ bv1 32)) (bvsge .cse1 (_ bv1 32)) (= ~var_1_9~0 (_ bv50 8)) (= ~last_1_var_1_9~0 (_ bv50 8)) (bvsge .cse0 (_ bv1 32)) (= |ULTIMATE.start_main_~k_loop~0#1| (_ bv0 32)) (= (bvadd ~last_1_var_1_7~0 (_ bv56 8)) (_ bv0 8)))) [2023-12-16 13:53:18,318 INFO L899 garLoopResultBuilder]: For program point L71-1(line 71) no Hoare annotation was computed. [2023-12-16 13:53:18,318 INFO L899 garLoopResultBuilder]: For program point L55(lines 55 61) no Hoare annotation was computed. [2023-12-16 13:53:18,318 INFO L899 garLoopResultBuilder]: For program point L76(lines 63 77) no Hoare annotation was computed. [2023-12-16 13:53:18,318 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 43) no Hoare annotation was computed. [2023-12-16 13:53:18,318 INFO L899 garLoopResultBuilder]: For program point L39-2(lines 39 43) no Hoare annotation was computed. [2023-12-16 13:53:18,319 INFO L895 garLoopResultBuilder]: At program point L68(line 68) the Hoare annotation is: (let ((.cse1 ((_ zero_extend 24) ~var_1_17~0)) (.cse0 ((_ zero_extend 24) ~var_1_16~0))) (and (bvsle .cse0 (_ bv1 32)) (= (_ bv0 8) (bvadd ~var_1_7~0 (_ bv56 8))) (bvsle .cse1 (_ bv1 32)) (bvsge .cse1 (_ bv1 32)) (= ~var_1_9~0 (_ bv50 8)) (= ~last_1_var_1_9~0 (_ bv50 8)) (bvsge .cse0 (_ bv1 32)) (= |ULTIMATE.start_main_~k_loop~0#1| (_ bv0 32)) (= (bvadd ~last_1_var_1_7~0 (_ bv56 8)) (_ bv0 8)))) [2023-12-16 13:53:18,319 INFO L895 garLoopResultBuilder]: At program point L68-1(line 68) the Hoare annotation is: (let ((.cse1 ((_ zero_extend 24) ~var_1_17~0)) (.cse0 ((_ zero_extend 24) ~var_1_16~0))) (and (bvsle .cse0 (_ bv1 32)) (= (_ bv0 8) (bvadd ~var_1_7~0 (_ bv56 8))) (bvsle .cse1 (_ bv1 32)) (bvsge .cse1 (_ bv1 32)) (= ~var_1_9~0 (_ bv50 8)) (= ~last_1_var_1_9~0 (_ bv50 8)) (bvsge .cse0 (_ bv1 32)) (= |ULTIMATE.start_main_~k_loop~0#1| (_ bv0 32)) (= (bvadd ~last_1_var_1_7~0 (_ bv56 8)) (_ bv0 8)))) [2023-12-16 13:53:18,319 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-16 13:53:18,319 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-16 13:53:18,319 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-16 13:53:18,319 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-16 13:53:18,321 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-16 13:53:18,323 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 13:53:18,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 01:53:18 BoogieIcfgContainer [2023-12-16 13:53:18,330 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 13:53:18,331 INFO L158 Benchmark]: Toolchain (without parser) took 64633.01ms. Allocated memory was 197.1MB in the beginning and 796.9MB in the end (delta: 599.8MB). Free memory was 158.6MB in the beginning and 741.8MB in the end (delta: -583.2MB). Peak memory consumption was 470.1MB. Max. memory is 8.0GB. [2023-12-16 13:53:18,331 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 197.1MB. Free memory is still 151.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 13:53:18,331 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.05ms. Allocated memory is still 197.1MB. Free memory was 158.2MB in the beginning and 145.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-16 13:53:18,331 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.67ms. Allocated memory is still 197.1MB. Free memory was 145.6MB in the beginning and 143.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 13:53:18,331 INFO L158 Benchmark]: Boogie Preprocessor took 29.30ms. Allocated memory is still 197.1MB. Free memory was 143.5MB in the beginning and 141.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 13:53:18,332 INFO L158 Benchmark]: RCFGBuilder took 411.16ms. Allocated memory is still 197.1MB. Free memory was 141.0MB in the beginning and 122.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-16 13:53:18,332 INFO L158 Benchmark]: TraceAbstraction took 63964.90ms. Allocated memory was 197.1MB in the beginning and 796.9MB in the end (delta: 599.8MB). Free memory was 121.5MB in the beginning and 741.8MB in the end (delta: -620.3MB). Peak memory consumption was 432.4MB. Max. memory is 8.0GB. [2023-12-16 13:53:18,333 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.11ms. Allocated memory is still 197.1MB. Free memory is still 151.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 192.05ms. Allocated memory is still 197.1MB. Free memory was 158.2MB in the beginning and 145.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.67ms. Allocated memory is still 197.1MB. Free memory was 145.6MB in the beginning and 143.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.30ms. Allocated memory is still 197.1MB. Free memory was 143.5MB in the beginning and 141.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 411.16ms. Allocated memory is still 197.1MB. Free memory was 141.0MB in the beginning and 122.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 63964.90ms. Allocated memory was 197.1MB in the beginning and 796.9MB in the end (delta: 599.8MB). Free memory was 121.5MB in the beginning and 741.8MB in the end (delta: -620.3MB). Peak memory consumption was 432.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: 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 2 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 63.9s, OverallIterations: 6, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 296 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 295 mSDsluCounter, 784 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 555 mSDsCounter, 92 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 311 IncrementalHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 92 mSolverCounterUnsat, 229 mSDtfsCounter, 311 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 533 GetRequests, 488 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=4, InterpolantAutomatonStates: 41, 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, 6 MinimizatonAttempts, 70 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 57 PreInvPairs, 67 NumberOfFragments, 340 HoareAnnotationTreeSize, 57 FormulaSimplifications, 132 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FormulaSimplificationsInter, 328 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 60.4s InterpolantComputationTime, 404 NumberOfCodeBlocks, 404 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 512 ConstructedInterpolants, 0 QuantifiedInterpolants, 1808 SizeOfPredicates, 31 NumberOfNonLiveVariables, 740 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 7 InterpolantComputations, 5 PerfectInterpolantSequences, 1566/1568 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: 90]: Loop Invariant Derived loop invariant: ((((((((var_1_16 <= 1) && (var_1_17 <= 1)) && (var_1_17 >= 1)) && (var_1_9 == 50)) && (last_1_var_1_9 == 50)) && (var_1_16 >= 1)) && (k_loop == 1)) || (((((((((var_1_16 <= 1) && (0 == ((var_1_7 + 56) % 256))) && (var_1_17 <= 1)) && (var_1_17 >= 1)) && (var_1_9 == 50)) && (last_1_var_1_9 == 50)) && (var_1_16 >= 1)) && (k_loop == 0)) && (((last_1_var_1_7 + 56) % 256) == 0))) RESULT: Ultimate proved your program to be correct! [2023-12-16 13:53:18,350 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...