/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-54.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-17387ad-m [2024-11-06 08:08:16,562 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 08:08:16,623 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:08:16,631 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 08:08:16,631 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 08:08:16,663 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 08:08:16,664 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 08:08:16,664 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 08:08:16,665 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 08:08:16,666 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 08:08:16,666 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 08:08:16,667 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 08:08:16,667 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 08:08:16,668 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 08:08:16,668 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 08:08:16,668 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 08:08:16,668 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 08:08:16,669 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 08:08:16,669 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 08:08:16,672 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 08:08:16,673 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 08:08:16,674 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 08:08:16,674 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 08:08:16,674 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-06 08:08:16,674 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-06 08:08:16,675 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 08:08:16,675 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-06 08:08:16,675 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 08:08:16,675 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 08:08:16,675 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 08:08:16,676 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 08:08:16,676 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 08:08:16,676 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 08:08:16,676 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 08:08:16,677 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 08:08:16,677 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 08:08:16,681 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 08:08:16,681 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 08:08:16,681 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-06 08:08:16,681 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-06 08:08:16,682 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 08:08:16,682 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 08:08:16,682 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 08:08:16,682 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 08:08:16,682 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:08:16,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 08:08:16,961 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 08:08:16,963 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 08:08:16,965 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 08:08:16,965 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 08:08:16,966 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-54.i [2024-11-06 08:08:18,413 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 08:08:18,640 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 08:08:18,641 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount100_file-54.i [2024-11-06 08:08:18,652 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97195ab97/e2f144f10fb34a42b3283fd3550773de/FLAGa2f3143cd [2024-11-06 08:08:18,992 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97195ab97/e2f144f10fb34a42b3283fd3550773de [2024-11-06 08:08:18,994 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 08:08:18,995 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-06 08:08:18,996 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 08:08:18,996 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 08:08:19,000 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 08:08:19,001 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:08:18" (1/1) ... [2024-11-06 08:08:19,002 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68f2b418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:08:19, skipping insertion in model container [2024-11-06 08:08:19,002 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:08:18" (1/1) ... [2024-11-06 08:08:19,043 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 08:08:19,190 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-54.i[916,929] [2024-11-06 08:08:19,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 08:08:19,279 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 08:08:19,291 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-54.i[916,929] [2024-11-06 08:08:19,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 08:08:19,365 INFO L204 MainTranslator]: Completed translation [2024-11-06 08:08:19,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:08:19 WrapperNode [2024-11-06 08:08:19,367 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 08:08:19,368 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 08:08:19,368 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 08:08:19,368 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 08:08:19,375 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:08:19" (1/1) ... [2024-11-06 08:08:19,386 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:08:19" (1/1) ... [2024-11-06 08:08:19,412 INFO L138 Inliner]: procedures = 27, calls = 57, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 246 [2024-11-06 08:08:19,412 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 08:08:19,414 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 08:08:19,414 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 08:08:19,414 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 08:08:19,423 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:08:19" (1/1) ... [2024-11-06 08:08:19,423 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:08:19" (1/1) ... [2024-11-06 08:08:19,429 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:08:19" (1/1) ... [2024-11-06 08:08:19,447 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:08:19,448 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:08:19" (1/1) ... [2024-11-06 08:08:19,448 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:08:19" (1/1) ... [2024-11-06 08:08:19,461 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:08:19" (1/1) ... [2024-11-06 08:08:19,467 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:08:19" (1/1) ... [2024-11-06 08:08:19,469 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:08:19" (1/1) ... [2024-11-06 08:08:19,471 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:08:19" (1/1) ... [2024-11-06 08:08:19,473 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 08:08:19,477 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 08:08:19,477 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 08:08:19,478 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 08:08:19,478 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:08:19" (1/1) ... [2024-11-06 08:08:19,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 08:08:19,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 08:08:19,520 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:08:19,524 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:08:19,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 08:08:19,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-06 08:08:19,545 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-06 08:08:19,545 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-06 08:08:19,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 08:08:19,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 08:08:19,625 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 08:08:19,627 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 08:08:21,010 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-06 08:08:21,011 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 08:08:21,028 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 08:08:21,028 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 08:08:21,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:08:21 BoogieIcfgContainer [2024-11-06 08:08:21,029 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 08:08:21,030 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 08:08:21,031 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 08:08:21,034 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 08:08:21,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 08:08:18" (1/3) ... [2024-11-06 08:08:21,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7378db0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:08:21, skipping insertion in model container [2024-11-06 08:08:21,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:08:19" (2/3) ... [2024-11-06 08:08:21,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7378db0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:08:21, skipping insertion in model container [2024-11-06 08:08:21,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:08:21" (3/3) ... [2024-11-06 08:08:21,036 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-54.i [2024-11-06 08:08:21,048 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 08:08:21,049 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 08:08:21,097 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 08:08:21,102 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;@5a8efc3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 08:08:21,102 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 08:08:21,106 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 66 states have (on average 1.393939393939394) internal successors, (92), 67 states have internal predecessors, (92), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-06 08:08:21,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2024-11-06 08:08:21,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 08:08:21,121 INFO L215 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:21,121 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 08:08:21,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 08:08:21,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1763384431, now seen corresponding path program 1 times [2024-11-06 08:08:21,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 08:08:21,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [259810251] [2024-11-06 08:08:21,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 08:08:21,141 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:08:21,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 08:08:21,146 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:08:21,154 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:08:21,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 08:08:21,578 INFO L255 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-06 08:08:21,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 08:08:21,661 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2024-11-06 08:08:21,662 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 08:08:21,663 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 08:08:21,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [259810251] [2024-11-06 08:08:21,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [259810251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 08:08:21,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 08:08:21,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 08:08:21,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862317428] [2024-11-06 08:08:21,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 08:08:21,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-06 08:08:21,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 08:08:21,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-06 08:08:21,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-06 08:08:21,691 INFO L87 Difference]: Start difference. First operand has 113 states, 66 states have (on average 1.393939393939394) internal successors, (92), 67 states have internal predecessors, (92), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2024-11-06 08:08:21,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 08:08:21,726 INFO L93 Difference]: Finished difference Result 219 states and 398 transitions. [2024-11-06 08:08:21,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-06 08:08:21,728 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 269 [2024-11-06 08:08:21,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 08:08:21,741 INFO L225 Difference]: With dead ends: 219 [2024-11-06 08:08:21,742 INFO L226 Difference]: Without dead ends: 109 [2024-11-06 08:08:21,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 268 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:08:21,750 INFO L432 NwaCegarLoop]: 172 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, 172 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:08:21,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 08:08:21,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-06 08:08:21,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-06 08:08:21,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 63 states have internal predecessors, (84), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-06 08:08:21,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 172 transitions. [2024-11-06 08:08:21,810 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 172 transitions. Word has length 269 [2024-11-06 08:08:21,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 08:08:21,815 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 172 transitions. [2024-11-06 08:08:21,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2024-11-06 08:08:21,815 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 172 transitions. [2024-11-06 08:08:21,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2024-11-06 08:08:21,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 08:08:21,822 INFO L215 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:21,837 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:08:22,033 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:08:22,033 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 08:08:22,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 08:08:22,034 INFO L85 PathProgramCache]: Analyzing trace with hash 935944368, now seen corresponding path program 1 times [2024-11-06 08:08:22,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 08:08:22,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [535933043] [2024-11-06 08:08:22,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 08:08:22,036 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:08:22,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 08:08:22,041 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:08:22,043 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:08:22,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 08:08:22,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-06 08:08:22,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 08:08:22,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 1929 proven. 60 refuted. 0 times theorem prover too weak. 1795 trivial. 0 not checked. [2024-11-06 08:08:22,670 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 08:08:23,021 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 69 proven. 60 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2024-11-06 08:08:23,021 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 08:08:23,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [535933043] [2024-11-06 08:08:23,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [535933043] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 08:08:23,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 08:08:23,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-06 08:08:23,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285067987] [2024-11-06 08:08:23,023 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 08:08:23,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 08:08:23,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 08:08:23,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 08:08:23,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-06 08:08:23,028 INFO L87 Difference]: Start difference. First operand 109 states and 172 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (64), 2 states have call predecessors, (64), 4 states have return successors, (65), 2 states have call predecessors, (65), 2 states have call successors, (65) [2024-11-06 08:08:24,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 08:08:24,404 INFO L93 Difference]: Finished difference Result 223 states and 348 transitions. [2024-11-06 08:08:24,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-06 08:08:24,422 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (64), 2 states have call predecessors, (64), 4 states have return successors, (65), 2 states have call predecessors, (65), 2 states have call successors, (65) Word has length 270 [2024-11-06 08:08:24,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 08:08:24,429 INFO L225 Difference]: With dead ends: 223 [2024-11-06 08:08:24,429 INFO L226 Difference]: Without dead ends: 117 [2024-11-06 08:08:24,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 542 GetRequests, 532 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-06 08:08:24,432 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 85 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-06 08:08:24,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 268 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-06 08:08:24,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-06 08:08:24,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2024-11-06 08:08:24,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 66 states have internal predecessors, (85), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-06 08:08:24,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 173 transitions. [2024-11-06 08:08:24,455 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 173 transitions. Word has length 270 [2024-11-06 08:08:24,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 08:08:24,456 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 173 transitions. [2024-11-06 08:08:24,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (64), 2 states have call predecessors, (64), 4 states have return successors, (65), 2 states have call predecessors, (65), 2 states have call successors, (65) [2024-11-06 08:08:24,456 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 173 transitions. [2024-11-06 08:08:24,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2024-11-06 08:08:24,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 08:08:24,461 INFO L215 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:24,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-06 08:08:24,664 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:08:24,665 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 08:08:24,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 08:08:24,665 INFO L85 PathProgramCache]: Analyzing trace with hash -652403534, now seen corresponding path program 1 times [2024-11-06 08:08:24,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 08:08:24,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1788806417] [2024-11-06 08:08:24,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 08:08:24,667 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:08:24,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 08:08:24,671 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:08:24,672 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:08:25,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 08:08:25,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 08:08:25,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 08:08:25,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2024-11-06 08:08:25,591 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 08:08:25,591 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 08:08:25,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1788806417] [2024-11-06 08:08:25,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1788806417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 08:08:25,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 08:08:25,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 08:08:25,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509092519] [2024-11-06 08:08:25,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 08:08:25,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 08:08:25,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 08:08:25,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 08:08:25,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 08:08:25,594 INFO L87 Difference]: Start difference. First operand 113 states and 173 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2024-11-06 08:08:26,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 08:08:26,352 INFO L93 Difference]: Finished difference Result 223 states and 343 transitions. [2024-11-06 08:08:26,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 08:08:26,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 270 [2024-11-06 08:08:26,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 08:08:26,370 INFO L225 Difference]: With dead ends: 223 [2024-11-06 08:08:26,370 INFO L226 Difference]: Without dead ends: 113 [2024-11-06 08:08:26,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 08:08:26,371 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 44 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 08:08:26,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 166 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 08:08:26,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-06 08:08:26,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-06 08:08:26,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 66 states have (on average 1.2727272727272727) internal successors, (84), 66 states have internal predecessors, (84), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-06 08:08:26,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 172 transitions. [2024-11-06 08:08:26,384 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 172 transitions. Word has length 270 [2024-11-06 08:08:26,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 08:08:26,385 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 172 transitions. [2024-11-06 08:08:26,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2024-11-06 08:08:26,386 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 172 transitions. [2024-11-06 08:08:26,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2024-11-06 08:08:26,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 08:08:26,388 INFO L215 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:26,400 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:08:26,592 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:08:26,593 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 08:08:26,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 08:08:26,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1673471888, now seen corresponding path program 1 times [2024-11-06 08:08:26,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 08:08:26,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1541768292] [2024-11-06 08:08:26,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 08:08:26,599 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:08:26,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 08:08:26,602 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:08:26,603 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:08:26,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 08:08:26,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 08:08:26,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 08:08:27,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 1929 proven. 60 refuted. 0 times theorem prover too weak. 1795 trivial. 0 not checked. [2024-11-06 08:08:27,150 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 08:08:27,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 69 proven. 60 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2024-11-06 08:08:27,405 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 08:08:27,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1541768292] [2024-11-06 08:08:27,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1541768292] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 08:08:27,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 08:08:27,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-06 08:08:27,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342859513] [2024-11-06 08:08:27,406 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 08:08:27,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 08:08:27,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 08:08:27,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 08:08:27,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-06 08:08:27,407 INFO L87 Difference]: Start difference. First operand 113 states and 172 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (64), 2 states have call predecessors, (64), 4 states have return successors, (65), 2 states have call predecessors, (65), 2 states have call successors, (65) [2024-11-06 08:08:29,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 08:08:29,388 INFO L93 Difference]: Finished difference Result 338 states and 512 transitions. [2024-11-06 08:08:29,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-06 08:08:29,389 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (64), 2 states have call predecessors, (64), 4 states have return successors, (65), 2 states have call predecessors, (65), 2 states have call successors, (65) Word has length 270 [2024-11-06 08:08:29,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 08:08:29,392 INFO L225 Difference]: With dead ends: 338 [2024-11-06 08:08:29,392 INFO L226 Difference]: Without dead ends: 228 [2024-11-06 08:08:29,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 532 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-11-06 08:08:29,398 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 266 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-06 08:08:29,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 534 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-06 08:08:29,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-06 08:08:29,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 218. [2024-11-06 08:08:29,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 125 states have (on average 1.248) internal successors, (156), 125 states have internal predecessors, (156), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-06 08:08:29,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 332 transitions. [2024-11-06 08:08:29,439 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 332 transitions. Word has length 270 [2024-11-06 08:08:29,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 08:08:29,440 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 332 transitions. [2024-11-06 08:08:29,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (64), 2 states have call predecessors, (64), 4 states have return successors, (65), 2 states have call predecessors, (65), 2 states have call successors, (65) [2024-11-06 08:08:29,442 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 332 transitions. [2024-11-06 08:08:29,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2024-11-06 08:08:29,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 08:08:29,444 INFO L215 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:29,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-06 08:08:29,645 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:08:29,645 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 08:08:29,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 08:08:29,646 INFO L85 PathProgramCache]: Analyzing trace with hash -2131519120, now seen corresponding path program 1 times [2024-11-06 08:08:29,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 08:08:29,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1093979759] [2024-11-06 08:08:29,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 08:08:29,647 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:08:29,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 08:08:29,656 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:08:29,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-06 08:08:30,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 08:08:30,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-06 08:08:30,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 08:08:30,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 2086 proven. 138 refuted. 0 times theorem prover too weak. 1560 trivial. 0 not checked. [2024-11-06 08:08:30,701 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 08:08:31,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 114 proven. 141 refuted. 0 times theorem prover too weak. 3529 trivial. 0 not checked. [2024-11-06 08:08:31,145 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 08:08:31,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1093979759] [2024-11-06 08:08:31,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1093979759] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 08:08:31,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 08:08:31,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2024-11-06 08:08:31,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635561366] [2024-11-06 08:08:31,146 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 08:08:31,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-06 08:08:31,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 08:08:31,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-06 08:08:31,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-11-06 08:08:31,148 INFO L87 Difference]: Start difference. First operand 218 states and 332 transitions. Second operand has 14 states, 14 states have (on average 5.214285714285714) internal successors, (73), 14 states have internal predecessors, (73), 3 states have call successors, (69), 3 states have call predecessors, (69), 7 states have return successors, (70), 3 states have call predecessors, (70), 3 states have call successors, (70) [2024-11-06 08:08:34,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 08:08:34,354 INFO L93 Difference]: Finished difference Result 980 states and 1443 transitions. [2024-11-06 08:08:34,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-06 08:08:34,355 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.214285714285714) internal successors, (73), 14 states have internal predecessors, (73), 3 states have call successors, (69), 3 states have call predecessors, (69), 7 states have return successors, (70), 3 states have call predecessors, (70), 3 states have call successors, (70) Word has length 270 [2024-11-06 08:08:34,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 08:08:34,361 INFO L225 Difference]: With dead ends: 980 [2024-11-06 08:08:34,362 INFO L226 Difference]: Without dead ends: 765 [2024-11-06 08:08:34,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 529 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=556, Invalid=1514, Unknown=0, NotChecked=0, Total=2070 [2024-11-06 08:08:34,367 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 465 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 409 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 409 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-06 08:08:34,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 617 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [409 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-06 08:08:34,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2024-11-06 08:08:34,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 705. [2024-11-06 08:08:34,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 398 states have (on average 1.1959798994974875) internal successors, (476), 399 states have internal predecessors, (476), 282 states have call successors, (282), 24 states have call predecessors, (282), 24 states have return successors, (282), 281 states have call predecessors, (282), 282 states have call successors, (282) [2024-11-06 08:08:34,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 1040 transitions. [2024-11-06 08:08:34,456 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 1040 transitions. Word has length 270 [2024-11-06 08:08:34,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 08:08:34,456 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 1040 transitions. [2024-11-06 08:08:34,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.214285714285714) internal successors, (73), 14 states have internal predecessors, (73), 3 states have call successors, (69), 3 states have call predecessors, (69), 7 states have return successors, (70), 3 states have call predecessors, (70), 3 states have call successors, (70) [2024-11-06 08:08:34,459 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 1040 transitions. [2024-11-06 08:08:34,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2024-11-06 08:08:34,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 08:08:34,460 INFO L215 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:34,480 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:08:34,661 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:08:34,661 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 08:08:34,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 08:08:34,662 INFO L85 PathProgramCache]: Analyzing trace with hash 708038653, now seen corresponding path program 1 times [2024-11-06 08:08:34,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 08:08:34,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1326176311] [2024-11-06 08:08:34,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 08:08:34,663 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:08:34,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 08:08:34,666 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 08:08:34,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-06 08:08:35,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 08:08:35,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-06 08:08:35,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 08:08:35,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 2124 proven. 63 refuted. 0 times theorem prover too weak. 1597 trivial. 0 not checked. [2024-11-06 08:08:35,451 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 08:08:35,909 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 08:08:35,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1326176311] [2024-11-06 08:08:35,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1326176311] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 08:08:35,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423847337] [2024-11-06 08:08:35,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 08:08:35,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 08:08:35,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 08:08:35,912 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 08:08:35,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-06 08:08:36,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 08:08:36,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-06 08:08:36,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 08:08:38,282 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 2767 proven. 174 refuted. 0 times theorem prover too weak. 843 trivial. 0 not checked. [2024-11-06 08:08:38,282 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 08:08:39,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423847337] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 08:08:39,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 08:08:39,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18] total 26 [2024-11-06 08:08:39,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733367884] [2024-11-06 08:08:39,063 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 08:08:39,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-06 08:08:39,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 08:08:39,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-06 08:08:39,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=817, Unknown=0, NotChecked=0, Total=992 [2024-11-06 08:08:39,066 INFO L87 Difference]: Start difference. First operand 705 states and 1040 transitions. Second operand has 26 states, 26 states have (on average 5.115384615384615) internal successors, (133), 26 states have internal predecessors, (133), 8 states have call successors, (88), 8 states have call predecessors, (88), 14 states have return successors, (88), 8 states have call predecessors, (88), 8 states have call successors, (88) [2024-11-06 08:08:46,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-06 08:08:49,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-06 08:08:51,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 08:08:51,502 INFO L93 Difference]: Finished difference Result 2079 states and 2943 transitions. [2024-11-06 08:08:51,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-06 08:08:51,506 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.115384615384615) internal successors, (133), 26 states have internal predecessors, (133), 8 states have call successors, (88), 8 states have call predecessors, (88), 14 states have return successors, (88), 8 states have call predecessors, (88), 8 states have call successors, (88) Word has length 271 [2024-11-06 08:08:51,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 08:08:51,520 INFO L225 Difference]: With dead ends: 2079 [2024-11-06 08:08:51,520 INFO L226 Difference]: Without dead ends: 1405 [2024-11-06 08:08:51,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 560 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 915 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=843, Invalid=2817, Unknown=0, NotChecked=0, Total=3660 [2024-11-06 08:08:51,525 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 935 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 1975 mSolverCounterSat, 316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 935 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 2291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 1975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2024-11-06 08:08:51,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [935 Valid, 932 Invalid, 2291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 1975 Invalid, 0 Unknown, 0 Unchecked, 11.4s Time] [2024-11-06 08:08:51,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2024-11-06 08:08:51,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 1145. [2024-11-06 08:08:51,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 704 states have (on average 1.2017045454545454) internal successors, (846), 711 states have internal predecessors, (846), 378 states have call successors, (378), 62 states have call predecessors, (378), 62 states have return successors, (378), 371 states have call predecessors, (378), 378 states have call successors, (378) [2024-11-06 08:08:51,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1602 transitions. [2024-11-06 08:08:51,635 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1602 transitions. Word has length 271 [2024-11-06 08:08:51,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 08:08:51,637 INFO L471 AbstractCegarLoop]: Abstraction has 1145 states and 1602 transitions. [2024-11-06 08:08:51,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.115384615384615) internal successors, (133), 26 states have internal predecessors, (133), 8 states have call successors, (88), 8 states have call predecessors, (88), 14 states have return successors, (88), 8 states have call predecessors, (88), 8 states have call successors, (88) [2024-11-06 08:08:51,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1602 transitions. [2024-11-06 08:08:51,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2024-11-06 08:08:51,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 08:08:51,639 INFO L215 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:51,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-06 08:08:51,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-06 08:08:52,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 08:08:52,044 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 08:08:52,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 08:08:52,045 INFO L85 PathProgramCache]: Analyzing trace with hash 966204091, now seen corresponding path program 1 times [2024-11-06 08:08:52,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 08:08:52,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1856761342] [2024-11-06 08:08:52,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 08:08:52,045 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:08:52,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 08:08:52,048 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 08:08:52,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-06 08:08:52,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 08:08:52,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-06 08:08:52,461 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 08:09:03,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 2158 proven. 255 refuted. 0 times theorem prover too weak. 1371 trivial. 0 not checked. [2024-11-06 08:09:03,165 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 08:09:34,210 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 114 proven. 141 refuted. 0 times theorem prover too weak. 3529 trivial. 0 not checked. [2024-11-06 08:09:34,210 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 08:09:34,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1856761342] [2024-11-06 08:09:34,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1856761342] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 08:09:34,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 08:09:34,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 24 [2024-11-06 08:09:34,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634829609] [2024-11-06 08:09:34,210 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 08:09:34,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-06 08:09:34,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 08:09:34,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-06 08:09:34,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=428, Unknown=0, NotChecked=0, Total=552 [2024-11-06 08:09:34,212 INFO L87 Difference]: Start difference. First operand 1145 states and 1602 transitions. Second operand has 24 states, 24 states have (on average 5.333333333333333) internal successors, (128), 24 states have internal predecessors, (128), 7 states have call successors, (88), 5 states have call predecessors, (88), 10 states have return successors, (88), 7 states have call predecessors, (88), 7 states have call successors, (88)