/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 --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.trace.refinement.strategy FOX -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-3.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-17387ad-m [2024-11-06 08:15:43,857 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 08:15:43,926 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-06 08:15:43,930 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 08:15:43,930 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 08:15:43,950 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 08:15:43,950 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 08:15:43,951 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 08:15:43,951 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 08:15:43,951 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 08:15:43,952 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 08:15:43,954 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 08:15:43,955 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 08:15:43,955 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 08:15:43,956 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 08:15:43,956 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 08:15:43,956 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 08:15:43,956 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 08:15:43,957 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 08:15:43,957 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 08:15:43,957 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 08:15:43,959 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 08:15:43,959 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 08:15:43,959 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-06 08:15:43,960 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-06 08:15:43,960 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 08:15:43,960 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-06 08:15:43,961 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 08:15:43,961 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 08:15:43,961 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 08:15:43,961 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 08:15:43,962 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 08:15:43,962 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 08:15:43,962 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 08:15:43,962 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 08:15:43,963 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 08:15:43,963 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 08:15:43,963 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 08:15:43,963 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-06 08:15:43,964 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-06 08:15:43,964 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 08:15:43,964 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 08:15:43,965 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 08:15:43,965 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 08:15:43,965 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.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FOX [2024-11-06 08:15:44,207 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 08:15:44,230 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 08:15:44,233 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 08:15:44,234 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 08:15:44,234 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 08:15:44,235 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-3.i [2024-11-06 08:15:45,614 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 08:15:45,803 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 08:15:45,804 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-3.i [2024-11-06 08:15:45,812 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d80e6535/4b28578b5bd948f2bd6605ba9c37317b/FLAG67b7b0186 [2024-11-06 08:15:45,830 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d80e6535/4b28578b5bd948f2bd6605ba9c37317b [2024-11-06 08:15:45,835 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 08:15:45,837 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-06 08:15:45,841 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 08:15:45,841 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 08:15:45,845 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 08:15:45,846 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:15:45" (1/1) ... [2024-11-06 08:15:45,847 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48767841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:15:45, skipping insertion in model container [2024-11-06 08:15:45,847 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:15:45" (1/1) ... [2024-11-06 08:15:45,869 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 08:15:46,032 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_amount10_file-3.i[914,927] [2024-11-06 08:15:46,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 08:15:46,066 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 08:15:46,076 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_amount10_file-3.i[914,927] [2024-11-06 08:15:46,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 08:15:46,110 INFO L204 MainTranslator]: Completed translation [2024-11-06 08:15:46,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:15:46 WrapperNode [2024-11-06 08:15:46,112 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 08:15:46,113 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 08:15:46,113 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 08:15:46,113 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 08:15:46,120 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:15:46" (1/1) ... [2024-11-06 08:15:46,128 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:15:46" (1/1) ... [2024-11-06 08:15:46,144 INFO L138 Inliner]: procedures = 27, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 70 [2024-11-06 08:15:46,145 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 08:15:46,146 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 08:15:46,146 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 08:15:46,146 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 08:15:46,155 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:15:46" (1/1) ... [2024-11-06 08:15:46,156 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:15:46" (1/1) ... [2024-11-06 08:15:46,159 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:15:46" (1/1) ... [2024-11-06 08:15:46,168 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-06 08:15:46,168 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:15:46" (1/1) ... [2024-11-06 08:15:46,169 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:15:46" (1/1) ... [2024-11-06 08:15:46,175 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:15:46" (1/1) ... [2024-11-06 08:15:46,182 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:15:46" (1/1) ... [2024-11-06 08:15:46,183 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:15:46" (1/1) ... [2024-11-06 08:15:46,185 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:15:46" (1/1) ... [2024-11-06 08:15:46,187 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 08:15:46,188 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 08:15:46,188 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 08:15:46,188 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 08:15:46,189 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:15:46" (1/1) ... [2024-11-06 08:15:46,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 08:15:46,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 08:15:46,221 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-06 08:15:46,223 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-06 08:15:46,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 08:15:46,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-06 08:15:46,243 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-06 08:15:46,243 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-06 08:15:46,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 08:15:46,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 08:15:46,314 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 08:15:46,316 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 08:15:46,947 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-06 08:15:46,947 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 08:15:46,957 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 08:15:46,958 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 08:15:46,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:15:46 BoogieIcfgContainer [2024-11-06 08:15:46,958 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 08:15:46,960 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 08:15:46,960 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 08:15:46,962 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 08:15:46,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 08:15:45" (1/3) ... [2024-11-06 08:15:46,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f5b6be6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:15:46, skipping insertion in model container [2024-11-06 08:15:46,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:15:46" (2/3) ... [2024-11-06 08:15:46,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f5b6be6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:15:46, skipping insertion in model container [2024-11-06 08:15:46,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:15:46" (3/3) ... [2024-11-06 08:15:46,965 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-3.i [2024-11-06 08:15:46,980 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 08:15:46,980 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 08:15:47,029 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 08:15:47,035 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;@5eace700, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 08:15:47,035 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 08:15:47,038 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-06 08:15:47,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-06 08:15:47,045 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 08:15:47,046 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 08:15:47,046 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 08:15:47,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 08:15:47,050 INFO L85 PathProgramCache]: Analyzing trace with hash 209972596, now seen corresponding path program 1 times [2024-11-06 08:15:47,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 08:15:47,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1542312046] [2024-11-06 08:15:47,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 08:15:47,060 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-06 08:15:47,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 08:15:47,082 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-06 08:15:47,083 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-06 08:15:47,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 08:15:47,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-06 08:15:47,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 08:15:47,289 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-06 08:15:47,289 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 08:15:47,290 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 08:15:47,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1542312046] [2024-11-06 08:15:47,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1542312046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 08:15:47,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 08:15:47,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 08:15:47,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513800989] [2024-11-06 08:15:47,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 08:15:47,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-06 08:15:47,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 08:15:47,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-06 08:15:47,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-06 08:15:47,325 INFO L87 Difference]: Start difference. First operand has 37 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-06 08:15:47,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 08:15:47,349 INFO L93 Difference]: Finished difference Result 67 states and 106 transitions. [2024-11-06 08:15:47,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-06 08:15:47,352 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 55 [2024-11-06 08:15:47,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 08:15:47,360 INFO L225 Difference]: With dead ends: 67 [2024-11-06 08:15:47,360 INFO L226 Difference]: Without dead ends: 33 [2024-11-06 08:15:47,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 54 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-06 08:15:47,370 INFO L432 NwaCegarLoop]: 45 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, 45 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-06 08:15:47,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 08:15:47,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-06 08:15:47,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-06 08:15:47,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-06 08:15:47,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2024-11-06 08:15:47,414 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 45 transitions. Word has length 55 [2024-11-06 08:15:47,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 08:15:47,415 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 45 transitions. [2024-11-06 08:15:47,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-06 08:15:47,417 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2024-11-06 08:15:47,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-06 08:15:47,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 08:15:47,419 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 08:15:47,428 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-06 08:15:47,620 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-06 08:15:47,621 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 08:15:47,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 08:15:47,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1544713484, now seen corresponding path program 1 times [2024-11-06 08:15:47,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 08:15:47,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1471861058] [2024-11-06 08:15:47,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 08:15:47,624 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-06 08:15:47,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 08:15:47,626 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-06 08:15:47,627 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-06 08:15:47,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 08:15:47,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-06 08:15:47,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 08:15:53,663 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-06 08:15:53,663 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 08:15:53,664 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 08:15:53,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1471861058] [2024-11-06 08:15:53,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1471861058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 08:15:53,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 08:15:53,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 08:15:53,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727703989] [2024-11-06 08:15:53,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 08:15:53,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 08:15:53,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 08:15:53,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 08:15:53,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 08:15:53,670 INFO L87 Difference]: Start difference. First operand 33 states and 45 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-06 08:15:54,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 08:15:54,763 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2024-11-06 08:15:54,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 08:15:54,765 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 55 [2024-11-06 08:15:54,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 08:15:54,766 INFO L225 Difference]: With dead ends: 41 [2024-11-06 08:15:54,766 INFO L226 Difference]: Without dead ends: 39 [2024-11-06 08:15:54,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-06 08:15:54,768 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-06 08:15:54,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 158 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-06 08:15:54,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-06 08:15:54,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2024-11-06 08:15:54,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-06 08:15:54,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2024-11-06 08:15:54,777 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 55 [2024-11-06 08:15:54,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 08:15:54,779 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2024-11-06 08:15:54,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-06 08:15:54,780 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2024-11-06 08:15:54,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-06 08:15:54,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 08:15:54,782 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 08:15:54,793 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 [2024-11-06 08:15:54,983 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-06 08:15:54,983 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 08:15:54,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 08:15:54,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1390515739, now seen corresponding path program 1 times [2024-11-06 08:15:54,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 08:15:54,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [357349351] [2024-11-06 08:15:54,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 08:15:54,985 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-06 08:15:54,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 08:15:54,987 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-06 08:15:54,988 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-06 08:15:55,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 08:15:55,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-06 08:15:55,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 08:15:57,763 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-06 08:15:57,764 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 08:15:57,764 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 08:15:57,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [357349351] [2024-11-06 08:15:57,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [357349351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 08:15:57,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 08:15:57,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 08:15:57,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448263850] [2024-11-06 08:15:57,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 08:15:57,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 08:15:57,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 08:15:57,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 08:15:57,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-06 08:15:57,767 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-06 08:15:59,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 08:15:59,130 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2024-11-06 08:15:59,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 08:15:59,131 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 56 [2024-11-06 08:15:59,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 08:15:59,133 INFO L225 Difference]: With dead ends: 47 [2024-11-06 08:15:59,133 INFO L226 Difference]: Without dead ends: 45 [2024-11-06 08:15:59,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-06 08:15:59,135 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 26 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-06 08:15:59,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 165 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-06 08:15:59,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-06 08:15:59,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2024-11-06 08:15:59,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-06 08:15:59,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2024-11-06 08:15:59,146 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 56 [2024-11-06 08:15:59,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 08:15:59,147 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2024-11-06 08:15:59,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-06 08:15:59,147 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2024-11-06 08:15:59,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-06 08:15:59,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 08:15:59,148 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 08:15:59,158 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 (4)] Ended with exit code 0 [2024-11-06 08:15:59,353 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-06 08:15:59,354 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 08:15:59,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 08:15:59,355 INFO L85 PathProgramCache]: Analyzing trace with hash -736348597, now seen corresponding path program 1 times [2024-11-06 08:15:59,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 08:15:59,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1224268343] [2024-11-06 08:15:59,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 08:15:59,355 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-06 08:15:59,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 08:15:59,359 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-06 08:15:59,360 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-06 08:15:59,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 08:15:59,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-06 08:15:59,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 08:16:02,362 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-06 08:16:02,363 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 08:16:02,363 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 08:16:02,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1224268343] [2024-11-06 08:16:02,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1224268343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 08:16:02,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 08:16:02,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 08:16:02,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588304084] [2024-11-06 08:16:02,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 08:16:02,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 08:16:02,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 08:16:02,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 08:16:02,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-06 08:16:02,368 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-06 08:16:07,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 08:16:07,815 INFO L93 Difference]: Finished difference Result 83 states and 107 transitions. [2024-11-06 08:16:07,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 08:16:07,824 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 57 [2024-11-06 08:16:07,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 08:16:07,826 INFO L225 Difference]: With dead ends: 83 [2024-11-06 08:16:07,826 INFO L226 Difference]: Without dead ends: 50 [2024-11-06 08:16:07,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-06 08:16:07,828 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 25 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-06 08:16:07,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 193 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-06 08:16:07,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-06 08:16:07,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2024-11-06 08:16:07,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-06 08:16:07,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2024-11-06 08:16:07,833 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 57 [2024-11-06 08:16:07,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 08:16:07,834 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2024-11-06 08:16:07,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-06 08:16:07,834 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2024-11-06 08:16:07,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-06 08:16:07,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 08:16:07,835 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 08:16:07,845 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-06 08:16:08,036 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-06 08:16:08,036 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 08:16:08,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 08:16:08,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1762999332, now seen corresponding path program 1 times [2024-11-06 08:16:08,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 08:16:08,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2008359726] [2024-11-06 08:16:08,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 08:16:08,038 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-06 08:16:08,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 08:16:08,040 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) [2024-11-06 08:16:08,042 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 [2024-11-06 08:16:08,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 08:16:08,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-06 08:16:08,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 08:16:14,499 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-06 08:16:14,499 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 08:16:14,500 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 08:16:14,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2008359726] [2024-11-06 08:16:14,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2008359726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 08:16:14,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 08:16:14,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-06 08:16:14,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169363088] [2024-11-06 08:16:14,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 08:16:14,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 08:16:14,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 08:16:14,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 08:16:14,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-06 08:16:14,502 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-06 08:16:20,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 08:16:20,961 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2024-11-06 08:16:20,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 08:16:20,969 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 58 [2024-11-06 08:16:20,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 08:16:20,969 INFO L225 Difference]: With dead ends: 50 [2024-11-06 08:16:20,969 INFO L226 Difference]: Without dead ends: 0 [2024-11-06 08:16:20,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-06 08:16:20,971 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 17 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-06 08:16:20,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 201 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-06 08:16:20,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-06 08:16:20,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-06 08:16:20,972 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-06 08:16:20,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-06 08:16:20,972 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2024-11-06 08:16:20,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 08:16:20,973 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-06 08:16:20,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-06 08:16:20,973 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-06 08:16:20,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-06 08:16:20,976 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 08:16:20,987 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 [2024-11-06 08:16:21,177 WARN L453 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 [2024-11-06 08:16:21,181 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-06 08:16:21,182 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-06 08:16:21,197 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 08:16:21,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 08:16:21 BoogieIcfgContainer [2024-11-06 08:16:21,212 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 08:16:21,213 INFO L158 Benchmark]: Toolchain (without parser) took 35375.47ms. Allocated memory was 196.1MB in the beginning and 315.6MB in the end (delta: 119.5MB). Free memory was 146.8MB in the beginning and 129.4MB in the end (delta: 17.4MB). Peak memory consumption was 138.1MB. Max. memory is 8.0GB. [2024-11-06 08:16:21,214 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 196.1MB. Free memory is still 149.3MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-06 08:16:21,214 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.88ms. Allocated memory is still 196.1MB. Free memory was 146.5MB in the beginning and 132.8MB in the end (delta: 13.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2024-11-06 08:16:21,214 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.83ms. Allocated memory is still 196.1MB. Free memory was 132.8MB in the beginning and 131.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-06 08:16:21,214 INFO L158 Benchmark]: Boogie Preprocessor took 41.49ms. Allocated memory is still 196.1MB. Free memory was 131.1MB in the beginning and 129.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-06 08:16:21,215 INFO L158 Benchmark]: RCFGBuilder took 770.45ms. Allocated memory is still 196.1MB. Free memory was 129.0MB in the beginning and 116.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-11-06 08:16:21,215 INFO L158 Benchmark]: TraceAbstraction took 34252.24ms. Allocated memory was 196.1MB in the beginning and 315.6MB in the end (delta: 119.5MB). Free memory was 116.0MB in the beginning and 129.4MB in the end (delta: -13.4MB). Peak memory consumption was 107.7MB. Max. memory is 8.0GB. [2024-11-06 08:16:21,218 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 196.1MB. Free memory is still 149.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 271.88ms. Allocated memory is still 196.1MB. Free memory was 146.5MB in the beginning and 132.8MB in the end (delta: 13.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.83ms. Allocated memory is still 196.1MB. Free memory was 132.8MB in the beginning and 131.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.49ms. Allocated memory is still 196.1MB. Free memory was 131.1MB in the beginning and 129.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 770.45ms. Allocated memory is still 196.1MB. Free memory was 129.0MB in the beginning and 116.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 34252.24ms. Allocated memory was 196.1MB in the beginning and 315.6MB in the end (delta: 119.5MB). Free memory was 116.0MB in the beginning and 129.4MB in the end (delta: -13.4MB). Peak memory consumption was 107.7MB. 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, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 34.2s, OverallIterations: 5, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 14.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 75 SdHoareTripleChecker+Valid, 7.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 75 mSDsluCounter, 762 SdHoareTripleChecker+Invalid, 7.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 532 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 178 IncrementalHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 230 mSDtfsCounter, 178 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 284 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 11.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=0, InterpolantAutomatonStates: 28, 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, 5 MinimizatonAttempts, 27 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 17.7s InterpolantComputationTime, 281 NumberOfCodeBlocks, 281 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 276 ConstructedInterpolants, 0 QuantifiedInterpolants, 386 SizeOfPredicates, 28 NumberOfNonLiveVariables, 467 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 560/560 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: 69]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_2 == \old(var_1_2))) && (var_1_3 == \old(var_1_3))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) RESULT: Ultimate proved your program to be correct! [2024-11-06 08:16:21,275 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...