/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver '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' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-42.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-df9f019-m [2024-11-05 19:55:10,857 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 19:55:10,936 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-05 19:55:10,944 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 19:55:10,944 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 19:55:10,964 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 19:55:10,965 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 19:55:10,965 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 19:55:10,966 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 19:55:10,968 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 19:55:10,968 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 19:55:10,968 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 19:55:10,969 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 19:55:10,969 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 19:55:10,969 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 19:55:10,970 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 19:55:10,970 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 19:55:10,974 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-05 19:55:10,974 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-05 19:55:10,975 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 19:55:10,975 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 19:55:10,975 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 19:55:10,975 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 19:55:10,976 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 19:55:10,976 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 19:55:10,976 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 19:55:10,976 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 19:55:10,977 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-05 19:55:10,977 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 19:55:10,977 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 19:55:10,977 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 19:55:10,978 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 19:55:10,978 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 19:55:10,978 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 19:55:10,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 19:55:10,978 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 19:55:10,979 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 19:55:10,979 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 19:55:10,979 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 19:55:10,979 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 19:55:10,979 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 19:55:10,980 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 19:55:10,980 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 19:55:10,980 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 19:55:10,980 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> 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 [2024-11-05 19:55:11,227 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 19:55:11,254 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 19:55:11,256 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 19:55:11,258 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 19:55:11,258 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 19:55:11,259 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-42.i [2024-11-05 19:55:12,691 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 19:55:12,881 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 19:55:12,882 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-42.i [2024-11-05 19:55:12,889 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12a8959a5/3cbd3c57768646ccbbe4d7fc29bd0dad/FLAGe166b1880 [2024-11-05 19:55:12,901 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12a8959a5/3cbd3c57768646ccbbe4d7fc29bd0dad [2024-11-05 19:55:12,903 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 19:55:12,905 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 19:55:12,906 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 19:55:12,906 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 19:55:12,910 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 19:55:12,911 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 07:55:12" (1/1) ... [2024-11-05 19:55:12,912 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4622a5b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:55:12, skipping insertion in model container [2024-11-05 19:55:12,912 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 07:55:12" (1/1) ... [2024-11-05 19:55:12,936 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 19:55:13,095 WARN L250 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_operatoramount_amount25_file-42.i[915,928] [2024-11-05 19:55:13,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 19:55:13,152 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 19:55:13,163 WARN L250 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_operatoramount_amount25_file-42.i[915,928] [2024-11-05 19:55:13,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 19:55:13,196 INFO L204 MainTranslator]: Completed translation [2024-11-05 19:55:13,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:55:13 WrapperNode [2024-11-05 19:55:13,196 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 19:55:13,197 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 19:55:13,198 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 19:55:13,198 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 19:55:13,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:55:13" (1/1) ... [2024-11-05 19:55:13,212 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:55:13" (1/1) ... [2024-11-05 19:55:13,236 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 102 [2024-11-05 19:55:13,236 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 19:55:13,237 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 19:55:13,237 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 19:55:13,237 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 19:55:13,247 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:55:13" (1/1) ... [2024-11-05 19:55:13,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:55:13" (1/1) ... [2024-11-05 19:55:13,250 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:55:13" (1/1) ... [2024-11-05 19:55:13,261 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]. [2024-11-05 19:55:13,262 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:55:13" (1/1) ... [2024-11-05 19:55:13,263 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:55:13" (1/1) ... [2024-11-05 19:55:13,271 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:55:13" (1/1) ... [2024-11-05 19:55:13,274 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:55:13" (1/1) ... [2024-11-05 19:55:13,276 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:55:13" (1/1) ... [2024-11-05 19:55:13,277 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:55:13" (1/1) ... [2024-11-05 19:55:13,280 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 19:55:13,281 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 19:55:13,281 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 19:55:13,281 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 19:55:13,282 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:55:13" (1/1) ... [2024-11-05 19:55:13,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 19:55:13,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 19:55:13,316 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) [2024-11-05 19:55:13,318 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 [2024-11-05 19:55:13,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 19:55:13,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 19:55:13,345 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-05 19:55:13,345 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-05 19:55:13,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 19:55:13,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 19:55:13,457 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 19:55:13,460 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 19:55:13,705 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-05 19:55:13,705 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 19:55:13,719 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 19:55:13,720 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-05 19:55:13,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 07:55:13 BoogieIcfgContainer [2024-11-05 19:55:13,721 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 19:55:13,726 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 19:55:13,726 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 19:55:13,729 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 19:55:13,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 07:55:12" (1/3) ... [2024-11-05 19:55:13,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b1a23d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 07:55:13, skipping insertion in model container [2024-11-05 19:55:13,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:55:13" (2/3) ... [2024-11-05 19:55:13,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b1a23d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 07:55:13, skipping insertion in model container [2024-11-05 19:55:13,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 07:55:13" (3/3) ... [2024-11-05 19:55:13,731 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-42.i [2024-11-05 19:55:13,746 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 19:55:13,746 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 19:55:13,797 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 19:55:13,802 INFO L333 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, 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;@56379d21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 19:55:13,803 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 19:55:13,805 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-05 19:55:13,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-05 19:55:13,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:55:13,813 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 19:55:13,813 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:55:13,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:55:13,817 INFO L85 PathProgramCache]: Analyzing trace with hash 350031807, now seen corresponding path program 1 times [2024-11-05 19:55:13,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:55:13,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1548122045] [2024-11-05 19:55:13,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:55:13,825 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 [2024-11-05 19:55:13,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:55:13,828 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) [2024-11-05 19:55:13,830 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 [2024-11-05 19:55:13,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:55:13,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-05 19:55:14,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:55:14,032 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-11-05 19:55:14,033 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:55:14,117 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-11-05 19:55:14,118 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:55:14,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1548122045] [2024-11-05 19:55:14,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1548122045] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 19:55:14,119 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 19:55:14,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2024-11-05 19:55:14,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234180691] [2024-11-05 19:55:14,121 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 19:55:14,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-05 19:55:14,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:55:14,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-05 19:55:14,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 19:55:14,148 INFO L87 Difference]: Start difference. First operand has 48 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-05 19:55:14,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 19:55:14,171 INFO L93 Difference]: Finished difference Result 89 states and 147 transitions. [2024-11-05 19:55:14,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-05 19:55:14,173 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 97 [2024-11-05 19:55:14,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 19:55:14,178 INFO L225 Difference]: With dead ends: 89 [2024-11-05 19:55:14,179 INFO L226 Difference]: Without dead ends: 44 [2024-11-05 19:55:14,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 19:55:14,185 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 19:55:14,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 19:55:14,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-05 19:55:14,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-05 19:55:14,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-05 19:55:14,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 62 transitions. [2024-11-05 19:55:14,225 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 62 transitions. Word has length 97 [2024-11-05 19:55:14,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 19:55:14,226 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 62 transitions. [2024-11-05 19:55:14,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-05 19:55:14,228 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 62 transitions. [2024-11-05 19:55:14,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-05 19:55:14,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:55:14,235 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 19:55:14,241 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 [2024-11-05 19:55:14,435 WARN L453 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 [2024-11-05 19:55:14,436 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:55:14,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:55:14,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1682017665, now seen corresponding path program 1 times [2024-11-05 19:55:14,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:55:14,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1209142887] [2024-11-05 19:55:14,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:55:14,438 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 [2024-11-05 19:55:14,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:55:14,442 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) [2024-11-05 19:55:14,443 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 [2024-11-05 19:55:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:55:14,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 19:55:14,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:55:14,602 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-05 19:55:14,603 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:55:14,729 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-05 19:55:14,730 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:55:14,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1209142887] [2024-11-05 19:55:14,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1209142887] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 19:55:14,730 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 19:55:14,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 19:55:14,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857428152] [2024-11-05 19:55:14,734 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 19:55:14,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 19:55:14,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:55:14,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 19:55:14,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 19:55:14,737 INFO L87 Difference]: Start difference. First operand 44 states and 62 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-05 19:55:14,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 19:55:14,889 INFO L93 Difference]: Finished difference Result 116 states and 167 transitions. [2024-11-05 19:55:14,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-05 19:55:14,890 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 97 [2024-11-05 19:55:14,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 19:55:14,892 INFO L225 Difference]: With dead ends: 116 [2024-11-05 19:55:14,892 INFO L226 Difference]: Without dead ends: 75 [2024-11-05 19:55:14,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 19:55:14,895 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 82 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 19:55:14,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 148 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 19:55:14,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-05 19:55:14,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 44. [2024-11-05 19:55:14,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-05 19:55:14,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 61 transitions. [2024-11-05 19:55:14,913 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 61 transitions. Word has length 97 [2024-11-05 19:55:14,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 19:55:14,916 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 61 transitions. [2024-11-05 19:55:14,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-05 19:55:14,917 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 61 transitions. [2024-11-05 19:55:14,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-05 19:55:14,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:55:14,920 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 19:55:14,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-05 19:55:15,125 WARN L453 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 [2024-11-05 19:55:15,125 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:55:15,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:55:15,126 INFO L85 PathProgramCache]: Analyzing trace with hash -837942269, now seen corresponding path program 1 times [2024-11-05 19:55:15,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:55:15,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1183036720] [2024-11-05 19:55:15,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:55:15,127 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 [2024-11-05 19:55:15,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:55:15,129 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) [2024-11-05 19:55:15,130 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 [2024-11-05 19:55:15,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:55:15,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-05 19:55:15,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:55:46,374 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 299 proven. 27 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-05 19:55:46,375 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:56:20,949 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 123 proven. 57 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2024-11-05 19:56:20,949 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:56:20,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1183036720] [2024-11-05 19:56:20,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1183036720] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 19:56:20,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 19:56:20,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 39 [2024-11-05 19:56:20,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411311010] [2024-11-05 19:56:20,951 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 19:56:20,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-05 19:56:20,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:56:20,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-05 19:56:20,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=1145, Unknown=0, NotChecked=0, Total=1482 [2024-11-05 19:56:20,954 INFO L87 Difference]: Start difference. First operand 44 states and 61 transitions. Second operand has 39 states, 39 states have (on average 1.8461538461538463) internal successors, (72), 38 states have internal predecessors, (72), 5 states have call successors, (22), 5 states have call predecessors, (22), 14 states have return successors, (23), 6 states have call predecessors, (23), 5 states have call successors, (23) [2024-11-05 19:56:22,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 19:56:22,423 INFO L93 Difference]: Finished difference Result 111 states and 138 transitions. [2024-11-05 19:56:22,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-05 19:56:22,424 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.8461538461538463) internal successors, (72), 38 states have internal predecessors, (72), 5 states have call successors, (22), 5 states have call predecessors, (22), 14 states have return successors, (23), 6 states have call predecessors, (23), 5 states have call successors, (23) Word has length 97 [2024-11-05 19:56:22,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 19:56:22,426 INFO L225 Difference]: With dead ends: 111 [2024-11-05 19:56:22,426 INFO L226 Difference]: Without dead ends: 109 [2024-11-05 19:56:22,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 157 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1039 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=888, Invalid=2652, Unknown=0, NotChecked=0, Total=3540 [2024-11-05 19:56:22,429 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 137 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-05 19:56:22,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 462 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-05 19:56:22,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-05 19:56:22,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 84. [2024-11-05 19:56:22,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 56 states have internal predecessors, (61), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-05 19:56:22,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 105 transitions. [2024-11-05 19:56:22,445 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 105 transitions. Word has length 97 [2024-11-05 19:56:22,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 19:56:22,446 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 105 transitions. [2024-11-05 19:56:22,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.8461538461538463) internal successors, (72), 38 states have internal predecessors, (72), 5 states have call successors, (22), 5 states have call predecessors, (22), 14 states have return successors, (23), 6 states have call predecessors, (23), 5 states have call successors, (23) [2024-11-05 19:56:22,446 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions. [2024-11-05 19:56:22,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-05 19:56:22,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:56:22,448 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 19:56:22,454 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 [2024-11-05 19:56:22,652 WARN L453 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 [2024-11-05 19:56:22,653 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:56:22,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:56:22,654 INFO L85 PathProgramCache]: Analyzing trace with hash -157883899, now seen corresponding path program 1 times [2024-11-05 19:56:22,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:56:22,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [601030921] [2024-11-05 19:56:22,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:56:22,655 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 [2024-11-05 19:56:22,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:56:22,658 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) [2024-11-05 19:56:22,659 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 [2024-11-05 19:56:22,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:56:22,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-05 19:56:22,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:56:22,845 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-05 19:56:22,845 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:56:22,931 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-05 19:56:22,931 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:56:22,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [601030921] [2024-11-05 19:56:22,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [601030921] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 19:56:22,931 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 19:56:22,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [] total 6 [2024-11-05 19:56:22,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301426127] [2024-11-05 19:56:22,932 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 19:56:22,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 19:56:22,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:56:22,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 19:56:22,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-05 19:56:22,934 INFO L87 Difference]: Start difference. First operand 84 states and 105 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-05 19:56:23,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 19:56:23,088 INFO L93 Difference]: Finished difference Result 187 states and 226 transitions. [2024-11-05 19:56:23,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-05 19:56:23,088 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 97 [2024-11-05 19:56:23,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 19:56:23,091 INFO L225 Difference]: With dead ends: 187 [2024-11-05 19:56:23,091 INFO L226 Difference]: Without dead ends: 0 [2024-11-05 19:56:23,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-05 19:56:23,093 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 93 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 19:56:23,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 98 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 19:56:23,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-05 19:56:23,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-05 19:56:23,097 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) [2024-11-05 19:56:23,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-05 19:56:23,098 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 97 [2024-11-05 19:56:23,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 19:56:23,098 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-05 19:56:23,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-05 19:56:23,099 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-05 19:56:23,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-05 19:56:23,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-05 19:56:23,105 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 [2024-11-05 19:56:23,301 WARN L453 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 [2024-11-05 19:56:23,305 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-05 19:56:23,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-05 19:56:24,653 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-05 19:56:24,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.11 07:56:24 BoogieIcfgContainer [2024-11-05 19:56:24,681 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-05 19:56:24,685 INFO L158 Benchmark]: Toolchain (without parser) took 71779.93ms. Allocated memory was 197.1MB in the beginning and 896.5MB in the end (delta: 699.4MB). Free memory was 140.3MB in the beginning and 527.4MB in the end (delta: -387.1MB). Peak memory consumption was 313.1MB. Max. memory is 8.0GB. [2024-11-05 19:56:24,685 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 197.1MB. Free memory is still 145.7MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-05 19:56:24,685 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.19ms. Allocated memory is still 197.1MB. Free memory was 140.3MB in the beginning and 125.7MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2024-11-05 19:56:24,685 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.95ms. Allocated memory is still 197.1MB. Free memory was 125.7MB in the beginning and 123.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-05 19:56:24,686 INFO L158 Benchmark]: Boogie Preprocessor took 42.91ms. Allocated memory is still 197.1MB. Free memory was 123.8MB in the beginning and 121.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-05 19:56:24,686 INFO L158 Benchmark]: RCFGBuilder took 440.23ms. Allocated memory was 197.1MB in the beginning and 357.6MB in the end (delta: 160.4MB). Free memory was 121.2MB in the beginning and 317.3MB in the end (delta: -196.1MB). Peak memory consumption was 11.6MB. Max. memory is 8.0GB. [2024-11-05 19:56:24,686 INFO L158 Benchmark]: TraceAbstraction took 70955.00ms. Allocated memory was 357.6MB in the beginning and 896.5MB in the end (delta: 539.0MB). Free memory was 316.8MB in the beginning and 527.4MB in the end (delta: -210.7MB). Peak memory consumption was 327.8MB. Max. memory is 8.0GB. [2024-11-05 19:56:24,688 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.28ms. Allocated memory is still 197.1MB. Free memory is still 145.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 291.19ms. Allocated memory is still 197.1MB. Free memory was 140.3MB in the beginning and 125.7MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.95ms. Allocated memory is still 197.1MB. Free memory was 125.7MB in the beginning and 123.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.91ms. Allocated memory is still 197.1MB. Free memory was 123.8MB in the beginning and 121.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 440.23ms. Allocated memory was 197.1MB in the beginning and 357.6MB in the end (delta: 160.4MB). Free memory was 121.2MB in the beginning and 317.3MB in the end (delta: -196.1MB). Peak memory consumption was 11.6MB. Max. memory is 8.0GB. * TraceAbstraction took 70955.00ms. Allocated memory was 357.6MB in the beginning and 896.5MB in the end (delta: 539.0MB). Free memory was 316.8MB in the beginning and 527.4MB in the end (delta: -210.7MB). Peak memory consumption was 327.8MB. 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, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 69.5s, OverallIterations: 4, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 319 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 312 mSDsluCounter, 770 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 488 mSDsCounter, 245 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1117 IncrementalHoareTripleChecker+Invalid, 1362 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 245 mSolverCounterUnsat, 282 mSDtfsCounter, 1117 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 797 GetRequests, 729 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1043 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=3, InterpolantAutomatonStates: 49, 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, 4 MinimizatonAttempts, 56 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 66.2s InterpolantComputationTime, 388 NumberOfCodeBlocks, 388 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 768 ConstructedInterpolants, 0 QuantifiedInterpolants, 2636 SizeOfPredicates, 28 NumberOfNonLiveVariables, 643 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 3276/3360 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: 96]: Loop Invariant Derived loop invariant: (((((0 != \old(cond)) || !(var_1_12 >= 1)) && (((1 + last_1_var_1_1) % 4294967296) == 0)) && (0 == ((var_1_1 + 1) % 4294967296))) || (((((((var_1_14 <= 0) && (var_1_15 <= 0)) && (last_1_var_1_1 >= -1000)) && (var_1_12 >= 1)) && (var_1_12 <= 1)) && (var_1_13 <= 0)) && (var_1_1 >= -1000))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: ((last_1_var_1_1 >= -1000) && (var_1_1 >= -1000)) Ensures: ((((last_1_var_1_1 >= -1000) && (0 != cond)) && (var_1_1 >= -1000)) && (((((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (var_1_13 == \old(var_1_13))) && (var_1_14 == \old(var_1_14))) && (var_1_15 == \old(var_1_15))) && (var_1_16 == \old(var_1_16))) && (var_1_17 == \old(var_1_17))) && (last_1_var_1_1 == \old(last_1_var_1_1)))) RESULT: Ultimate proved your program to be correct! [2024-11-05 19:56:24,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...