/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 WOLF -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-33.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-17387ad-m [2024-11-05 23:34:56,685 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 23:34:56,766 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-05 23:34:56,772 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 23:34:56,772 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 23:34:56,799 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 23:34:56,801 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 23:34:56,802 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 23:34:56,802 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 23:34:56,806 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 23:34:56,806 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 23:34:56,806 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 23:34:56,807 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 23:34:56,807 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 23:34:56,807 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 23:34:56,807 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 23:34:56,808 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 23:34:56,808 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-05 23:34:56,809 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-05 23:34:56,810 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 23:34:56,810 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 23:34:56,810 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 23:34:56,810 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 23:34:56,811 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 23:34:56,811 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 23:34:56,811 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 23:34:56,811 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 23:34:56,812 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-05 23:34:56,812 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 23:34:56,812 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 23:34:56,812 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 23:34:56,813 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 23:34:56,813 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 23:34:56,813 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 23:34:56,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 23:34:56,813 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 23:34:56,814 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 23:34:56,814 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 23:34:56,816 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 23:34:56,816 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 23:34:56,816 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 23:34:56,816 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 23:34:56,817 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 23:34:56,817 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 23:34:56,817 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 -> WOLF [2024-11-05 23:34:57,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 23:34:57,060 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 23:34:57,063 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 23:34:57,063 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 23:34:57,064 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 23:34:57,065 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-33.i [2024-11-05 23:34:58,428 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 23:34:58,607 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 23:34:58,608 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-33.i [2024-11-05 23:34:58,616 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55e953b8d/bf1214547036426ebb7736821a3b78dd/FLAG26d3bd4b1 [2024-11-05 23:34:59,009 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55e953b8d/bf1214547036426ebb7736821a3b78dd [2024-11-05 23:34:59,011 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 23:34:59,012 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 23:34:59,013 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 23:34:59,013 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 23:34:59,018 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 23:34:59,019 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 11:34:59" (1/1) ... [2024-11-05 23:34:59,020 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a358398 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:34:59, skipping insertion in model container [2024-11-05 23:34:59,020 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 11:34:59" (1/1) ... [2024-11-05 23:34:59,043 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 23:34:59,209 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-33.i[915,928] [2024-11-05 23:34:59,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 23:34:59,260 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 23:34:59,272 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-33.i[915,928] [2024-11-05 23:34:59,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 23:34:59,308 INFO L204 MainTranslator]: Completed translation [2024-11-05 23:34:59,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:34:59 WrapperNode [2024-11-05 23:34:59,311 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 23:34:59,312 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 23:34:59,312 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 23:34:59,312 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 23:34:59,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:34:59" (1/1) ... [2024-11-05 23:34:59,326 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:34:59" (1/1) ... [2024-11-05 23:34:59,346 INFO L138 Inliner]: procedures = 27, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 89 [2024-11-05 23:34:59,347 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 23:34:59,348 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 23:34:59,348 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 23:34:59,348 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 23:34:59,358 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:34:59" (1/1) ... [2024-11-05 23:34:59,358 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:34:59" (1/1) ... [2024-11-05 23:34:59,361 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:34:59" (1/1) ... [2024-11-05 23:34:59,371 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-05 23:34:59,371 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:34:59" (1/1) ... [2024-11-05 23:34:59,372 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:34:59" (1/1) ... [2024-11-05 23:34:59,378 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:34:59" (1/1) ... [2024-11-05 23:34:59,385 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:34:59" (1/1) ... [2024-11-05 23:34:59,387 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:34:59" (1/1) ... [2024-11-05 23:34:59,391 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:34:59" (1/1) ... [2024-11-05 23:34:59,394 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 23:34:59,395 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 23:34:59,399 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 23:34:59,399 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 23:34:59,400 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:34:59" (1/1) ... [2024-11-05 23:34:59,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 23:34:59,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 23:34:59,434 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-05 23:34:59,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-05 23:34:59,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 23:34:59,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 23:34:59,462 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-05 23:34:59,462 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-05 23:34:59,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 23:34:59,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 23:34:59,526 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 23:34:59,527 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 23:34:59,802 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-05 23:34:59,802 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 23:34:59,813 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 23:34:59,813 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-05 23:34:59,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 11:34:59 BoogieIcfgContainer [2024-11-05 23:34:59,813 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 23:34:59,815 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 23:34:59,815 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 23:34:59,817 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 23:34:59,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 11:34:59" (1/3) ... [2024-11-05 23:34:59,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c0e2069 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 11:34:59, skipping insertion in model container [2024-11-05 23:34:59,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:34:59" (2/3) ... [2024-11-05 23:34:59,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c0e2069 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 11:34:59, skipping insertion in model container [2024-11-05 23:34:59,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 11:34:59" (3/3) ... [2024-11-05 23:34:59,819 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-33.i [2024-11-05 23:34:59,832 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 23:34:59,832 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 23:34:59,877 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 23:34:59,881 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;@27e1efe2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 23:34:59,882 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 23:34:59,885 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-05 23:34:59,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-05 23:34:59,894 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:34:59,894 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 23:34:59,895 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:34:59,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:34:59,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1891658366, now seen corresponding path program 1 times [2024-11-05 23:34:59,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:34:59,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [359139982] [2024-11-05 23:34:59,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:34:59,914 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 23:34:59,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:34:59,919 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 23:34:59,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-05 23:35:00,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:35:00,104 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-05 23:35:00,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:35:00,152 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-05 23:35:00,152 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-05 23:35:00,153 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:35:00,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [359139982] [2024-11-05 23:35:00,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [359139982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-05 23:35:00,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-05 23:35:00,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-05 23:35:00,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517310651] [2024-11-05 23:35:00,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 23:35:00,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-05 23:35:00,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 23:35:00,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-05 23:35:00,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 23:35:00,185 INFO L87 Difference]: Start difference. First operand has 40 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-05 23:35:00,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 23:35:00,208 INFO L93 Difference]: Finished difference Result 73 states and 114 transitions. [2024-11-05 23:35:00,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-05 23:35:00,211 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 60 [2024-11-05 23:35:00,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 23:35:00,242 INFO L225 Difference]: With dead ends: 73 [2024-11-05 23:35:00,242 INFO L226 Difference]: Without dead ends: 36 [2024-11-05 23:35:00,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 23:35:00,256 INFO L432 NwaCegarLoop]: 48 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, 48 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 23:35:00,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 23:35:00,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-05 23:35:00,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-05 23:35:00,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-05 23:35:00,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2024-11-05 23:35:00,298 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 60 [2024-11-05 23:35:00,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 23:35:00,299 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2024-11-05 23:35:00,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-05 23:35:00,299 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2024-11-05 23:35:00,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-05 23:35:00,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:35:00,304 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 23:35:00,313 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 (2)] Forceful destruction successful, exit code 0 [2024-11-05 23:35:00,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 23:35:00,509 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:35:00,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:35:00,510 INFO L85 PathProgramCache]: Analyzing trace with hash -458830138, now seen corresponding path program 1 times [2024-11-05 23:35:00,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:35:00,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2102796849] [2024-11-05 23:35:00,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:35:00,511 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 23:35:00,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:35:00,516 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 23:35:00,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-05 23:35:00,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:35:00,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 23:35:00,643 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:35:00,846 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-05 23:35:00,847 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-05 23:35:00,847 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:35:00,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2102796849] [2024-11-05 23:35:00,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2102796849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-05 23:35:00,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-05 23:35:00,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-05 23:35:00,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455094220] [2024-11-05 23:35:00,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 23:35:00,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-05 23:35:00,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 23:35:00,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-05 23:35:00,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-05 23:35:00,852 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-05 23:35:01,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 23:35:01,111 INFO L93 Difference]: Finished difference Result 112 states and 149 transitions. [2024-11-05 23:35:01,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-05 23:35:01,115 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 60 [2024-11-05 23:35:01,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 23:35:01,117 INFO L225 Difference]: With dead ends: 112 [2024-11-05 23:35:01,118 INFO L226 Difference]: Without dead ends: 79 [2024-11-05 23:35:01,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-05 23:35:01,121 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 58 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 23:35:01,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 171 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 23:35:01,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-05 23:35:01,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 67. [2024-11-05 23:35:01,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-05 23:35:01,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 91 transitions. [2024-11-05 23:35:01,147 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 91 transitions. Word has length 60 [2024-11-05 23:35:01,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 23:35:01,148 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 91 transitions. [2024-11-05 23:35:01,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-05 23:35:01,148 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 91 transitions. [2024-11-05 23:35:01,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-05 23:35:01,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:35:01,150 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 23:35:01,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-05 23:35:01,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 23:35:01,351 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:35:01,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:35:01,352 INFO L85 PathProgramCache]: Analyzing trace with hash -851857148, now seen corresponding path program 1 times [2024-11-05 23:35:01,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:35:01,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [901927980] [2024-11-05 23:35:01,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:35:01,353 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 23:35:01,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:35:01,356 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 23:35:01,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-05 23:35:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:35:01,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-05 23:35:01,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:35:01,635 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-05 23:35:01,635 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-05 23:35:01,635 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:35:01,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [901927980] [2024-11-05 23:35:01,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [901927980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-05 23:35:01,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-05 23:35:01,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-05 23:35:01,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276859704] [2024-11-05 23:35:01,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 23:35:01,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-05 23:35:01,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 23:35:01,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-05 23:35:01,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-05 23:35:01,640 INFO L87 Difference]: Start difference. First operand 67 states and 91 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-05 23:35:02,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 23:35:02,068 INFO L93 Difference]: Finished difference Result 151 states and 195 transitions. [2024-11-05 23:35:02,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-05 23:35:02,072 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 60 [2024-11-05 23:35:02,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 23:35:02,074 INFO L225 Difference]: With dead ends: 151 [2024-11-05 23:35:02,074 INFO L226 Difference]: Without dead ends: 87 [2024-11-05 23:35:02,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2024-11-05 23:35:02,076 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 89 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-05 23:35:02,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 127 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-05 23:35:02,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-05 23:35:02,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2024-11-05 23:35:02,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 60 states have (on average 1.15) internal successors, (69), 60 states have internal predecessors, (69), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-05 23:35:02,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2024-11-05 23:35:02,094 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 60 [2024-11-05 23:35:02,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 23:35:02,094 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2024-11-05 23:35:02,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-05 23:35:02,094 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2024-11-05 23:35:02,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-05 23:35:02,095 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:35:02,095 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 23:35:02,103 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-05 23:35:02,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 23:35:02,297 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:35:02,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:35:02,297 INFO L85 PathProgramCache]: Analyzing trace with hash 237329020, now seen corresponding path program 1 times [2024-11-05 23:35:02,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:35:02,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1919034649] [2024-11-05 23:35:02,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:35:02,299 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 23:35:02,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:35:02,302 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 23:35:02,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-05 23:35:02,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:35:02,436 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-05 23:35:02,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:35:02,621 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-05 23:35:02,622 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-05 23:35:02,622 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:35:02,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1919034649] [2024-11-05 23:35:02,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1919034649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-05 23:35:02,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-05 23:35:02,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-05 23:35:02,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643194295] [2024-11-05 23:35:02,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 23:35:02,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 23:35:02,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 23:35:02,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 23:35:02,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-05 23:35:02,626 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-05 23:35:02,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 23:35:02,955 INFO L93 Difference]: Finished difference Result 267 states and 324 transitions. [2024-11-05 23:35:02,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-05 23:35:02,955 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 61 [2024-11-05 23:35:02,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 23:35:02,958 INFO L225 Difference]: With dead ends: 267 [2024-11-05 23:35:02,958 INFO L226 Difference]: Without dead ends: 187 [2024-11-05 23:35:02,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-05 23:35:02,963 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 72 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 23:35:02,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 247 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 23:35:02,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-05 23:35:02,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 121. [2024-11-05 23:35:02,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 87 states have (on average 1.1264367816091954) internal successors, (98), 87 states have internal predecessors, (98), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-05 23:35:03,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 146 transitions. [2024-11-05 23:35:03,001 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 146 transitions. Word has length 61 [2024-11-05 23:35:03,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 23:35:03,002 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 146 transitions. [2024-11-05 23:35:03,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-05 23:35:03,002 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 146 transitions. [2024-11-05 23:35:03,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-05 23:35:03,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:35:03,003 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 23:35:03,010 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-05 23:35:03,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 23:35:03,208 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:35:03,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:35:03,208 INFO L85 PathProgramCache]: Analyzing trace with hash 239176062, now seen corresponding path program 1 times [2024-11-05 23:35:03,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:35:03,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [329241362] [2024-11-05 23:35:03,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:35:03,209 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 23:35:03,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:35:03,211 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-05 23:35:03,212 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-05 23:35:03,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:35:03,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-05 23:35:03,322 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:35:18,286 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-05 23:35:18,286 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-05 23:35:18,287 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:35:18,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [329241362] [2024-11-05 23:35:18,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [329241362] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-05 23:35:18,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-05 23:35:18,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-05 23:35:18,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824215841] [2024-11-05 23:35:18,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 23:35:18,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-05 23:35:18,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 23:35:18,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-05 23:35:18,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-05 23:35:18,289 INFO L87 Difference]: Start difference. First operand 121 states and 146 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-05 23:35:18,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 23:35:18,636 INFO L93 Difference]: Finished difference Result 128 states and 153 transitions. [2024-11-05 23:35:18,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 23:35:18,637 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 61 [2024-11-05 23:35:18,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 23:35:18,638 INFO L225 Difference]: With dead ends: 128 [2024-11-05 23:35:18,638 INFO L226 Difference]: Without dead ends: 126 [2024-11-05 23:35:18,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-05 23:35:18,640 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 34 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 23:35:18,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 190 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 23:35:18,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-05 23:35:18,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2024-11-05 23:35:18,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 90 states have (on average 1.1222222222222222) internal successors, (101), 90 states have internal predecessors, (101), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-05 23:35:18,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 149 transitions. [2024-11-05 23:35:18,660 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 149 transitions. Word has length 61 [2024-11-05 23:35:18,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 23:35:18,662 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 149 transitions. [2024-11-05 23:35:18,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-05 23:35:18,662 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 149 transitions. [2024-11-05 23:35:18,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-05 23:35:18,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:35:18,663 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 23:35:18,671 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-05 23:35:18,864 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-05 23:35:18,864 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:35:18,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:35:18,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1560266929, now seen corresponding path program 1 times [2024-11-05 23:35:18,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:35:18,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [662772503] [2024-11-05 23:35:18,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:35:18,866 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 23:35:18,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:35:18,869 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-05 23:35:18,870 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-05 23:35:18,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:35:18,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 23:35:18,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:35:18,994 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-05 23:35:18,994 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-05 23:35:18,994 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:35:18,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [662772503] [2024-11-05 23:35:18,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [662772503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-05 23:35:18,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-05 23:35:18,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-05 23:35:18,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359028719] [2024-11-05 23:35:18,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 23:35:18,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-05 23:35:18,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 23:35:18,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-05 23:35:18,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-05 23:35:18,996 INFO L87 Difference]: Start difference. First operand 124 states and 149 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-05 23:35:19,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 23:35:19,067 INFO L93 Difference]: Finished difference Result 134 states and 159 transitions. [2024-11-05 23:35:19,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-05 23:35:19,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 62 [2024-11-05 23:35:19,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 23:35:19,073 INFO L225 Difference]: With dead ends: 134 [2024-11-05 23:35:19,073 INFO L226 Difference]: Without dead ends: 90 [2024-11-05 23:35:19,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 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-05 23:35:19,075 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 5 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 23:35:19,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 77 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 23:35:19,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-05 23:35:19,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 82. [2024-11-05 23:35:19,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 59 states have internal predecessors, (63), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-05 23:35:19,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 95 transitions. [2024-11-05 23:35:19,097 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 95 transitions. Word has length 62 [2024-11-05 23:35:19,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 23:35:19,098 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 95 transitions. [2024-11-05 23:35:19,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-05 23:35:19,098 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 95 transitions. [2024-11-05 23:35:19,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-05 23:35:19,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:35:19,100 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 23:35:19,106 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 (7)] Forceful destruction successful, exit code 0 [2024-11-05 23:35:19,300 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 [2024-11-05 23:35:19,301 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:35:19,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:35:19,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1133709702, now seen corresponding path program 1 times [2024-11-05 23:35:19,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:35:19,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1974916587] [2024-11-05 23:35:19,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:35:19,302 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 23:35:19,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:35:19,303 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 23:35:19,304 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 (8)] Waiting until timeout for monitored process [2024-11-05 23:35:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:35:19,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-05 23:35:19,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:35:41,169 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 346 proven. 14 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-05 23:35:41,169 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 23:35:58,339 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:35:58,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1974916587] [2024-11-05 23:35:58,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1974916587] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-05 23:35:58,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [931223289] [2024-11-05 23:35:58,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:35:58,340 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-05 23:35:58,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-05 23:35:58,352 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-05 23:35:58,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-05 23:35:58,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:35:58,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-05 23:35:58,705 INFO L278 TraceCheckSpWp]: Computing forward predicates...