/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_amount100_file-85.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-17387ad-m [2024-11-06 08:12:16,493 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 08:12:16,560 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:12:16,563 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 08:12:16,564 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 08:12:16,587 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 08:12:16,588 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 08:12:16,589 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 08:12:16,589 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 08:12:16,592 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 08:12:16,592 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 08:12:16,592 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 08:12:16,593 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 08:12:16,593 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 08:12:16,593 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 08:12:16,594 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 08:12:16,594 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 08:12:16,594 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 08:12:16,595 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 08:12:16,595 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 08:12:16,595 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 08:12:16,596 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 08:12:16,596 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 08:12:16,596 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-06 08:12:16,596 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-06 08:12:16,596 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 08:12:16,597 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-06 08:12:16,597 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 08:12:16,597 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 08:12:16,597 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 08:12:16,597 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 08:12:16,598 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 08:12:16,598 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 08:12:16,598 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 08:12:16,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 08:12:16,598 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 08:12:16,598 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 08:12:16,599 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 08:12:16,599 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-06 08:12:16,599 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-06 08:12:16,600 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 08:12:16,600 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 08:12:16,600 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 08:12:16,600 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 08:12:16,601 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:12:16,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 08:12:16,830 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 08:12:16,833 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 08:12:16,834 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 08:12:16,834 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 08:12:16,835 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount100_file-85.i [2024-11-06 08:12:18,163 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 08:12:18,346 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 08:12:18,346 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount100_file-85.i [2024-11-06 08:12:18,354 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9083b2eb/1df1d6be76c34e4591dc65b4b73010a0/FLAGe90cffcce [2024-11-06 08:12:18,728 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9083b2eb/1df1d6be76c34e4591dc65b4b73010a0 [2024-11-06 08:12:18,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 08:12:18,731 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-06 08:12:18,733 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 08:12:18,733 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 08:12:18,738 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 08:12:18,739 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:12:18" (1/1) ... [2024-11-06 08:12:18,740 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d661cc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:12:18, skipping insertion in model container [2024-11-06 08:12:18,740 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:12:18" (1/1) ... [2024-11-06 08:12:18,774 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 08:12:18,913 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_amount100_file-85.i[916,929] [2024-11-06 08:12:18,992 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 08:12:19,004 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 08:12:19,013 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_amount100_file-85.i[916,929] [2024-11-06 08:12:19,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 08:12:19,107 INFO L204 MainTranslator]: Completed translation [2024-11-06 08:12:19,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:12:19 WrapperNode [2024-11-06 08:12:19,108 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 08:12:19,109 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 08:12:19,109 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 08:12:19,109 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 08:12:19,118 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:12:19" (1/1) ... [2024-11-06 08:12:19,136 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:12:19" (1/1) ... [2024-11-06 08:12:19,157 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 213 [2024-11-06 08:12:19,158 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 08:12:19,158 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 08:12:19,159 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 08:12:19,159 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 08:12:19,170 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:12:19" (1/1) ... [2024-11-06 08:12:19,174 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:12:19" (1/1) ... [2024-11-06 08:12:19,178 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:12:19" (1/1) ... [2024-11-06 08:12:19,192 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:12:19,192 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:12:19" (1/1) ... [2024-11-06 08:12:19,192 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:12:19" (1/1) ... [2024-11-06 08:12:19,202 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:12:19" (1/1) ... [2024-11-06 08:12:19,204 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:12:19" (1/1) ... [2024-11-06 08:12:19,207 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:12:19" (1/1) ... [2024-11-06 08:12:19,208 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:12:19" (1/1) ... [2024-11-06 08:12:19,211 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 08:12:19,212 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 08:12:19,212 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 08:12:19,212 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 08:12:19,213 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:12:19" (1/1) ... [2024-11-06 08:12:19,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 08:12:19,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 08:12:19,242 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:12:19,247 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:12:19,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 08:12:19,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-06 08:12:19,267 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-06 08:12:19,268 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-06 08:12:19,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 08:12:19,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 08:12:19,359 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 08:12:19,360 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 08:12:28,709 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-06 08:12:28,710 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 08:12:28,736 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 08:12:28,736 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 08:12:28,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:12:28 BoogieIcfgContainer [2024-11-06 08:12:28,736 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 08:12:28,744 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 08:12:28,744 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 08:12:28,746 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 08:12:28,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 08:12:18" (1/3) ... [2024-11-06 08:12:28,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3652ce4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:12:28, skipping insertion in model container [2024-11-06 08:12:28,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:12:19" (2/3) ... [2024-11-06 08:12:28,752 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3652ce4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:12:28, skipping insertion in model container [2024-11-06 08:12:28,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:12:28" (3/3) ... [2024-11-06 08:12:28,753 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-85.i [2024-11-06 08:12:28,775 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 08:12:28,775 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 08:12:28,865 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 08:12:28,880 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;@3c61b05f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 08:12:28,880 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 08:12:28,888 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 59 states have (on average 1.423728813559322) internal successors, (84), 60 states have internal predecessors, (84), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-06 08:12:28,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-06 08:12:28,920 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 08:12:28,921 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:28,922 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 08:12:28,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 08:12:28,929 INFO L85 PathProgramCache]: Analyzing trace with hash -23292764, now seen corresponding path program 1 times [2024-11-06 08:12:28,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 08:12:28,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [241457476] [2024-11-06 08:12:28,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 08:12:28,949 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:12:28,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 08:12:28,953 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:12:28,954 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:12:29,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 08:12:29,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-06 08:12:29,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 08:12:29,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 854 proven. 0 refuted. 0 times theorem prover too weak. 1130 trivial. 0 not checked. [2024-11-06 08:12:29,556 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 08:12:29,557 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 08:12:29,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [241457476] [2024-11-06 08:12:29,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [241457476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 08:12:29,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 08:12:29,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 08:12:29,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854131318] [2024-11-06 08:12:29,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 08:12:29,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-06 08:12:29,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 08:12:29,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-06 08:12:29,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-06 08:12:29,586 INFO L87 Difference]: Start difference. First operand has 94 states, 59 states have (on average 1.423728813559322) internal successors, (84), 60 states have internal predecessors, (84), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-06 08:12:29,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 08:12:29,626 INFO L93 Difference]: Finished difference Result 181 states and 322 transitions. [2024-11-06 08:12:29,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-06 08:12:29,628 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 202 [2024-11-06 08:12:29,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 08:12:29,634 INFO L225 Difference]: With dead ends: 181 [2024-11-06 08:12:29,635 INFO L226 Difference]: Without dead ends: 90 [2024-11-06 08:12:29,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 201 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:12:29,640 INFO L432 NwaCegarLoop]: 141 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, 141 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:12:29,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 08:12:29,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-06 08:12:29,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-06 08:12:29,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 56 states have (on average 1.375) internal successors, (77), 56 states have internal predecessors, (77), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-06 08:12:29,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 141 transitions. [2024-11-06 08:12:29,679 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 141 transitions. Word has length 202 [2024-11-06 08:12:29,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 08:12:29,679 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 141 transitions. [2024-11-06 08:12:29,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-06 08:12:29,680 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 141 transitions. [2024-11-06 08:12:29,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-06 08:12:29,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 08:12:29,683 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:29,701 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:12:29,886 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:12:29,887 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 08:12:29,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 08:12:29,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1218555828, now seen corresponding path program 1 times [2024-11-06 08:12:29,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 08:12:29,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [886133126] [2024-11-06 08:12:29,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 08:12:29,889 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:12:29,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 08:12:29,891 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:12:29,894 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:12:30,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 08:12:30,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 08:12:30,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 08:12:33,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-06 08:12:33,700 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 08:12:33,700 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 08:12:33,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [886133126] [2024-11-06 08:12:33,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [886133126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 08:12:33,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 08:12:33,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 08:12:33,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167719156] [2024-11-06 08:12:33,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 08:12:33,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 08:12:33,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 08:12:33,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 08:12:33,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-06 08:12:33,703 INFO L87 Difference]: Start difference. First operand 90 states and 141 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-06 08:12:39,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-06 08:12:43,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-06 08:12:47,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-06 08:12:51,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-06 08:12:55,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-06 08:12:59,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-06 08:13:03,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-06 08:13:07,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-06 08:13:11,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-06 08:13:15,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-06 08:13:19,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-06 08:13:23,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-06 08:13:28,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-06 08:13:32,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-06 08:13:36,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-06 08:13:40,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-06 08:13:40,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 08:13:40,729 INFO L93 Difference]: Finished difference Result 397 states and 627 transitions. [2024-11-06 08:13:40,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 08:13:40,730 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 202 [2024-11-06 08:13:40,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 08:13:40,734 INFO L225 Difference]: With dead ends: 397 [2024-11-06 08:13:40,734 INFO L226 Difference]: Without dead ends: 310 [2024-11-06 08:13:40,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-06 08:13:40,736 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 301 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 194 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 66.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 66.7s IncrementalHoareTripleChecker+Time [2024-11-06 08:13:40,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 671 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 179 Invalid, 16 Unknown, 0 Unchecked, 66.7s Time] [2024-11-06 08:13:40,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-11-06 08:13:40,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 259. [2024-11-06 08:13:40,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 159 states have (on average 1.3836477987421383) internal successors, (220), 159 states have internal predecessors, (220), 96 states have call successors, (96), 3 states have call predecessors, (96), 3 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-06 08:13:40,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 412 transitions. [2024-11-06 08:13:40,811 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 412 transitions. Word has length 202 [2024-11-06 08:13:40,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 08:13:40,811 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 412 transitions. [2024-11-06 08:13:40,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-06 08:13:40,812 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 412 transitions. [2024-11-06 08:13:40,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-06 08:13:40,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 08:13:40,814 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:40,836 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:13:41,014 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:13:41,015 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 08:13:41,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 08:13:41,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1736673405, now seen corresponding path program 1 times [2024-11-06 08:13:41,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 08:13:41,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [435765054] [2024-11-06 08:13:41,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 08:13:41,017 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:13:41,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 08:13:41,020 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:13:41,021 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:13:41,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 08:13:41,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-06 08:13:41,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 08:13:43,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 967 proven. 57 refuted. 0 times theorem prover too weak. 960 trivial. 0 not checked. [2024-11-06 08:13:43,586 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 08:13:45,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 36 proven. 57 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-06 08:13:45,831 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 08:13:45,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [435765054] [2024-11-06 08:13:45,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [435765054] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 08:13:45,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 08:13:45,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-06 08:13:45,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356525033] [2024-11-06 08:13:45,831 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 08:13:45,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 08:13:45,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 08:13:45,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 08:13:45,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-06 08:13:45,837 INFO L87 Difference]: Start difference. First operand 259 states and 412 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) [2024-11-06 08:13:52,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-06 08:13:56,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-06 08:14:00,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-06 08:14:00,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 08:14:00,266 INFO L93 Difference]: Finished difference Result 440 states and 690 transitions. [2024-11-06 08:14:00,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 08:14:00,342 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) Word has length 203 [2024-11-06 08:14:00,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 08:14:00,345 INFO L225 Difference]: With dead ends: 440 [2024-11-06 08:14:00,345 INFO L226 Difference]: Without dead ends: 184 [2024-11-06 08:14:00,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 398 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-06 08:14:00,351 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 63 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 9 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.2s IncrementalHoareTripleChecker+Time [2024-11-06 08:14:00,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 224 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 180 Invalid, 3 Unknown, 0 Unchecked, 14.2s Time] [2024-11-06 08:14:00,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-06 08:14:00,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 180. [2024-11-06 08:14:00,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 111 states have (on average 1.3063063063063063) internal successors, (145), 111 states have internal predecessors, (145), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-06 08:14:00,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 273 transitions. [2024-11-06 08:14:00,382 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 273 transitions. Word has length 203 [2024-11-06 08:14:00,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 08:14:00,382 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 273 transitions. [2024-11-06 08:14:00,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) [2024-11-06 08:14:00,383 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 273 transitions. [2024-11-06 08:14:00,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-06 08:14:00,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 08:14:00,384 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:00,403 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:14:00,588 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:14:00,589 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 08:14:00,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 08:14:00,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1278430213, now seen corresponding path program 1 times [2024-11-06 08:14:00,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 08:14:00,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1227381304] [2024-11-06 08:14:00,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 08:14:00,594 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:14:00,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 08:14:00,596 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:14:00,598 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:14:01,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 08:14:01,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 08:14:01,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 08:14:03,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 967 proven. 57 refuted. 0 times theorem prover too weak. 960 trivial. 0 not checked. [2024-11-06 08:14:03,649 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 08:14:06,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 36 proven. 57 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-06 08:14:06,230 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 08:14:06,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1227381304] [2024-11-06 08:14:06,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1227381304] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 08:14:06,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 08:14:06,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-11-06 08:14:06,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434434824] [2024-11-06 08:14:06,231 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 08:14:06,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-06 08:14:06,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 08:14:06,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-06 08:14:06,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-06 08:14:06,235 INFO L87 Difference]: Start difference. First operand 180 states and 273 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52)