/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/loop-zilu/benchmark23_conjunctive.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 00:01:40,227 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 00:01:40,328 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-25 00:01:40,332 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 00:01:40,332 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 00:01:40,367 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 00:01:40,367 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 00:01:40,367 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 00:01:40,368 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 00:01:40,368 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 00:01:40,368 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 00:01:40,368 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 00:01:40,369 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 00:01:40,370 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 00:01:40,370 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 00:01:40,370 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 00:01:40,370 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 00:01:40,371 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 00:01:40,371 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 00:01:40,371 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 00:01:40,371 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 00:01:40,374 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 00:01:40,374 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 00:01:40,374 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 00:01:40,374 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 00:01:40,375 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 00:01:40,375 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 00:01:40,375 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 00:01:40,375 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 00:01:40,375 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 00:01:40,376 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 00:01:40,376 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 00:01:40,376 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 00:01:40,376 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 00:01:40,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 00:01:40,376 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 00:01:40,377 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 00:01:40,377 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 00:01:40,377 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 00:01:40,377 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 00:01:40,377 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 00:01:40,377 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 00:01:40,377 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 00:01:40,377 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 00:01:40,378 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 00:01:40,378 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 00:01:40,378 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-25 00:01:40,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 00:01:40,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 00:01:40,663 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 00:01:40,663 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 00:01:40,664 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 00:01:40,665 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark23_conjunctive.i [2023-12-25 00:01:42,205 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 00:01:42,398 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 00:01:42,398 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark23_conjunctive.i [2023-12-25 00:01:42,404 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/815c76b35/619ef1dc68354848985b17724740f8c7/FLAGc2a4cba08 [2023-12-25 00:01:42,417 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/815c76b35/619ef1dc68354848985b17724740f8c7 [2023-12-25 00:01:42,419 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 00:01:42,421 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 00:01:42,422 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 00:01:42,422 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 00:01:42,435 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 00:01:42,436 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 12:01:42" (1/1) ... [2023-12-25 00:01:42,436 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@730429d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:01:42, skipping insertion in model container [2023-12-25 00:01:42,437 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 12:01:42" (1/1) ... [2023-12-25 00:01:42,455 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 00:01:42,584 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark23_conjunctive.i[873,886] [2023-12-25 00:01:42,594 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 00:01:42,606 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 00:01:42,618 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark23_conjunctive.i[873,886] [2023-12-25 00:01:42,621 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 00:01:42,633 INFO L206 MainTranslator]: Completed translation [2023-12-25 00:01:42,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:01:42 WrapperNode [2023-12-25 00:01:42,634 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 00:01:42,635 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 00:01:42,635 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 00:01:42,635 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 00:01:42,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:01:42" (1/1) ... [2023-12-25 00:01:42,650 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:01:42" (1/1) ... [2023-12-25 00:01:42,662 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 31 [2023-12-25 00:01:42,662 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 00:01:42,663 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 00:01:42,663 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 00:01:42,663 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 00:01:42,669 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:01:42" (1/1) ... [2023-12-25 00:01:42,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:01:42" (1/1) ... [2023-12-25 00:01:42,673 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:01:42" (1/1) ... [2023-12-25 00:01:42,680 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-25 00:01:42,681 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:01:42" (1/1) ... [2023-12-25 00:01:42,681 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:01:42" (1/1) ... [2023-12-25 00:01:42,696 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:01:42" (1/1) ... [2023-12-25 00:01:42,698 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:01:42" (1/1) ... [2023-12-25 00:01:42,699 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:01:42" (1/1) ... [2023-12-25 00:01:42,699 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:01:42" (1/1) ... [2023-12-25 00:01:42,700 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 00:01:42,701 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 00:01:42,701 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 00:01:42,701 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 00:01:42,702 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:01:42" (1/1) ... [2023-12-25 00:01:42,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 00:01:42,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 00:01:42,730 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-25 00:01:42,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-25 00:01:42,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 00:01:42,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 00:01:42,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 00:01:42,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 00:01:42,811 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 00:01:42,813 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 00:01:42,896 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 00:01:42,923 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 00:01:42,923 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 00:01:42,924 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 12:01:42 BoogieIcfgContainer [2023-12-25 00:01:42,924 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 00:01:42,926 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 00:01:42,926 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 00:01:42,928 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 00:01:42,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 12:01:42" (1/3) ... [2023-12-25 00:01:42,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@217fb073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 12:01:42, skipping insertion in model container [2023-12-25 00:01:42,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:01:42" (2/3) ... [2023-12-25 00:01:42,930 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@217fb073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 12:01:42, skipping insertion in model container [2023-12-25 00:01:42,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 12:01:42" (3/3) ... [2023-12-25 00:01:42,931 INFO L112 eAbstractionObserver]: Analyzing ICFG benchmark23_conjunctive.i [2023-12-25 00:01:42,944 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 00:01:42,944 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 00:01:42,976 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 00:01:42,997 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;@b8762d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 00:01:42,997 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 00:01:43,000 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 9 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-25 00:01:43,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-25 00:01:43,009 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:01:43,009 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-25 00:01:43,010 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:01:43,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:01:43,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1839286506, now seen corresponding path program 1 times [2023-12-25 00:01:43,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:01:43,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1433492548] [2023-12-25 00:01:43,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:01:43,025 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 00:01:43,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:01:43,042 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 00:01:43,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-25 00:01:43,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:01:43,145 INFO L262 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 00:01:43,148 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:01:43,159 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-25 00:01:43,159 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 00:01:43,160 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:01:43,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1433492548] [2023-12-25 00:01:43,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1433492548] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 00:01:43,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 00:01:43,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 00:01:43,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253388959] [2023-12-25 00:01:43,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 00:01:43,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 00:01:43,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:01:43,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 00:01:43,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 00:01:43,191 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 9 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) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 00:01:43,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:01:43,220 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2023-12-25 00:01:43,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 00:01:43,222 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2023-12-25 00:01:43,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:01:43,227 INFO L225 Difference]: With dead ends: 17 [2023-12-25 00:01:43,228 INFO L226 Difference]: Without dead ends: 7 [2023-12-25 00:01:43,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 00:01:43,233 INFO L413 NwaCegarLoop]: 9 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, 9 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 00:01:43,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 00:01:43,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2023-12-25 00:01:43,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2023-12-25 00:01:43,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 00:01:43,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2023-12-25 00:01:43,254 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 6 [2023-12-25 00:01:43,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:01:43,254 INFO L495 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2023-12-25 00:01:43,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 00:01:43,255 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2023-12-25 00:01:43,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-25 00:01:43,255 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:01:43,255 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-25 00:01:43,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-25 00:01:43,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 00:01:43,457 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:01:43,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:01:43,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1839167342, now seen corresponding path program 1 times [2023-12-25 00:01:43,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:01:43,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1496049518] [2023-12-25 00:01:43,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:01:43,459 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 00:01:43,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:01:43,460 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 00:01:43,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-25 00:01:43,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:01:43,492 INFO L262 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 00:01:43,493 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:01:43,506 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-25 00:01:43,506 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 00:01:43,506 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:01:43,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1496049518] [2023-12-25 00:01:43,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1496049518] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 00:01:43,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 00:01:43,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 00:01:43,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786673153] [2023-12-25 00:01:43,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 00:01:43,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 00:01:43,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:01:43,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 00:01:43,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 00:01:43,509 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 00:01:43,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:01:43,522 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2023-12-25 00:01:43,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 00:01:43,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2023-12-25 00:01:43,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:01:43,522 INFO L225 Difference]: With dead ends: 12 [2023-12-25 00:01:43,523 INFO L226 Difference]: Without dead ends: 8 [2023-12-25 00:01:43,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-25 00:01:43,524 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 00:01:43,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 00:01:43,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2023-12-25 00:01:43,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2023-12-25 00:01:43,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 00:01:43,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2023-12-25 00:01:43,526 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2023-12-25 00:01:43,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:01:43,527 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2023-12-25 00:01:43,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 00:01:43,527 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2023-12-25 00:01:43,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-25 00:01:43,527 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:01:43,527 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:01:43,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-25 00:01:43,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 00:01:43,737 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:01:43,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:01:43,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1181278160, now seen corresponding path program 1 times [2023-12-25 00:01:43,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:01:43,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [716518283] [2023-12-25 00:01:43,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:01:43,738 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 00:01:43,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:01:43,745 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 00:01:43,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-25 00:01:43,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:01:43,795 INFO L262 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 00:01:43,796 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:01:43,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:01:43,820 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:01:43,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:01:43,844 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:01:43,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [716518283] [2023-12-25 00:01:43,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [716518283] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:01:43,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:01:43,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-25 00:01:43,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706243449] [2023-12-25 00:01:43,845 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:01:43,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 00:01:43,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:01:43,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 00:01:43,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-25 00:01:43,846 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 00:01:43,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:01:43,893 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2023-12-25 00:01:43,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 00:01:43,894 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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 7 [2023-12-25 00:01:43,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:01:43,895 INFO L225 Difference]: With dead ends: 15 [2023-12-25 00:01:43,895 INFO L226 Difference]: Without dead ends: 11 [2023-12-25 00:01:43,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-25 00:01:43,898 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 00:01:43,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 00:01:43,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2023-12-25 00:01:43,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2023-12-25 00:01:43,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 00:01:43,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2023-12-25 00:01:43,905 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2023-12-25 00:01:43,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:01:43,905 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2023-12-25 00:01:43,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 00:01:43,905 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2023-12-25 00:01:43,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-25 00:01:43,906 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:01:43,906 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2023-12-25 00:01:43,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-25 00:01:44,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 00:01:44,113 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:01:44,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:01:44,113 INFO L85 PathProgramCache]: Analyzing trace with hash 149389294, now seen corresponding path program 2 times [2023-12-25 00:01:44,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:01:44,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1106282347] [2023-12-25 00:01:44,114 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 00:01:44,114 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 00:01:44,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:01:44,115 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 00:01:44,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-25 00:01:44,178 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 00:01:44,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 00:01:44,179 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 00:01:44,180 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:01:44,232 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:01:44,233 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:01:44,333 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:01:44,333 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:01:44,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1106282347] [2023-12-25 00:01:44,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1106282347] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:01:44,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:01:44,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-12-25 00:01:44,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110624645] [2023-12-25 00:01:44,334 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:01:44,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-25 00:01:44,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:01:44,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-25 00:01:44,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-12-25 00:01:44,336 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 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-25 00:01:44,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:01:44,477 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2023-12-25 00:01:44,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 00:01:44,478 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 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) Word has length 10 [2023-12-25 00:01:44,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:01:44,478 INFO L225 Difference]: With dead ends: 21 [2023-12-25 00:01:44,478 INFO L226 Difference]: Without dead ends: 17 [2023-12-25 00:01:44,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2023-12-25 00:01:44,479 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 00:01:44,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 00:01:44,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-25 00:01:44,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-12-25 00:01:44,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 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-25 00:01:44,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2023-12-25 00:01:44,483 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 10 [2023-12-25 00:01:44,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:01:44,483 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2023-12-25 00:01:44,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 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-25 00:01:44,484 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2023-12-25 00:01:44,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-25 00:01:44,484 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:01:44,484 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2023-12-25 00:01:44,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-25 00:01:44,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 00:01:44,686 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:01:44,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:01:44,686 INFO L85 PathProgramCache]: Analyzing trace with hash 443815086, now seen corresponding path program 3 times [2023-12-25 00:01:44,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:01:44,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1895942629] [2023-12-25 00:01:44,687 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 00:01:44,687 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 00:01:44,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:01:44,688 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 00:01:44,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-25 00:01:44,722 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-12-25 00:01:44,722 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 00:01:44,723 INFO L262 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 00:01:44,725 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:01:44,828 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:01:44,828 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:01:45,194 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:01:45,195 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:01:45,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1895942629] [2023-12-25 00:01:45,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1895942629] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:01:45,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:01:45,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2023-12-25 00:01:45,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718608551] [2023-12-25 00:01:45,195 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:01:45,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-25 00:01:45,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:01:45,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-25 00:01:45,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2023-12-25 00:01:45,197 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 00:01:46,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:01:46,090 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2023-12-25 00:01:46,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-25 00:01:46,092 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 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 16 [2023-12-25 00:01:46,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:01:46,093 INFO L225 Difference]: With dead ends: 33 [2023-12-25 00:01:46,093 INFO L226 Difference]: Without dead ends: 29 [2023-12-25 00:01:46,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2023-12-25 00:01:46,095 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 00:01:46,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 00:01:46,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-25 00:01:46,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-12-25 00:01:46,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 00:01:46,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2023-12-25 00:01:46,108 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 16 [2023-12-25 00:01:46,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:01:46,113 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2023-12-25 00:01:46,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 00:01:46,114 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2023-12-25 00:01:46,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-25 00:01:46,114 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:01:46,114 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1] [2023-12-25 00:01:46,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-25 00:01:46,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 00:01:46,319 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:01:46,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:01:46,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1535217198, now seen corresponding path program 4 times [2023-12-25 00:01:46,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:01:46,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1773345224] [2023-12-25 00:01:46,320 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-25 00:01:46,320 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 00:01:46,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:01:46,325 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 00:01:46,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-25 00:01:46,370 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-25 00:01:46,370 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 00:01:46,372 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-25 00:01:46,375 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:01:46,729 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:01:46,730 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:01:48,222 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:01:48,223 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:01:48,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1773345224] [2023-12-25 00:01:48,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1773345224] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:01:48,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:01:48,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2023-12-25 00:01:48,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916230601] [2023-12-25 00:01:48,223 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:01:48,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-12-25 00:01:48,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:01:48,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-12-25 00:01:48,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2023-12-25 00:01:48,225 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 48 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 48 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 00:01:54,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:01:54,315 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2023-12-25 00:01:54,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-12-25 00:01:54,340 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 48 states have internal predecessors, (52), 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 28 [2023-12-25 00:01:54,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:01:54,340 INFO L225 Difference]: With dead ends: 57 [2023-12-25 00:01:54,340 INFO L226 Difference]: Without dead ends: 53 [2023-12-25 00:01:54,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2023-12-25 00:01:54,342 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 00:01:54,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 00:01:54,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-12-25 00:01:54,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-12-25 00:01:54,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 00:01:54,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2023-12-25 00:01:54,360 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 28 [2023-12-25 00:01:54,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:01:54,360 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2023-12-25 00:01:54,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 48 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 00:01:54,363 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2023-12-25 00:01:54,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-25 00:01:54,364 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:01:54,364 INFO L195 NwaCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1] [2023-12-25 00:01:54,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-12-25 00:01:54,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 00:01:54,568 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:01:54,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:01:54,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1220689618, now seen corresponding path program 5 times [2023-12-25 00:01:54,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:01:54,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [320948081] [2023-12-25 00:01:54,569 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-25 00:01:54,569 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 00:01:54,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:01:54,572 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 00:01:54,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-25 00:01:54,737 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2023-12-25 00:01:54,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 00:01:54,742 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 49 conjunts are in the unsatisfiable core [2023-12-25 00:01:54,745 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:01:56,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:01:56,023 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:02:02,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:02:02,472 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:02:02,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [320948081] [2023-12-25 00:02:02,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [320948081] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:02:02,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:02:02,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 96 [2023-12-25 00:02:02,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055716842] [2023-12-25 00:02:02,472 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:02:02,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2023-12-25 00:02:02,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:02:02,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2023-12-25 00:02:02,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2398, Invalid=6722, Unknown=0, NotChecked=0, Total=9120 [2023-12-25 00:02:02,477 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand has 96 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 96 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 00:02:49,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:02:49,592 INFO L93 Difference]: Finished difference Result 105 states and 152 transitions. [2023-12-25 00:02:49,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2023-12-25 00:02:49,592 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 96 states have internal predecessors, (100), 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 52 [2023-12-25 00:02:49,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:02:49,593 INFO L225 Difference]: With dead ends: 105 [2023-12-25 00:02:49,593 INFO L226 Difference]: Without dead ends: 101 [2023-12-25 00:02:49,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 52.8s TimeCoverageRelationStatistics Valid=6910, Invalid=13396, Unknown=0, NotChecked=0, Total=20306 [2023-12-25 00:02:49,597 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 138 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 2377 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 2424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 2377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-25 00:02:49,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 80 Invalid, 2424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 2377 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-25 00:02:49,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-12-25 00:02:49,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2023-12-25 00:02:49,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.01) internal successors, (101), 100 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 00:02:49,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2023-12-25 00:02:49,613 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 52 [2023-12-25 00:02:49,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:02:49,613 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2023-12-25 00:02:49,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 96 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 00:02:49,613 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2023-12-25 00:02:49,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-25 00:02:49,615 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:02:49,615 INFO L195 NwaCegarLoop]: trace histogram [94, 1, 1, 1, 1, 1, 1] [2023-12-25 00:02:49,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-25 00:02:49,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 00:02:49,816 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:02:49,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:02:49,816 INFO L85 PathProgramCache]: Analyzing trace with hash 465250094, now seen corresponding path program 6 times [2023-12-25 00:02:49,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:02:49,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1084266858] [2023-12-25 00:02:49,817 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-25 00:02:49,817 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 00:02:49,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:02:49,819 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 00:02:49,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-25 00:02:50,315 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) [2023-12-25 00:02:50,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 00:02:50,327 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 97 conjunts are in the unsatisfiable core [2023-12-25 00:02:50,332 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:02:53,728 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:02:53,729 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:03:09,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:03:09,849 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:03:09,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1084266858] [2023-12-25 00:03:09,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1084266858] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:03:09,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:03:09,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97] total 192 [2023-12-25 00:03:09,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024929975] [2023-12-25 00:03:09,849 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:03:09,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2023-12-25 00:03:09,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:03:09,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2023-12-25 00:03:09,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7886, Invalid=28786, Unknown=0, NotChecked=0, Total=36672 [2023-12-25 00:03:09,856 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand has 192 states, 192 states have (on average 1.0208333333333333) internal successors, (196), 192 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 00:09:15,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:09:15,062 INFO L93 Difference]: Finished difference Result 201 states and 296 transitions. [2023-12-25 00:09:15,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2023-12-25 00:09:15,062 INFO L78 Accepts]: Start accepts. Automaton has has 192 states, 192 states have (on average 1.0208333333333333) internal successors, (196), 192 states have internal predecessors, (196), 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 100 [2023-12-25 00:09:15,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:09:15,064 INFO L225 Difference]: With dead ends: 201 [2023-12-25 00:09:15,064 INFO L226 Difference]: Without dead ends: 197 [2023-12-25 00:09:15,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8914 ImplicationChecksByTransitivity, 381.8s TimeCoverageRelationStatistics Valid=21367, Invalid=60715, Unknown=0, NotChecked=0, Total=82082 [2023-12-25 00:09:15,070 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 299 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 3185 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 3285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 3185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-25 00:09:15,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 97 Invalid, 3285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 3185 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-25 00:09:15,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-12-25 00:09:15,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2023-12-25 00:09:15,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 1.010204081632653) internal successors, (198), 196 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 00:09:15,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2023-12-25 00:09:15,085 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 100 [2023-12-25 00:09:15,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:09:15,086 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2023-12-25 00:09:15,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 192 states, 192 states have (on average 1.0208333333333333) internal successors, (196), 192 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 00:09:15,086 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2023-12-25 00:09:15,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-25 00:09:15,087 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:09:15,087 INFO L195 NwaCegarLoop]: trace histogram [100, 1, 1, 1, 1, 1, 1] [2023-12-25 00:09:15,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-12-25 00:09:15,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 00:09:15,294 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:09:15,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:09:15,294 INFO L85 PathProgramCache]: Analyzing trace with hash -314749970, now seen corresponding path program 7 times [2023-12-25 00:09:15,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:09:15,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1383244782] [2023-12-25 00:09:15,295 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-25 00:09:15,295 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 00:09:15,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:09:15,296 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 00:09:15,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-25 00:09:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:09:15,422 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 104 conjunts are in the unsatisfiable core [2023-12-25 00:09:15,425 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:09:19,161 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:09:19,162 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:09:19,395 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:09:19,396 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:09:19,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1383244782] [2023-12-25 00:09:19,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1383244782] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:09:19,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:09:19,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104] total 105 [2023-12-25 00:09:19,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363605409] [2023-12-25 00:09:19,396 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:09:19,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 105 states [2023-12-25 00:09:19,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:09:19,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2023-12-25 00:09:19,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=10712, Unknown=0, NotChecked=0, Total=10920 [2023-12-25 00:09:19,398 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand has 105 states, 105 states have (on average 1.0285714285714285) internal successors, (108), 105 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 00:09:23,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:09:23,551 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2023-12-25 00:09:23,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2023-12-25 00:09:23,552 INFO L78 Accepts]: Start accepts. Automaton has has 105 states, 105 states have (on average 1.0285714285714285) internal successors, (108), 105 states have internal predecessors, (108), 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 106 [2023-12-25 00:09:23,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:09:23,553 INFO L225 Difference]: With dead ends: 201 [2023-12-25 00:09:23,553 INFO L226 Difference]: Without dead ends: 197 [2023-12-25 00:09:23,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=213, Invalid=10917, Unknown=0, NotChecked=0, Total=11130 [2023-12-25 00:09:23,554 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 1 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 10610 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 10610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2023-12-25 00:09:23,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 310 Invalid, 10610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10610 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2023-12-25 00:09:23,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-12-25 00:09:23,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2023-12-25 00:09:23,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 1.0051020408163265) internal successors, (197), 196 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 00:09:23,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2023-12-25 00:09:23,570 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 106 [2023-12-25 00:09:23,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:09:23,570 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2023-12-25 00:09:23,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 105 states, 105 states have (on average 1.0285714285714285) internal successors, (108), 105 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 00:09:23,570 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2023-12-25 00:09:23,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2023-12-25 00:09:23,572 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:09:23,572 INFO L195 NwaCegarLoop]: trace histogram [190, 1, 1, 1, 1, 1, 1] [2023-12-25 00:09:23,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-25 00:09:23,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 00:09:23,780 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:09:23,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:09:23,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1288303406, now seen corresponding path program 8 times [2023-12-25 00:09:23,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:09:23,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1202716496] [2023-12-25 00:09:23,781 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 00:09:23,781 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 00:09:23,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:09:23,782 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 00:09:23,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-25 00:09:24,008 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 00:09:24,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 00:09:24,024 INFO L262 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 102 conjunts are in the unsatisfiable core [2023-12-25 00:09:24,029 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:09:27,790 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 9090 proven. 5050 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2023-12-25 00:09:27,790 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:09:44,978 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 9090 proven. 5050 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2023-12-25 00:09:44,979 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:09:44,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1202716496] [2023-12-25 00:09:44,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1202716496] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:09:44,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:09:44,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103] total 204 [2023-12-25 00:09:44,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827418239] [2023-12-25 00:09:44,979 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:09:44,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 204 states [2023-12-25 00:09:44,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:09:44,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 204 interpolants. [2023-12-25 00:09:44,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5556, Invalid=35856, Unknown=0, NotChecked=0, Total=41412 [2023-12-25 00:09:44,983 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand has 204 states, 204 states have (on average 1.0294117647058822) internal successors, (210), 204 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 00:09:49,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:09:49,528 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2023-12-25 00:09:49,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2023-12-25 00:09:49,529 INFO L78 Accepts]: Start accepts. Automaton has has 204 states, 204 states have (on average 1.0294117647058822) internal successors, (210), 204 states have internal predecessors, (210), 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 196 [2023-12-25 00:09:49,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:09:49,530 INFO L225 Difference]: With dead ends: 197 [2023-12-25 00:09:49,530 INFO L226 Difference]: Without dead ends: 0 [2023-12-25 00:09:49,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=5556, Invalid=35856, Unknown=0, NotChecked=0, Total=41412 [2023-12-25 00:09:49,532 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10647 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 10647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-12-25 00:09:49,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 10647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10647 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2023-12-25 00:09:49,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-25 00:09:49,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-25 00:09:49,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 00:09:49,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-25 00:09:49,533 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 196 [2023-12-25 00:09:49,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:09:49,533 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-25 00:09:49,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 204 states, 204 states have (on average 1.0294117647058822) internal successors, (210), 204 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 00:09:49,533 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-25 00:09:49,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-25 00:09:49,535 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 00:09:49,545 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 (11)] Forceful destruction successful, exit code 0 [2023-12-25 00:09:49,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 00:09:49,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-25 00:09:50,673 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-25 00:09:50,675 INFO L895 garLoopResultBuilder]: At program point L23-2(lines 23 26) the Hoare annotation is: (or (and (= |ULTIMATE.start_main_~j~0#1| (_ bv96 32)) (= (_ bv48 32) |ULTIMATE.start_main_~i~0#1|)) (and (= |ULTIMATE.start_main_~j~0#1| (_ bv74 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv37 32))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv84 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv168 32))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv28 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv56 32))) (and (= |ULTIMATE.start_main_~j~0#1| (_ bv90 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv45 32))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv0 32))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv9 32)) (= (_ bv18 32) |ULTIMATE.start_main_~j~0#1|)) (and (= (_ bv4 32) |ULTIMATE.start_main_~j~0#1|) (= |ULTIMATE.start_main_~i~0#1| (_ bv2 32))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv12 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv24 32))) (and (= (_ bv98 32) |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~j~0#1| (_ bv196 32))) (and (= |ULTIMATE.start_main_~j~0#1| (_ bv42 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv21 32))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv54 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv108 32))) (and (= (_ bv82 32) |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~j~0#1| (_ bv164 32))) (and (= |ULTIMATE.start_main_~j~0#1| (_ bv144 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv72 32))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv40 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv80 32))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv3 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv6 32))) (and (= |ULTIMATE.start_main_~j~0#1| (_ bv172 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv86 32))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv81 32)) (= (_ bv162 32) |ULTIMATE.start_main_~j~0#1|)) (and (= (_ bv122 32) |ULTIMATE.start_main_~j~0#1|) (= |ULTIMATE.start_main_~i~0#1| (_ bv61 32))) (and (= (_ bv14 32) |ULTIMATE.start_main_~j~0#1|) (= |ULTIMATE.start_main_~i~0#1| (_ bv7 32))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv89 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv178 32))) (and (= |ULTIMATE.start_main_~j~0#1| (_ bv86 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv43 32))) (and (= |ULTIMATE.start_main_~j~0#1| (_ bv94 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv47 32))) (and (= (_ bv75 32) |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~j~0#1| (_ bv150 32))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv30 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv60 32))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv100 32)) (= (_ bv200 32) |ULTIMATE.start_main_~j~0#1|)) (and (= |ULTIMATE.start_main_~j~0#1| (_ bv130 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv65 32))) (and (= |ULTIMATE.start_main_~j~0#1| (_ bv118 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv59 32))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv32 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv64 32))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv77 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv154 32))) (and (= |ULTIMATE.start_main_~j~0#1| (_ bv138 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv69 32))) (and (= |ULTIMATE.start_main_~j~0#1| (_ bv76 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv38 32))) (and (= (_ bv82 32) |ULTIMATE.start_main_~j~0#1|) (= |ULTIMATE.start_main_~i~0#1| (_ bv41 32))) (and (= (_ bv36 32) |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~j~0#1| (_ bv72 32))) (and (= |ULTIMATE.start_main_~j~0#1| (_ bv68 32)) (= (_ bv34 32) |ULTIMATE.start_main_~i~0#1|)) (and (= |ULTIMATE.start_main_~j~0#1| (_ bv112 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv56 32))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv26 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv52 32))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv50 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv100 32))) (and (= |ULTIMATE.start_main_~j~0#1| (_ bv182 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv91 32))) (and (= |ULTIMATE.start_main_~j~0#1| (_ bv12 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv6 32))) (and (= |ULTIMATE.start_main_~j~0#1| (_ bv188 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv94 32))) (and (= (_ bv67 32) |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~j~0#1| (_ bv134 32))) (and (= (_ bv62 32) |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~j~0#1| (_ bv124 32))) (and (= (_ bv33 32) |ULTIMATE.start_main_~i~0#1|) (= (_ bv66 32) |ULTIMATE.start_main_~j~0#1|)) (and (= |ULTIMATE.start_main_~j~0#1| (_ bv10 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv5 32))) (and (= (_ bv14 32) |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~j~0#1| (_ bv28 32))) (and (= |ULTIMATE.start_main_~j~0#1| (_ bv104 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv52 32))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv60 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv120 32))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv29 32)) (= (_ bv58 32) |ULTIMATE.start_main_~j~0#1|)) (and (= |ULTIMATE.start_main_~j~0#1| (_ bv50 32)) (= (_ bv25 32) |ULTIMATE.start_main_~i~0#1|)) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv51 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv102 32))) (and (= (_ bv58 32) |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~j~0#1| (_ bv116 32))) (and (= |ULTIMATE.start_main_~j~0#1| (_ bv32 32)) (= (_ bv16 32) |ULTIMATE.start_main_~i~0#1|)) (and (= |ULTIMATE.start_main_~j~0#1| (_ bv38 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv19 32))) (and (= (_ bv176 32) |ULTIMATE.start_main_~j~0#1|) (= |ULTIMATE.start_main_~i~0#1| (_ bv88 32))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv11 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv22 32))) (and (= (_ bv55 32) |ULTIMATE.start_main_~i~0#1|) (= (_ bv110 32) |ULTIMATE.start_main_~j~0#1|)) (and (= |ULTIMATE.start_main_~j~0#1| (_ bv26 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv13 32))) (and (= (_ bv66 32) |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~j~0#1| (_ bv132 32))) (and (= (_ bv98 32) |ULTIMATE.start_main_~j~0#1|) (= (_ bv49 32) |ULTIMATE.start_main_~i~0#1|)) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv42 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv84 32))) (and (= (_ bv190 32) |ULTIMATE.start_main_~j~0#1|) (= (_ bv95 32) |ULTIMATE.start_main_~i~0#1|)) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv92 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv184 32))) (and (= |ULTIMATE.start_main_~j~0#1| (_ bv160 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv80 32))) (and (= |ULTIMATE.start_main_~j~0#1| (_ bv106 32)) (= (_ bv53 32) |ULTIMATE.start_main_~i~0#1|)) (and (= (_ bv70 32) |ULTIMATE.start_main_~j~0#1|) (= |ULTIMATE.start_main_~i~0#1| (_ bv35 32))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv24 32)) (= (_ bv48 32) |ULTIMATE.start_main_~j~0#1|)) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv27 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv54 32))) (and (= (_ bv36 32) |ULTIMATE.start_main_~j~0#1|) (= (_ bv18 32) |ULTIMATE.start_main_~i~0#1|)) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv31 32)) (= (_ bv62 32) |ULTIMATE.start_main_~j~0#1|)) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv71 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv142 32))) (and (= (_ bv85 32) |ULTIMATE.start_main_~i~0#1|) (= (_ bv170 32) |ULTIMATE.start_main_~j~0#1|)) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv46 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv92 32))) (and (= (_ bv156 32) |ULTIMATE.start_main_~j~0#1|) (= |ULTIMATE.start_main_~i~0#1| (_ bv78 32))) (and (= |ULTIMATE.start_main_~j~0#1| (_ bv148 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv74 32))) (and (= (_ bv180 32) |ULTIMATE.start_main_~j~0#1|) (= |ULTIMATE.start_main_~i~0#1| (_ bv90 32))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv20 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv40 32))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv44 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv88 32))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv68 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv136 32))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv64 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv128 32))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv23 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv46 32))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv2 32))) (and (= (_ bv34 32) |ULTIMATE.start_main_~j~0#1|) (= (_ bv17 32) |ULTIMATE.start_main_~i~0#1|)) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv39 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv78 32))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv8 32)) (= (_ bv16 32) |ULTIMATE.start_main_~j~0#1|)) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv22 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv44 32))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv15 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv30 32))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv10 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv20 32))) (and (= |ULTIMATE.start_main_~j~0#1| (_ bv140 32)) (= (_ bv70 32) |ULTIMATE.start_main_~i~0#1|)) (and (= |ULTIMATE.start_main_~j~0#1| (_ bv152 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv76 32))) (and (= |ULTIMATE.start_main_~j~0#1| (_ bv198 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv99 32))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv73 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv146 32))) (and (= |ULTIMATE.start_main_~j~0#1| (_ bv192 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv96 32))) (and (= |ULTIMATE.start_main_~j~0#1| (_ bv194 32)) (= (_ bv97 32) |ULTIMATE.start_main_~i~0#1|)) (and (= |ULTIMATE.start_main_~j~0#1| (_ bv8 32)) (= (_ bv4 32) |ULTIMATE.start_main_~i~0#1|)) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv63 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv126 32))) (and (= |ULTIMATE.start_main_~j~0#1| (_ bv166 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv83 32))) (and (= |ULTIMATE.start_main_~j~0#1| (_ bv174 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv87 32))) (and (= |ULTIMATE.start_main_~j~0#1| (_ bv114 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv57 32))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv93 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv186 32))) (and (= |ULTIMATE.start_main_~j~0#1| (_ bv158 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv79 32)))) [2023-12-25 00:09:50,675 INFO L899 garLoopResultBuilder]: For program point L23-3(lines 23 26) no Hoare annotation was computed. [2023-12-25 00:09:50,675 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 17) no Hoare annotation was computed. [2023-12-25 00:09:50,675 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-25 00:09:50,675 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 19 29) no Hoare annotation was computed. [2023-12-25 00:09:50,675 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2023-12-25 00:09:50,675 INFO L899 garLoopResultBuilder]: For program point L22(line 22) no Hoare annotation was computed. [2023-12-25 00:09:50,675 INFO L899 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2023-12-25 00:09:50,675 INFO L899 garLoopResultBuilder]: For program point L14(lines 14 18) no Hoare annotation was computed. [2023-12-25 00:09:50,677 INFO L445 BasicCegarLoop]: Path program histogram: [8, 1, 1] [2023-12-25 00:09:50,678 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 00:09:50,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 12:09:50 BoogieIcfgContainer [2023-12-25 00:09:50,697 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 00:09:50,697 INFO L158 Benchmark]: Toolchain (without parser) took 488276.58ms. Allocated memory is still 262.1MB. Free memory was 206.2MB in the beginning and 72.8MB in the end (delta: 133.4MB). Peak memory consumption was 154.4MB. Max. memory is 8.0GB. [2023-12-25 00:09:50,698 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 189.8MB. Free memory is still 137.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 00:09:50,698 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.76ms. Allocated memory is still 262.1MB. Free memory was 205.7MB in the beginning and 194.6MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-25 00:09:50,698 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.62ms. Allocated memory is still 262.1MB. Free memory was 194.6MB in the beginning and 193.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 00:09:50,698 INFO L158 Benchmark]: Boogie Preprocessor took 37.55ms. Allocated memory is still 262.1MB. Free memory was 193.6MB in the beginning and 191.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 00:09:50,698 INFO L158 Benchmark]: RCFGBuilder took 222.96ms. Allocated memory is still 262.1MB. Free memory was 191.5MB in the beginning and 181.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-25 00:09:50,698 INFO L158 Benchmark]: TraceAbstraction took 487771.49ms. Allocated memory is still 262.1MB. Free memory was 180.5MB in the beginning and 72.8MB in the end (delta: 107.7MB). Peak memory consumption was 128.2MB. Max. memory is 8.0GB. [2023-12-25 00:09:50,699 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 189.8MB. Free memory is still 137.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 211.76ms. Allocated memory is still 262.1MB. Free memory was 205.7MB in the beginning and 194.6MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.62ms. Allocated memory is still 262.1MB. Free memory was 194.6MB in the beginning and 193.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.55ms. Allocated memory is still 262.1MB. Free memory was 193.6MB in the beginning and 191.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 222.96ms. Allocated memory is still 262.1MB. Free memory was 191.5MB in the beginning and 181.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 487771.49ms. Allocated memory is still 262.1MB. Free memory was 180.5MB in the beginning and 72.8MB in the end (delta: 107.7MB). Peak memory consumption was 128.2MB. 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: 16]: 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, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 487.7s, OverallIterations: 10, TraceHistogramMax: 190, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 428.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 438 SdHoareTripleChecker+Valid, 12.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 438 mSDsluCounter, 654 SdHoareTripleChecker+Invalid, 10.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 606 mSDsCounter, 151 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27677 IncrementalHoareTripleChecker+Invalid, 27828 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 151 mSolverCounterUnsat, 48 mSDtfsCounter, 27677 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1204 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 852 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10277 ImplicationChecksByTransitivity, 467.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=197occurred in iteration=8, InterpolantAutomatonStates: 592, 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, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 102 NumberOfFragments, 708 HoareAnnotationTreeSize, 1 FormulaSimplifications, 1144 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 1 FormulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 54.8s InterpolantComputationTime, 527 NumberOfCodeBlocks, 527 NumberOfCodeBlocksAsserted, 87 NumberOfCheckSat, 1024 ConstructedInterpolants, 0 QuantifiedInterpolants, 4080 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1571 ConjunctsInSsa, 400 ConjunctsInUnsatCore, 18 InterpolantComputations, 2 PerfectInterpolantSequences, 26190/58120 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: 23]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((j == 96) && (48 == i)) || ((j == 74) && (i == 37))) || ((i == 84) && (j == 168))) || ((i == 28) && (j == 56))) || ((j == 90) && (i == 45))) || ((i == 0) && (j == 0))) || ((i == 9) && (18 == j))) || ((4 == j) && (i == 2))) || ((i == 12) && (j == 24))) || ((98 == i) && (j == 196))) || ((j == 42) && (i == 21))) || ((i == 54) && (j == 108))) || ((82 == i) && (j == 164))) || ((j == 144) && (i == 72))) || ((i == 40) && (j == 80))) || ((i == 3) && (j == 6))) || ((j == 172) && (i == 86))) || ((i == 81) && (162 == j))) || ((122 == j) && (i == 61))) || ((14 == j) && (i == 7))) || ((i == 89) && (j == 178))) || ((j == 86) && (i == 43))) || ((j == 94) && (i == 47))) || ((75 == i) && (j == 150))) || ((i == 30) && (j == 60))) || ((i == 100) && (200 == j))) || ((j == 130) && (i == 65))) || ((j == 118) && (i == 59))) || ((i == 32) && (j == 64))) || ((i == 77) && (j == 154))) || ((j == 138) && (i == 69))) || ((j == 76) && (i == 38))) || ((82 == j) && (i == 41))) || ((36 == i) && (j == 72))) || ((j == 68) && (34 == i))) || ((j == 112) && (i == 56))) || ((i == 26) && (j == 52))) || ((i == 50) && (j == 100))) || ((j == 182) && (i == 91))) || ((j == 12) && (i == 6))) || ((j == 188) && (i == 94))) || ((67 == i) && (j == 134))) || ((62 == i) && (j == 124))) || ((33 == i) && (66 == j))) || ((j == 10) && (i == 5))) || ((14 == i) && (j == 28))) || ((j == 104) && (i == 52))) || ((i == 60) && (j == 120))) || ((i == 29) && (58 == j))) || ((j == 50) && (25 == i))) || ((i == 51) && (j == 102))) || ((58 == i) && (j == 116))) || ((j == 32) && (16 == i))) || ((j == 38) && (i == 19))) || ((176 == j) && (i == 88))) || ((i == 11) && (j == 22))) || ((55 == i) && (110 == j))) || ((j == 26) && (i == 13))) || ((66 == i) && (j == 132))) || ((98 == j) && (49 == i))) || ((i == 42) && (j == 84))) || ((190 == j) && (95 == i))) || ((i == 92) && (j == 184))) || ((j == 160) && (i == 80))) || ((j == 106) && (53 == i))) || ((70 == j) && (i == 35))) || ((i == 24) && (48 == j))) || ((i == 27) && (j == 54))) || ((36 == j) && (18 == i))) || ((i == 31) && (62 == j))) || ((i == 71) && (j == 142))) || ((85 == i) && (170 == j))) || ((i == 46) && (j == 92))) || ((156 == j) && (i == 78))) || ((j == 148) && (i == 74))) || ((180 == j) && (i == 90))) || ((i == 20) && (j == 40))) || ((i == 44) && (j == 88))) || ((i == 68) && (j == 136))) || ((i == 64) && (j == 128))) || ((i == 23) && (j == 46))) || ((i == 1) && (j == 2))) || ((34 == j) && (17 == i))) || ((i == 39) && (j == 78))) || ((i == 8) && (16 == j))) || ((i == 22) && (j == 44))) || ((i == 15) && (j == 30))) || ((i == 10) && (j == 20))) || ((j == 140) && (70 == i))) || ((j == 152) && (i == 76))) || ((j == 198) && (i == 99))) || ((i == 73) && (j == 146))) || ((j == 192) && (i == 96))) || ((j == 194) && (97 == i))) || ((j == 8) && (4 == i))) || ((i == 63) && (j == 126))) || ((j == 166) && (i == 83))) || ((j == 174) && (i == 87))) || ((j == 114) && (i == 57))) || ((i == 93) && (j == 186))) || ((j == 158) && (i == 79))) RESULT: Ultimate proved your program to be correct! [2023-12-25 00:09:50,729 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...