/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_normal_file-90.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 12:39:36,809 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 12:39:36,875 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-24 12:39:36,879 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 12:39:36,879 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 12:39:36,900 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 12:39:36,901 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 12:39:36,901 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 12:39:36,901 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 12:39:36,904 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 12:39:36,904 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 12:39:36,905 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 12:39:36,905 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 12:39:36,906 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 12:39:36,906 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 12:39:36,907 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 12:39:36,907 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 12:39:36,907 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 12:39:36,907 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 12:39:36,907 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 12:39:36,908 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 12:39:36,908 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 12:39:36,908 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 12:39:36,908 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 12:39:36,908 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 12:39:36,909 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 12:39:36,909 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 12:39:36,909 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 12:39:36,909 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 12:39:36,909 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 12:39:36,910 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 12:39:36,910 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 12:39:36,910 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 12:39:36,910 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 12:39:36,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 12:39:36,911 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 12:39:36,911 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 12:39:36,911 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 12:39:36,911 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 12:39:36,911 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 12:39:36,911 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 12:39:36,912 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 12:39:36,912 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 12:39:36,912 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 12:39:36,912 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 12:39:36,912 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 12:39:36,912 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-24 12:39:37,111 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 12:39:37,140 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 12:39:37,142 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 12:39:37,143 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 12:39:37,143 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 12:39:37,144 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_normal_file-90.i [2023-12-24 12:39:38,255 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 12:39:38,474 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 12:39:38,474 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_normal_file-90.i [2023-12-24 12:39:38,484 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef78fe546/1eed877ad9a24dc1864df67c71be1ba7/FLAG847576379 [2023-12-24 12:39:38,498 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef78fe546/1eed877ad9a24dc1864df67c71be1ba7 [2023-12-24 12:39:38,500 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 12:39:38,501 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 12:39:38,502 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 12:39:38,502 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 12:39:38,505 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 12:39:38,506 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 12:39:38" (1/1) ... [2023-12-24 12:39:38,506 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a4f4ac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:39:38, skipping insertion in model container [2023-12-24 12:39:38,507 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 12:39:38" (1/1) ... [2023-12-24 12:39:38,526 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 12:39:38,630 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_normal_file-90.i[913,926] [2023-12-24 12:39:38,669 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 12:39:38,682 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 12:39:38,695 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_normal_file-90.i[913,926] [2023-12-24 12:39:38,711 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 12:39:38,723 INFO L206 MainTranslator]: Completed translation [2023-12-24 12:39:38,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:39:38 WrapperNode [2023-12-24 12:39:38,724 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 12:39:38,724 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 12:39:38,725 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 12:39:38,725 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 12:39:38,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:39:38" (1/1) ... [2023-12-24 12:39:38,736 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:39:38" (1/1) ... [2023-12-24 12:39:38,751 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 123 [2023-12-24 12:39:38,751 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 12:39:38,751 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 12:39:38,751 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 12:39:38,751 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 12:39:38,758 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:39:38" (1/1) ... [2023-12-24 12:39:38,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:39:38" (1/1) ... [2023-12-24 12:39:38,760 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:39:38" (1/1) ... [2023-12-24 12:39:38,771 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-24 12:39:38,771 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:39:38" (1/1) ... [2023-12-24 12:39:38,771 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:39:38" (1/1) ... [2023-12-24 12:39:38,780 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:39:38" (1/1) ... [2023-12-24 12:39:38,782 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:39:38" (1/1) ... [2023-12-24 12:39:38,783 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:39:38" (1/1) ... [2023-12-24 12:39:38,784 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:39:38" (1/1) ... [2023-12-24 12:39:38,786 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 12:39:38,786 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 12:39:38,786 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 12:39:38,786 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 12:39:38,787 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:39:38" (1/1) ... [2023-12-24 12:39:38,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 12:39:38,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 12:39:38,829 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-24 12:39:38,833 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-24 12:39:38,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 12:39:38,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 12:39:38,853 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 12:39:38,854 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 12:39:38,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 12:39:38,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 12:39:38,912 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 12:39:38,914 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 12:39:39,084 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 12:39:39,126 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 12:39:39,127 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 12:39:39,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 12:39:39 BoogieIcfgContainer [2023-12-24 12:39:39,127 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 12:39:39,129 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 12:39:39,129 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 12:39:39,132 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 12:39:39,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 12:39:38" (1/3) ... [2023-12-24 12:39:39,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1336d382 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 12:39:39, skipping insertion in model container [2023-12-24 12:39:39,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:39:38" (2/3) ... [2023-12-24 12:39:39,134 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1336d382 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 12:39:39, skipping insertion in model container [2023-12-24 12:39:39,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 12:39:39" (3/3) ... [2023-12-24 12:39:39,135 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-90.i [2023-12-24 12:39:39,147 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 12:39:39,147 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 12:39:39,176 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 12:39:39,180 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;@66b25e82, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 12:39:39,180 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 12:39:39,182 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 12:39:39,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-24 12:39:39,190 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:39:39,191 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 12:39:39,191 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:39:39,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:39:39,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1356584365, now seen corresponding path program 1 times [2023-12-24 12:39:39,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:39:39,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1002708830] [2023-12-24 12:39:39,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:39:39,204 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-24 12:39:39,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:39:39,205 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-24 12:39:39,210 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-24 12:39:39,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:39:39,347 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 12:39:39,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:39:39,395 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2023-12-24 12:39:39,395 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 12:39:39,395 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:39:39,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1002708830] [2023-12-24 12:39:39,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1002708830] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 12:39:39,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 12:39:39,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 12:39:39,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107594175] [2023-12-24 12:39:39,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:39:39,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 12:39:39,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:39:39,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 12:39:39,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 12:39:39,420 INFO L87 Difference]: Start difference. First operand has 51 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 12:39:39,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:39:39,453 INFO L93 Difference]: Finished difference Result 99 states and 178 transitions. [2023-12-24 12:39:39,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 12:39:39,458 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 120 [2023-12-24 12:39:39,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:39:39,463 INFO L225 Difference]: With dead ends: 99 [2023-12-24 12:39:39,463 INFO L226 Difference]: Without dead ends: 49 [2023-12-24 12:39:39,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 119 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-24 12:39:39,467 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 12:39:39,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 12:39:39,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-24 12:39:39,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-12-24 12:39:39,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 12:39:39,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 75 transitions. [2023-12-24 12:39:39,501 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 75 transitions. Word has length 120 [2023-12-24 12:39:39,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:39:39,502 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 75 transitions. [2023-12-24 12:39:39,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 12:39:39,502 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 75 transitions. [2023-12-24 12:39:39,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-24 12:39:39,504 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:39:39,504 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 12:39:39,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-24 12:39:39,714 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-24 12:39:39,714 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:39:39,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:39:39,715 INFO L85 PathProgramCache]: Analyzing trace with hash -997376595, now seen corresponding path program 1 times [2023-12-24 12:39:39,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:39:39,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [133965064] [2023-12-24 12:39:39,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:39:39,716 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-24 12:39:39,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:39:39,717 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-24 12:39:39,718 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-24 12:39:39,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:39:39,815 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 12:39:39,820 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:39:40,194 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 295 proven. 18 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2023-12-24 12:39:40,194 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 12:39:40,410 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 90 proven. 21 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2023-12-24 12:39:40,411 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:39:40,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [133965064] [2023-12-24 12:39:40,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [133965064] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 12:39:40,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 12:39:40,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2023-12-24 12:39:40,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421696437] [2023-12-24 12:39:40,416 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 12:39:40,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-24 12:39:40,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:39:40,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-24 12:39:40,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2023-12-24 12:39:40,420 INFO L87 Difference]: Start difference. First operand 49 states and 75 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 3 states have call successors, (24), 3 states have call predecessors, (24), 6 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2023-12-24 12:39:40,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:39:40,929 INFO L93 Difference]: Finished difference Result 169 states and 243 transitions. [2023-12-24 12:39:40,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-24 12:39:40,930 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 3 states have call successors, (24), 3 states have call predecessors, (24), 6 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 120 [2023-12-24 12:39:40,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:39:40,932 INFO L225 Difference]: With dead ends: 169 [2023-12-24 12:39:40,932 INFO L226 Difference]: Without dead ends: 121 [2023-12-24 12:39:40,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 228 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=297, Invalid=695, Unknown=0, NotChecked=0, Total=992 [2023-12-24 12:39:40,949 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 179 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 12:39:40,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 169 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 12:39:40,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-12-24 12:39:40,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 59. [2023-12-24 12:39:40,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 12:39:40,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 83 transitions. [2023-12-24 12:39:40,974 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 83 transitions. Word has length 120 [2023-12-24 12:39:40,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:39:40,974 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 83 transitions. [2023-12-24 12:39:40,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 3 states have call successors, (24), 3 states have call predecessors, (24), 6 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2023-12-24 12:39:40,975 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 83 transitions. [2023-12-24 12:39:40,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-24 12:39:40,976 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:39:40,976 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 12:39:40,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-24 12:39:41,177 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-24 12:39:41,177 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:39:41,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:39:41,178 INFO L85 PathProgramCache]: Analyzing trace with hash -997317013, now seen corresponding path program 1 times [2023-12-24 12:39:41,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:39:41,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [71942560] [2023-12-24 12:39:41,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:39:41,179 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-24 12:39:41,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:39:41,180 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-24 12:39:41,192 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-24 12:39:41,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:39:41,261 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-24 12:39:41,266 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:39:46,859 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 295 proven. 18 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2023-12-24 12:39:46,860 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 12:40:11,756 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 90 proven. 21 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2023-12-24 12:40:11,758 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:40:11,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [71942560] [2023-12-24 12:40:11,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [71942560] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 12:40:11,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 12:40:11,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2023-12-24 12:40:11,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421208494] [2023-12-24 12:40:11,775 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 12:40:11,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-24 12:40:11,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:40:11,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-24 12:40:11,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=329, Unknown=0, NotChecked=0, Total=462 [2023-12-24 12:40:11,777 INFO L87 Difference]: Start difference. First operand 59 states and 83 transitions. Second operand has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 states have internal predecessors, (45), 3 states have call successors, (24), 3 states have call predecessors, (24), 6 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2023-12-24 12:40:14,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:40:14,128 INFO L93 Difference]: Finished difference Result 104 states and 136 transitions. [2023-12-24 12:40:14,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-24 12:40:14,130 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 states have internal predecessors, (45), 3 states have call successors, (24), 3 states have call predecessors, (24), 6 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 120 [2023-12-24 12:40:14,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:40:14,131 INFO L225 Difference]: With dead ends: 104 [2023-12-24 12:40:14,131 INFO L226 Difference]: Without dead ends: 102 [2023-12-24 12:40:14,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 217 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=382, Invalid=1024, Unknown=0, NotChecked=0, Total=1406 [2023-12-24 12:40:14,133 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 156 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-24 12:40:14,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 309 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-24 12:40:14,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-12-24 12:40:14,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 89. [2023-12-24 12:40:14,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 55 states have (on average 1.2) internal successors, (66), 56 states have internal predecessors, (66), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-24 12:40:14,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 122 transitions. [2023-12-24 12:40:14,143 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 122 transitions. Word has length 120 [2023-12-24 12:40:14,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:40:14,144 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 122 transitions. [2023-12-24 12:40:14,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 states have internal predecessors, (45), 3 states have call successors, (24), 3 states have call predecessors, (24), 6 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2023-12-24 12:40:14,144 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 122 transitions. [2023-12-24 12:40:14,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-24 12:40:14,145 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:40:14,145 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 12:40:14,150 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-24 12:40:14,349 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-24 12:40:14,350 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:40:14,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:40:14,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1054634897, now seen corresponding path program 1 times [2023-12-24 12:40:14,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:40:14,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2050865569] [2023-12-24 12:40:14,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:40:14,352 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-24 12:40:14,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:40:14,353 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-24 12:40:14,363 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-24 12:40:14,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:40:14,412 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-24 12:40:14,415 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:40:43,273 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 12:40:43,274 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 12:40:43,274 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:40:43,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2050865569] [2023-12-24 12:40:43,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2050865569] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 12:40:43,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 12:40:43,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-24 12:40:43,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925016778] [2023-12-24 12:40:43,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:40:43,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 12:40:43,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:40:43,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 12:40:43,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-12-24 12:40:43,275 INFO L87 Difference]: Start difference. First operand 89 states and 122 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 12:40:43,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:40:43,495 INFO L93 Difference]: Finished difference Result 100 states and 132 transitions. [2023-12-24 12:40:43,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 12:40:43,496 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 120 [2023-12-24 12:40:43,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:40:43,497 INFO L225 Difference]: With dead ends: 100 [2023-12-24 12:40:43,497 INFO L226 Difference]: Without dead ends: 98 [2023-12-24 12:40:43,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2023-12-24 12:40:43,498 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 89 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 12:40:43,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 285 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 12:40:43,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-24 12:40:43,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 89. [2023-12-24 12:40:43,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 55 states have (on average 1.2) internal successors, (66), 56 states have internal predecessors, (66), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-24 12:40:43,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 122 transitions. [2023-12-24 12:40:43,533 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 122 transitions. Word has length 120 [2023-12-24 12:40:43,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:40:43,534 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 122 transitions. [2023-12-24 12:40:43,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 12:40:43,534 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 122 transitions. [2023-12-24 12:40:43,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-24 12:40:43,535 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:40:43,535 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 12:40:43,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-24 12:40:43,742 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-24 12:40:43,742 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:40:43,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:40:43,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1054575315, now seen corresponding path program 1 times [2023-12-24 12:40:43,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:40:43,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1577542979] [2023-12-24 12:40:43,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:40:43,744 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-24 12:40:43,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:40:43,746 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-24 12:40:43,746 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-24 12:40:43,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:40:43,802 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 12:40:43,804 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:40:43,853 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 289 proven. 12 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2023-12-24 12:40:43,854 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 12:40:43,976 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 45 proven. 12 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2023-12-24 12:40:43,976 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:40:43,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1577542979] [2023-12-24 12:40:43,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1577542979] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 12:40:43,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 12:40:43,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2023-12-24 12:40:43,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118424451] [2023-12-24 12:40:43,977 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 12:40:43,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-24 12:40:43,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:40:43,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-24 12:40:43,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-12-24 12:40:43,979 INFO L87 Difference]: Start difference. First operand 89 states and 122 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-12-24 12:40:44,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:40:44,315 INFO L93 Difference]: Finished difference Result 269 states and 364 transitions. [2023-12-24 12:40:44,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-24 12:40:44,315 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 120 [2023-12-24 12:40:44,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:40:44,318 INFO L225 Difference]: With dead ends: 269 [2023-12-24 12:40:44,318 INFO L226 Difference]: Without dead ends: 181 [2023-12-24 12:40:44,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 231 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2023-12-24 12:40:44,319 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 149 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 12:40:44,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 239 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 12:40:44,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-12-24 12:40:44,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 87. [2023-12-24 12:40:44,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 53 states have (on average 1.150943396226415) internal successors, (61), 54 states have internal predecessors, (61), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-24 12:40:44,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 117 transitions. [2023-12-24 12:40:44,330 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 117 transitions. Word has length 120 [2023-12-24 12:40:44,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:40:44,331 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 117 transitions. [2023-12-24 12:40:44,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-12-24 12:40:44,331 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 117 transitions. [2023-12-24 12:40:44,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-24 12:40:44,332 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:40:44,332 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 12:40:44,336 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-24 12:40:44,536 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-24 12:40:44,537 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:40:44,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:40:44,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1148650595, now seen corresponding path program 1 times [2023-12-24 12:40:44,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:40:44,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [583786514] [2023-12-24 12:40:44,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:40:44,538 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-24 12:40:44,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:40:44,539 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-24 12:40:44,543 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-24 12:40:44,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:40:44,629 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-24 12:40:44,631 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:40:49,641 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 295 proven. 18 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2023-12-24 12:40:49,643 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 12:41:17,489 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 90 proven. 21 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2023-12-24 12:41:17,490 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:41:17,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [583786514] [2023-12-24 12:41:17,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [583786514] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 12:41:17,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 12:41:17,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2023-12-24 12:41:17,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534265559] [2023-12-24 12:41:17,491 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 12:41:17,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-24 12:41:17,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:41:17,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-24 12:41:17,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2023-12-24 12:41:17,493 INFO L87 Difference]: Start difference. First operand 87 states and 117 transitions. Second operand has 21 states, 21 states have (on average 2.142857142857143) internal successors, (45), 21 states have internal predecessors, (45), 3 states have call successors, (24), 3 states have call predecessors, (24), 6 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2023-12-24 12:41:31,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:41:31,399 INFO L93 Difference]: Finished difference Result 159 states and 209 transitions. [2023-12-24 12:41:31,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-12-24 12:41:31,400 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.142857142857143) internal successors, (45), 21 states have internal predecessors, (45), 3 states have call successors, (24), 3 states have call predecessors, (24), 6 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 121 [2023-12-24 12:41:31,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:41:31,401 INFO L225 Difference]: With dead ends: 159 [2023-12-24 12:41:31,401 INFO L226 Difference]: Without dead ends: 157 [2023-12-24 12:41:31,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 220 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=461, Invalid=1261, Unknown=0, NotChecked=0, Total=1722 [2023-12-24 12:41:31,403 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 150 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2023-12-24 12:41:31,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 314 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2023-12-24 12:41:31,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-12-24 12:41:31,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 89. [2023-12-24 12:41:31,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 56 states have internal predecessors, (63), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-24 12:41:31,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 119 transitions. [2023-12-24 12:41:31,430 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 119 transitions. Word has length 121 [2023-12-24 12:41:31,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:41:31,430 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 119 transitions. [2023-12-24 12:41:31,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.142857142857143) internal successors, (45), 21 states have internal predecessors, (45), 3 states have call successors, (24), 3 states have call predecessors, (24), 6 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2023-12-24 12:41:31,431 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 119 transitions. [2023-12-24 12:41:31,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-24 12:41:31,440 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:41:31,440 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 12:41:31,446 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-24 12:41:31,644 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-24 12:41:31,647 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:41:31,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:41:31,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1091332711, now seen corresponding path program 1 times [2023-12-24 12:41:31,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:41:31,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [358914007] [2023-12-24 12:41:31,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:41:31,649 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-24 12:41:31,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:41:31,650 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-24 12:41:31,653 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-24 12:41:31,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:41:31,707 INFO L262 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-24 12:41:31,710 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:41:59,827 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 12:41:59,827 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 12:41:59,827 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:41:59,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [358914007] [2023-12-24 12:41:59,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [358914007] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 12:41:59,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 12:41:59,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-24 12:41:59,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184650018] [2023-12-24 12:41:59,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:41:59,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 12:41:59,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:41:59,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 12:41:59,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-12-24 12:41:59,830 INFO L87 Difference]: Start difference. First operand 89 states and 119 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 12:42:00,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:42:00,308 INFO L93 Difference]: Finished difference Result 123 states and 163 transitions. [2023-12-24 12:42:00,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 12:42:00,308 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 121 [2023-12-24 12:42:00,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:42:00,309 INFO L225 Difference]: With dead ends: 123 [2023-12-24 12:42:00,309 INFO L226 Difference]: Without dead ends: 121 [2023-12-24 12:42:00,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2023-12-24 12:42:00,310 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 78 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-24 12:42:00,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 307 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-24 12:42:00,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-12-24 12:42:00,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 92. [2023-12-24 12:42:00,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 58 states have (on average 1.1551724137931034) internal successors, (67), 59 states have internal predecessors, (67), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-24 12:42:00,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 123 transitions. [2023-12-24 12:42:00,328 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 123 transitions. Word has length 121 [2023-12-24 12:42:00,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:42:00,329 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 123 transitions. [2023-12-24 12:42:00,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 12:42:00,329 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 123 transitions. [2023-12-24 12:42:00,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-24 12:42:00,330 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:42:00,330 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 12:42:00,336 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-24 12:42:00,530 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-24 12:42:00,533 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:42:00,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:42:00,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1428627223, now seen corresponding path program 1 times [2023-12-24 12:42:00,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:42:00,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [636517512] [2023-12-24 12:42:00,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:42:00,534 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 12:42:00,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:42:00,535 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-24 12:42:00,549 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-24 12:42:00,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:42:00,590 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-24 12:42:00,592 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:42:27,775 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 12:42:27,777 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 12:42:27,780 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:42:27,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [636517512] [2023-12-24 12:42:27,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [636517512] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 12:42:27,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 12:42:27,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-24 12:42:27,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299460040] [2023-12-24 12:42:27,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:42:27,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 12:42:27,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:42:27,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 12:42:27,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-12-24 12:42:27,783 INFO L87 Difference]: Start difference. First operand 92 states and 123 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 12:42:28,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:42:28,028 INFO L93 Difference]: Finished difference Result 119 states and 159 transitions. [2023-12-24 12:42:28,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 12:42:28,028 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 121 [2023-12-24 12:42:28,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:42:28,029 INFO L225 Difference]: With dead ends: 119 [2023-12-24 12:42:28,029 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 12:42:28,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2023-12-24 12:42:28,035 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 82 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 12:42:28,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 289 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 12:42:28,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 12:42:28,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 12:42:28,036 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-24 12:42:28,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 12:42:28,036 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 121 [2023-12-24 12:42:28,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:42:28,037 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 12:42:28,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 12:42:28,037 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 12:42:28,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 12:42:28,042 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 12:42:28,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-24 12:42:28,247 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-24 12:42:28,249 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 12:42:50,982 WARN L293 SmtUtils]: Spent 5.00s on a formula simplification. DAG size of input: 329 DAG size of output: 1 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 12:42:54,875 INFO L895 garLoopResultBuilder]: At program point L93(line 93) the Hoare annotation is: (and (bvsge ((_ zero_extend 24) ~var_1_13~0) (_ bv1 32)) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32))) [2023-12-24 12:42:54,875 INFO L895 garLoopResultBuilder]: At program point L93-1(line 93) the Hoare annotation is: (and (bvsge ((_ zero_extend 24) ~var_1_13~0) (_ bv1 32)) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32))) [2023-12-24 12:42:54,875 INFO L899 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2023-12-24 12:42:54,876 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-24 12:42:54,876 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-24 12:42:54,876 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-24 12:42:54,876 INFO L895 garLoopResultBuilder]: At program point L102(line 102) the Hoare annotation is: (and (bvsge ((_ zero_extend 24) ~var_1_13~0) (_ bv1 32)) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32))) [2023-12-24 12:42:54,876 INFO L895 garLoopResultBuilder]: At program point L102-1(line 102) the Hoare annotation is: (and (bvsge ((_ zero_extend 24) ~var_1_13~0) (_ bv1 32)) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32))) [2023-12-24 12:42:54,876 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 71) no Hoare annotation was computed. [2023-12-24 12:42:54,876 INFO L899 garLoopResultBuilder]: For program point L94(line 94) no Hoare annotation was computed. [2023-12-24 12:42:54,876 INFO L895 garLoopResultBuilder]: At program point L78(line 78) the Hoare annotation is: (and (bvsge ((_ zero_extend 24) ~var_1_13~0) (_ bv1 32)) (= ~var_1_6~0 ~var_1_8~0) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32))) [2023-12-24 12:42:54,876 INFO L895 garLoopResultBuilder]: At program point L78-1(line 78) the Hoare annotation is: (and (bvsge ((_ zero_extend 24) ~var_1_13~0) (_ bv1 32)) (= ~var_1_6~0 ~var_1_8~0) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32))) [2023-12-24 12:42:54,876 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 57) no Hoare annotation was computed. [2023-12-24 12:42:54,876 INFO L899 garLoopResultBuilder]: For program point L45-1(lines 42 72) no Hoare annotation was computed. [2023-12-24 12:42:54,876 INFO L899 garLoopResultBuilder]: For program point L103(lines 73 104) no Hoare annotation was computed. [2023-12-24 12:42:54,876 INFO L895 garLoopResultBuilder]: At program point L87(line 87) the Hoare annotation is: (and (bvsge ((_ zero_extend 24) ~var_1_13~0) (_ bv1 32)) (= ~var_1_6~0 ~var_1_8~0) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32))) [2023-12-24 12:42:54,876 INFO L895 garLoopResultBuilder]: At program point L87-1(line 87) the Hoare annotation is: (and (bvsge ((_ zero_extend 24) ~var_1_13~0) (_ bv1 32)) (= ~var_1_6~0 ~var_1_8~0) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32))) [2023-12-24 12:42:54,876 INFO L899 garLoopResultBuilder]: For program point L79(line 79) no Hoare annotation was computed. [2023-12-24 12:42:54,876 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 54) no Hoare annotation was computed. [2023-12-24 12:42:54,876 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 12:42:54,876 INFO L895 garLoopResultBuilder]: At program point L96(line 96) the Hoare annotation is: (or (bvsge ((_ zero_extend 24) ~var_1_13~0) (_ bv1 32)) (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (not (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32)))) [2023-12-24 12:42:54,877 INFO L895 garLoopResultBuilder]: At program point L96-1(line 96) the Hoare annotation is: (or (bvsge ((_ zero_extend 24) ~var_1_13~0) (_ bv1 32)) (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (not (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32)))) [2023-12-24 12:42:54,877 INFO L899 garLoopResultBuilder]: For program point L63-1(lines 63 67) no Hoare annotation was computed. [2023-12-24 12:42:54,877 INFO L899 garLoopResultBuilder]: For program point L88(line 88) no Hoare annotation was computed. [2023-12-24 12:42:54,877 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 51) no Hoare annotation was computed. [2023-12-24 12:42:54,877 INFO L899 garLoopResultBuilder]: For program point L97(line 97) no Hoare annotation was computed. [2023-12-24 12:42:54,877 INFO L895 garLoopResultBuilder]: At program point L81(line 81) the Hoare annotation is: (and (bvsge ((_ zero_extend 24) ~var_1_13~0) (_ bv1 32)) (= ~var_1_6~0 ~var_1_8~0) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32))) [2023-12-24 12:42:54,877 INFO L895 garLoopResultBuilder]: At program point L81-1(line 81) the Hoare annotation is: (and (bvsge ((_ zero_extend 24) ~var_1_13~0) (_ bv1 32)) (= ~var_1_6~0 ~var_1_8~0) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32))) [2023-12-24 12:42:54,877 INFO L895 garLoopResultBuilder]: At program point L90(line 90) the Hoare annotation is: (and (bvsge ((_ zero_extend 24) ~var_1_13~0) (_ bv1 32)) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32))) [2023-12-24 12:42:54,877 INFO L895 garLoopResultBuilder]: At program point L90-1(line 90) the Hoare annotation is: (and (bvsge ((_ zero_extend 24) ~var_1_13~0) (_ bv1 32)) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32))) [2023-12-24 12:42:54,877 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-24 12:42:54,877 INFO L899 garLoopResultBuilder]: For program point L82(line 82) no Hoare annotation was computed. [2023-12-24 12:42:54,877 INFO L895 garLoopResultBuilder]: At program point L99(line 99) the Hoare annotation is: (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32)) [2023-12-24 12:42:54,877 INFO L895 garLoopResultBuilder]: At program point L99-1(line 99) the Hoare annotation is: (and (bvsge ((_ zero_extend 24) ~var_1_13~0) (_ bv1 32)) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32))) [2023-12-24 12:42:54,877 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 12:42:54,877 INFO L899 garLoopResultBuilder]: For program point L91(line 91) no Hoare annotation was computed. [2023-12-24 12:42:54,877 INFO L899 garLoopResultBuilder]: For program point L58(lines 42 72) no Hoare annotation was computed. [2023-12-24 12:42:54,878 INFO L895 garLoopResultBuilder]: At program point L75(line 75) the Hoare annotation is: (and (bvsge ((_ zero_extend 24) ~var_1_13~0) (_ bv1 32)) (= ~var_1_6~0 ~var_1_8~0) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32))) [2023-12-24 12:42:54,878 INFO L895 garLoopResultBuilder]: At program point L75-1(line 75) the Hoare annotation is: (and (bvsge ((_ zero_extend 24) ~var_1_13~0) (_ bv1 32)) (= ~var_1_6~0 ~var_1_8~0) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32))) [2023-12-24 12:42:54,878 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 72) no Hoare annotation was computed. [2023-12-24 12:42:54,878 INFO L899 garLoopResultBuilder]: For program point L100(line 100) no Hoare annotation was computed. [2023-12-24 12:42:54,878 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 61) no Hoare annotation was computed. [2023-12-24 12:42:54,878 INFO L895 garLoopResultBuilder]: At program point L84(line 84) the Hoare annotation is: (and (bvsge ((_ zero_extend 24) ~var_1_13~0) (_ bv1 32)) (= ~var_1_6~0 ~var_1_8~0) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32))) [2023-12-24 12:42:54,878 INFO L895 garLoopResultBuilder]: At program point L84-1(line 84) the Hoare annotation is: (and (bvsge ((_ zero_extend 24) ~var_1_13~0) (_ bv1 32)) (= ~var_1_6~0 ~var_1_8~0) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32))) [2023-12-24 12:42:54,878 INFO L895 garLoopResultBuilder]: At program point L117-2(lines 117 123) the Hoare annotation is: (and (bvsge ((_ zero_extend 24) ~var_1_13~0) (_ bv1 32)) (= ~var_1_6~0 ~var_1_8~0) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32))) [2023-12-24 12:42:54,878 INFO L899 garLoopResultBuilder]: For program point L117-3(lines 117 123) no Hoare annotation was computed. [2023-12-24 12:42:54,878 INFO L899 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2023-12-24 12:42:54,878 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-24 12:42:54,878 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-24 12:42:54,878 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-24 12:42:54,878 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-24 12:42:54,880 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 12:42:54,882 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 12:42:54,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 12:42:54 BoogieIcfgContainer [2023-12-24 12:42:54,889 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 12:42:54,889 INFO L158 Benchmark]: Toolchain (without parser) took 196388.31ms. Allocated memory was 288.4MB in the beginning and 999.3MB in the end (delta: 710.9MB). Free memory was 250.0MB in the beginning and 384.7MB in the end (delta: -134.7MB). Peak memory consumption was 605.7MB. Max. memory is 8.0GB. [2023-12-24 12:42:54,890 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 225.4MB. Free memory is still 172.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 12:42:54,890 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.98ms. Allocated memory is still 288.4MB. Free memory was 249.6MB in the beginning and 236.5MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-24 12:42:54,890 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.57ms. Allocated memory is still 288.4MB. Free memory was 236.5MB in the beginning and 234.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 12:42:54,890 INFO L158 Benchmark]: Boogie Preprocessor took 34.46ms. Allocated memory is still 288.4MB. Free memory was 234.4MB in the beginning and 231.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-24 12:42:54,890 INFO L158 Benchmark]: RCFGBuilder took 340.91ms. Allocated memory is still 288.4MB. Free memory was 231.3MB in the beginning and 212.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-24 12:42:54,890 INFO L158 Benchmark]: TraceAbstraction took 195760.31ms. Allocated memory was 288.4MB in the beginning and 999.3MB in the end (delta: 710.9MB). Free memory was 211.3MB in the beginning and 384.7MB in the end (delta: -173.3MB). Peak memory consumption was 566.9MB. Max. memory is 8.0GB. [2023-12-24 12:42:54,891 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 225.4MB. Free memory is still 172.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 221.98ms. Allocated memory is still 288.4MB. Free memory was 249.6MB in the beginning and 236.5MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.57ms. Allocated memory is still 288.4MB. Free memory was 236.5MB in the beginning and 234.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.46ms. Allocated memory is still 288.4MB. Free memory was 234.4MB in the beginning and 231.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 340.91ms. Allocated memory is still 288.4MB. Free memory was 231.3MB in the beginning and 212.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 195760.31ms. Allocated memory was 288.4MB in the beginning and 999.3MB in the end (delta: 710.9MB). Free memory was 211.3MB in the beginning and 384.7MB in the end (delta: -173.3MB). Peak memory consumption was 566.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 195.7s, OverallIterations: 8, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 18.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 26.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 975 SdHoareTripleChecker+Valid, 9.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 883 mSDsluCounter, 1984 SdHoareTripleChecker+Invalid, 8.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1361 mSDsCounter, 384 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2428 IncrementalHoareTripleChecker+Invalid, 2812 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 384 mSolverCounterUnsat, 623 mSDtfsCounter, 2428 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1505 GetRequests, 1356 SyntacticMatches, 4 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1069 ImplicationChecksByTransitivity, 17.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=7, InterpolantAutomatonStates: 131, 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, 8 MinimizatonAttempts, 275 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 127 PreInvPairs, 169 NumberOfFragments, 228 HoareAnnotationTreeSize, 127 FormulaSimplifications, 230814 FormulaSimplificationTreeSizeReduction, 1.9s HoareSimplificationTime, 22 FormulaSimplificationsInter, 65323 FormulaSimplificationTreeSizeReductionInter, 24.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 148.4s InterpolantComputationTime, 963 NumberOfCodeBlocks, 963 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1432 ConstructedInterpolants, 8 QuantifiedInterpolants, 13134 SizeOfPredicates, 123 NumberOfNonLiveVariables, 1602 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 8979/9120 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: 117]: Loop Invariant Derived loop invariant: (((var_1_13 >= 1) && (var_1_6 == var_1_8)) && (var_1_12 <= 0)) RESULT: Ultimate proved your program to be correct! [2023-12-24 12:42:55,044 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...