/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-26.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-17387ad-m [2024-11-06 08:04:17,329 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 08:04:17,411 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:04:17,418 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 08:04:17,419 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 08:04:17,445 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 08:04:17,446 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 08:04:17,446 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 08:04:17,447 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 08:04:17,447 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 08:04:17,447 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 08:04:17,448 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 08:04:17,448 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 08:04:17,449 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 08:04:17,449 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 08:04:17,451 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 08:04:17,452 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 08:04:17,454 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 08:04:17,455 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 08:04:17,455 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 08:04:17,455 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 08:04:17,456 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 08:04:17,456 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 08:04:17,458 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-06 08:04:17,458 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-06 08:04:17,458 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 08:04:17,458 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-06 08:04:17,459 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 08:04:17,459 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 08:04:17,459 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 08:04:17,459 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 08:04:17,460 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 08:04:17,460 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 08:04:17,460 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 08:04:17,460 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 08:04:17,461 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 08:04:17,461 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 08:04:17,461 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 08:04:17,462 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-06 08:04:17,462 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-06 08:04:17,462 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 08:04:17,463 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 08:04:17,463 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 08:04:17,463 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 08:04:17,463 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:04:17,698 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 08:04:17,719 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 08:04:17,723 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 08:04:17,724 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 08:04:17,724 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 08:04:17,725 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-26.i [2024-11-06 08:04:19,160 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 08:04:19,371 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 08:04:19,372 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount100_file-26.i [2024-11-06 08:04:19,383 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01b9aa138/f4c2a441158b40edbbf25774e1e53960/FLAG4a112d6f8 [2024-11-06 08:04:19,395 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01b9aa138/f4c2a441158b40edbbf25774e1e53960 [2024-11-06 08:04:19,398 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 08:04:19,399 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-06 08:04:19,400 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 08:04:19,400 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 08:04:19,405 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 08:04:19,406 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:04:19" (1/1) ... [2024-11-06 08:04:19,406 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39e40e2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:19, skipping insertion in model container [2024-11-06 08:04:19,407 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:04:19" (1/1) ... [2024-11-06 08:04:19,437 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 08:04:19,593 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-26.i[916,929] [2024-11-06 08:04:19,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 08:04:19,711 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 08:04:19,720 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-26.i[916,929] [2024-11-06 08:04:19,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 08:04:19,777 INFO L204 MainTranslator]: Completed translation [2024-11-06 08:04:19,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:19 WrapperNode [2024-11-06 08:04:19,778 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 08:04:19,779 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 08:04:19,779 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 08:04:19,779 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 08:04:19,785 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:04:19" (1/1) ... [2024-11-06 08:04:19,797 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:04:19" (1/1) ... [2024-11-06 08:04:19,826 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 207 [2024-11-06 08:04:19,826 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 08:04:19,827 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 08:04:19,827 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 08:04:19,827 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 08:04:19,842 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:19" (1/1) ... [2024-11-06 08:04:19,842 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:19" (1/1) ... [2024-11-06 08:04:19,849 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:19" (1/1) ... [2024-11-06 08:04:19,864 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:04:19,864 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:19" (1/1) ... [2024-11-06 08:04:19,864 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:19" (1/1) ... [2024-11-06 08:04:19,875 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:19" (1/1) ... [2024-11-06 08:04:19,879 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:19" (1/1) ... [2024-11-06 08:04:19,884 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:19" (1/1) ... [2024-11-06 08:04:19,885 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:19" (1/1) ... [2024-11-06 08:04:19,892 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 08:04:19,893 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 08:04:19,893 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 08:04:19,893 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 08:04:19,894 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:19" (1/1) ... [2024-11-06 08:04:19,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 08:04:19,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 08:04:19,928 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:04:19,931 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:04:19,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 08:04:19,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-06 08:04:19,957 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-06 08:04:19,958 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-06 08:04:19,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 08:04:19,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 08:04:20,057 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 08:04:20,061 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 08:04:20,691 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-06 08:04:20,691 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 08:04:20,712 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 08:04:20,712 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 08:04:20,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:04:20 BoogieIcfgContainer [2024-11-06 08:04:20,713 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 08:04:20,715 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 08:04:20,715 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 08:04:20,718 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 08:04:20,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 08:04:19" (1/3) ... [2024-11-06 08:04:20,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a675c1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:04:20, skipping insertion in model container [2024-11-06 08:04:20,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:19" (2/3) ... [2024-11-06 08:04:20,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a675c1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:04:20, skipping insertion in model container [2024-11-06 08:04:20,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:04:20" (3/3) ... [2024-11-06 08:04:20,721 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-26.i [2024-11-06 08:04:20,736 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 08:04:20,737 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 08:04:20,800 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 08:04:20,807 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;@a23e10b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 08:04:20,808 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 08:04:20,813 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 61 states have internal predecessors, (86), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-06 08:04:20,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-06 08:04:20,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 08:04:20,834 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:20,834 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 08:04:20,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 08:04:20,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1615266300, now seen corresponding path program 1 times [2024-11-06 08:04:20,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 08:04:20,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1287255355] [2024-11-06 08:04:20,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 08:04:20,861 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:04:20,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 08:04:20,864 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:04:20,865 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:04:21,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 08:04:21,155 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-06 08:04:21,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 08:04:21,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 674 proven. 0 refuted. 0 times theorem prover too weak. 1066 trivial. 0 not checked. [2024-11-06 08:04:21,227 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 08:04:21,228 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 08:04:21,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1287255355] [2024-11-06 08:04:21,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1287255355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 08:04:21,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 08:04:21,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 08:04:21,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992613250] [2024-11-06 08:04:21,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 08:04:21,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-06 08:04:21,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 08:04:21,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-06 08:04:21,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-06 08:04:21,264 INFO L87 Difference]: Start difference. First operand has 93 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 61 states have internal predecessors, (86), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-06 08:04:21,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 08:04:21,298 INFO L93 Difference]: Finished difference Result 179 states and 316 transitions. [2024-11-06 08:04:21,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-06 08:04:21,300 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), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 195 [2024-11-06 08:04:21,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 08:04:21,307 INFO L225 Difference]: With dead ends: 179 [2024-11-06 08:04:21,307 INFO L226 Difference]: Without dead ends: 89 [2024-11-06 08:04:21,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 194 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:04:21,316 INFO L432 NwaCegarLoop]: 139 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, 139 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:04:21,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 08:04:21,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-06 08:04:21,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-06 08:04:21,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 57 states have internal predecessors, (79), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-06 08:04:21,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 139 transitions. [2024-11-06 08:04:21,362 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 139 transitions. Word has length 195 [2024-11-06 08:04:21,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 08:04:21,362 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 139 transitions. [2024-11-06 08:04:21,362 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), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-06 08:04:21,363 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 139 transitions. [2024-11-06 08:04:21,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-06 08:04:21,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 08:04:21,367 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:21,379 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:04:21,568 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:04:21,569 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 08:04:21,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 08:04:21,570 INFO L85 PathProgramCache]: Analyzing trace with hash 198903544, now seen corresponding path program 1 times [2024-11-06 08:04:21,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 08:04:21,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [784721871] [2024-11-06 08:04:21,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 08:04:21,571 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:04:21,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 08:04:21,576 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:04:21,578 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:04:21,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 08:04:21,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-06 08:04:21,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 08:04:22,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-06 08:04:22,396 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 08:04:22,397 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 08:04:22,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [784721871] [2024-11-06 08:04:22,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [784721871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 08:04:22,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 08:04:22,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 08:04:22,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441822236] [2024-11-06 08:04:22,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 08:04:22,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 08:04:22,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 08:04:22,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 08:04:22,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 08:04:22,403 INFO L87 Difference]: Start difference. First operand 89 states and 139 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-06 08:04:23,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 08:04:23,048 INFO L93 Difference]: Finished difference Result 280 states and 439 transitions. [2024-11-06 08:04:23,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 08:04:23,055 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 195 [2024-11-06 08:04:23,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 08:04:23,059 INFO L225 Difference]: With dead ends: 280 [2024-11-06 08:04:23,059 INFO L226 Difference]: Without dead ends: 194 [2024-11-06 08:04:23,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-06 08:04:23,062 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 127 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 08:04:23,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 524 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 08:04:23,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-06 08:04:23,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 173. [2024-11-06 08:04:23,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 110 states have (on average 1.3909090909090909) internal successors, (153), 110 states have internal predecessors, (153), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-06 08:04:23,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 273 transitions. [2024-11-06 08:04:23,114 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 273 transitions. Word has length 195 [2024-11-06 08:04:23,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 08:04:23,115 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 273 transitions. [2024-11-06 08:04:23,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-06 08:04:23,116 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 273 transitions. [2024-11-06 08:04:23,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-06 08:04:23,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 08:04:23,119 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:23,131 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:04:23,320 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:04:23,321 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 08:04:23,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 08:04:23,322 INFO L85 PathProgramCache]: Analyzing trace with hash 417758262, now seen corresponding path program 1 times [2024-11-06 08:04:23,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 08:04:23,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1536118543] [2024-11-06 08:04:23,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 08:04:23,323 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:04:23,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 08:04:23,325 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:04:23,326 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:04:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 08:04:23,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-06 08:04:23,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 08:04:24,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 1034 proven. 84 refuted. 0 times theorem prover too weak. 622 trivial. 0 not checked. [2024-11-06 08:04:24,126 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 08:04:24,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 84 proven. 87 refuted. 0 times theorem prover too weak. 1569 trivial. 0 not checked. [2024-11-06 08:04:24,540 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 08:04:24,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1536118543] [2024-11-06 08:04:24,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1536118543] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 08:04:24,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 08:04:24,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2024-11-06 08:04:24,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894666081] [2024-11-06 08:04:24,541 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 08:04:24,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-06 08:04:24,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 08:04:24,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-06 08:04:24,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-06 08:04:24,546 INFO L87 Difference]: Start difference. First operand 173 states and 273 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 3 states have call successors, (53), 3 states have call predecessors, (53), 7 states have return successors, (54), 3 states have call predecessors, (54), 3 states have call successors, (54) [2024-11-06 08:04:25,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 08:04:25,792 INFO L93 Difference]: Finished difference Result 431 states and 654 transitions. [2024-11-06 08:04:25,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-06 08:04:25,793 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 3 states have call successors, (53), 3 states have call predecessors, (53), 7 states have return successors, (54), 3 states have call predecessors, (54), 3 states have call successors, (54) Word has length 195 [2024-11-06 08:04:25,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 08:04:25,798 INFO L225 Difference]: With dead ends: 431 [2024-11-06 08:04:25,798 INFO L226 Difference]: Without dead ends: 261 [2024-11-06 08:04:25,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 378 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=286, Invalid=644, Unknown=0, NotChecked=0, Total=930 [2024-11-06 08:04:25,806 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 250 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-06 08:04:25,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 358 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-06 08:04:25,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-11-06 08:04:25,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 187. [2024-11-06 08:04:25,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 120 states have (on average 1.275) internal successors, (153), 120 states have internal predecessors, (153), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-06 08:04:25,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 273 transitions. [2024-11-06 08:04:25,841 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 273 transitions. Word has length 195 [2024-11-06 08:04:25,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 08:04:25,842 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 273 transitions. [2024-11-06 08:04:25,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 3 states have call successors, (53), 3 states have call predecessors, (53), 7 states have return successors, (54), 3 states have call predecessors, (54), 3 states have call successors, (54) [2024-11-06 08:04:25,842 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 273 transitions. [2024-11-06 08:04:25,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-06 08:04:25,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 08:04:25,845 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:25,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-06 08:04:26,046 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:04:26,047 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 08:04:26,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 08:04:26,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1619744652, now seen corresponding path program 1 times [2024-11-06 08:04:26,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 08:04:26,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [437649792] [2024-11-06 08:04:26,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 08:04:26,049 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:04:26,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 08:04:26,052 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:04:26,053 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:04:26,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 08:04:26,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 08:04:26,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 08:04:26,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-06 08:04:26,662 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 08:04:26,662 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 08:04:26,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [437649792] [2024-11-06 08:04:26,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [437649792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 08:04:26,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 08:04:26,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 08:04:26,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475501869] [2024-11-06 08:04:26,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 08:04:26,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 08:04:26,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 08:04:26,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 08:04:26,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 08:04:26,665 INFO L87 Difference]: Start difference. First operand 187 states and 273 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-06 08:04:27,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 08:04:27,327 INFO L93 Difference]: Finished difference Result 464 states and 679 transitions. [2024-11-06 08:04:27,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 08:04:27,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 197 [2024-11-06 08:04:27,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 08:04:27,333 INFO L225 Difference]: With dead ends: 464 [2024-11-06 08:04:27,333 INFO L226 Difference]: Without dead ends: 280 [2024-11-06 08:04:27,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 08:04:27,338 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 38 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 08:04:27,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 290 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 08:04:27,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-11-06 08:04:27,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 278. [2024-11-06 08:04:27,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 178 states have (on average 1.2696629213483146) internal successors, (226), 178 states have internal predecessors, (226), 90 states have call successors, (90), 9 states have call predecessors, (90), 9 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-06 08:04:27,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 406 transitions. [2024-11-06 08:04:27,399 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 406 transitions. Word has length 197 [2024-11-06 08:04:27,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 08:04:27,400 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 406 transitions. [2024-11-06 08:04:27,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-06 08:04:27,401 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 406 transitions. [2024-11-06 08:04:27,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-06 08:04:27,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 08:04:27,404 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:27,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-06 08:04:27,605 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:04:27,607 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 08:04:27,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 08:04:27,608 INFO L85 PathProgramCache]: Analyzing trace with hash 31396750, now seen corresponding path program 1 times [2024-11-06 08:04:27,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 08:04:27,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [526979573] [2024-11-06 08:04:27,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 08:04:27,609 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:04:27,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 08:04:27,613 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:04:27,619 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:04:27,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 08:04:27,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 08:04:27,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 08:04:27,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-06 08:04:27,917 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 08:04:27,917 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 08:04:27,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [526979573] [2024-11-06 08:04:27,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [526979573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 08:04:27,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 08:04:27,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 08:04:27,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925185327] [2024-11-06 08:04:27,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 08:04:27,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 08:04:27,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 08:04:27,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 08:04:27,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 08:04:27,920 INFO L87 Difference]: Start difference. First operand 278 states and 406 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-06 08:04:28,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 08:04:28,134 INFO L93 Difference]: Finished difference Result 828 states and 1212 transitions. [2024-11-06 08:04:28,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 08:04:28,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 197 [2024-11-06 08:04:28,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 08:04:28,139 INFO L225 Difference]: With dead ends: 828 [2024-11-06 08:04:28,140 INFO L226 Difference]: Without dead ends: 553 [2024-11-06 08:04:28,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 195 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:04:28,142 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 127 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 08:04:28,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 357 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 08:04:28,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-11-06 08:04:28,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 281. [2024-11-06 08:04:28,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 181 states have (on average 1.2651933701657458) internal successors, (229), 181 states have internal predecessors, (229), 90 states have call successors, (90), 9 states have call predecessors, (90), 9 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-06 08:04:28,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 409 transitions. [2024-11-06 08:04:28,189 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 409 transitions. Word has length 197 [2024-11-06 08:04:28,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 08:04:28,190 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 409 transitions. [2024-11-06 08:04:28,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-06 08:04:28,190 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 409 transitions. [2024-11-06 08:04:28,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-06 08:04:28,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 08:04:28,194 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:28,209 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 (6)] Ended with exit code 0 [2024-11-06 08:04:28,395 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:04:28,395 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 08:04:28,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 08:04:28,396 INFO L85 PathProgramCache]: Analyzing trace with hash -979720500, now seen corresponding path program 1 times [2024-11-06 08:04:28,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 08:04:28,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1169566587] [2024-11-06 08:04:28,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 08:04:28,397 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:04:28,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 08:04:28,401 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:04:28,402 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:04:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 08:04:28,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-06 08:04:28,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 08:04:29,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 396 proven. 225 refuted. 0 times theorem prover too weak. 1119 trivial. 0 not checked. [2024-11-06 08:04:29,992 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 08:04:30,208 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 08:04:30,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1169566587] [2024-11-06 08:04:30,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1169566587] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 08:04:30,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135638460] [2024-11-06 08:04:30,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 08:04:30,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 08:04:30,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 08:04:30,235 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:04:30,239 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:04:30,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 08:04:30,387 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-06 08:04:30,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 08:04:31,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 857 proven. 33 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2024-11-06 08:04:31,003 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 08:04:31,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135638460] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 08:04:31,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 08:04:31,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 17 [2024-11-06 08:04:31,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609854968] [2024-11-06 08:04:31,239 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 08:04:31,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-06 08:04:31,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 08:04:31,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-06 08:04:31,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2024-11-06 08:04:31,241 INFO L87 Difference]: Start difference. First operand 281 states and 409 transitions. Second operand has 17 states, 17 states have (on average 6.647058823529412) internal successors, (113), 16 states have internal predecessors, (113), 6 states have call successors, (60), 6 states have call predecessors, (60), 8 states have return successors, (60), 5 states have call predecessors, (60), 6 states have call successors, (60) [2024-11-06 08:04:34,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 08:04:34,385 INFO L93 Difference]: Finished difference Result 714 states and 983 transitions. [2024-11-06 08:04:34,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-06 08:04:34,386 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.647058823529412) internal successors, (113), 16 states have internal predecessors, (113), 6 states have call successors, (60), 6 states have call predecessors, (60), 8 states have return successors, (60), 5 states have call predecessors, (60), 6 states have call successors, (60) Word has length 197 [2024-11-06 08:04:34,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 08:04:34,389 INFO L225 Difference]: With dead ends: 714 [2024-11-06 08:04:34,389 INFO L226 Difference]: Without dead ends: 436 [2024-11-06 08:04:34,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 432 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=488, Invalid=2062, Unknown=0, NotChecked=0, Total=2550 [2024-11-06 08:04:34,392 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 421 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 865 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-06 08:04:34,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 731 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 865 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-06 08:04:34,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2024-11-06 08:04:34,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 415. [2024-11-06 08:04:34,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 286 states have (on average 1.1713286713286712) internal successors, (335), 289 states have internal predecessors, (335), 102 states have call successors, (102), 26 states have call predecessors, (102), 26 states have return successors, (102), 99 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-06 08:04:34,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 539 transitions. [2024-11-06 08:04:34,443 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 539 transitions. Word has length 197 [2024-11-06 08:04:34,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 08:04:34,445 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 539 transitions. [2024-11-06 08:04:34,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.647058823529412) internal successors, (113), 16 states have internal predecessors, (113), 6 states have call successors, (60), 6 states have call predecessors, (60), 8 states have return successors, (60), 5 states have call predecessors, (60), 6 states have call successors, (60) [2024-11-06 08:04:34,446 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 539 transitions. [2024-11-06 08:04:34,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-06 08:04:34,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 08:04:34,450 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:34,464 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:04:34,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-06 08:04:34,851 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:04:34,851 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 08:04:34,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 08:04:34,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1576411344, now seen corresponding path program 1 times [2024-11-06 08:04:34,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 08:04:34,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [408394068] [2024-11-06 08:04:34,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 08:04:34,853 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:04:34,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 08:04:34,856 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:04:34,857 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:04:35,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 08:04:35,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-06 08:04:35,104 INFO L278 TraceCheckSpWp]: Computing forward predicates...