/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 17:59:59,218 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 17:59:59,255 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-16 17:59:59,258 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 17:59:59,259 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 17:59:59,273 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 17:59:59,274 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 17:59:59,274 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 17:59:59,275 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 17:59:59,275 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 17:59:59,275 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 17:59:59,276 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 17:59:59,276 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 17:59:59,276 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 17:59:59,277 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 17:59:59,277 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 17:59:59,277 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 17:59:59,278 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 17:59:59,278 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 17:59:59,278 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 17:59:59,278 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 17:59:59,279 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 17:59:59,279 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 17:59:59,279 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 17:59:59,280 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 17:59:59,280 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 17:59:59,280 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 17:59:59,280 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 17:59:59,281 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 17:59:59,281 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 17:59:59,281 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 17:59:59,281 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 17:59:59,281 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 17:59:59,282 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 17:59:59,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 17:59:59,282 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 17:59:59,282 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 17:59:59,282 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 17:59:59,282 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 17:59:59,283 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 17:59:59,283 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 17:59:59,283 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 17:59:59,283 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 17:59:59,283 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 17:59:59,283 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 17:59:59,283 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 17:59:59,283 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 [2023-12-16 17:59:59,422 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 17:59:59,435 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 17:59:59,437 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 17:59:59,438 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 17:59:59,438 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 17:59:59,439 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2023-12-16 18:00:00,567 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 18:00:00,723 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 18:00:00,723 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2023-12-16 18:00:00,730 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94671aa49/3acf2b95bd634c89b991c3aff16986a3/FLAG16373feb8 [2023-12-16 18:00:00,743 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94671aa49/3acf2b95bd634c89b991c3aff16986a3 [2023-12-16 18:00:00,745 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 18:00:00,746 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 18:00:00,747 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 18:00:00,747 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 18:00:00,750 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 18:00:00,750 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 06:00:00" (1/1) ... [2023-12-16 18:00:00,751 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19d229b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:00:00, skipping insertion in model container [2023-12-16 18:00:00,751 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 06:00:00" (1/1) ... [2023-12-16 18:00:00,780 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 18:00:00,902 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c[6691,6704] [2023-12-16 18:00:00,906 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 18:00:00,914 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 18:00:00,955 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c[6691,6704] [2023-12-16 18:00:00,956 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 18:00:00,967 INFO L206 MainTranslator]: Completed translation [2023-12-16 18:00:00,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:00:00 WrapperNode [2023-12-16 18:00:00,968 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 18:00:00,969 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 18:00:00,969 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 18:00:00,969 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 18:00:00,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:00:00" (1/1) ... [2023-12-16 18:00:00,981 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:00:00" (1/1) ... [2023-12-16 18:00:00,998 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 229 [2023-12-16 18:00:00,998 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 18:00:00,999 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 18:00:00,999 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 18:00:00,999 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 18:00:01,007 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:00:00" (1/1) ... [2023-12-16 18:00:01,008 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:00:00" (1/1) ... [2023-12-16 18:00:01,011 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:00:00" (1/1) ... [2023-12-16 18:00:01,021 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]. [2023-12-16 18:00:01,021 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:00:00" (1/1) ... [2023-12-16 18:00:01,022 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:00:00" (1/1) ... [2023-12-16 18:00:01,027 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:00:00" (1/1) ... [2023-12-16 18:00:01,030 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:00:00" (1/1) ... [2023-12-16 18:00:01,031 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:00:00" (1/1) ... [2023-12-16 18:00:01,032 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:00:00" (1/1) ... [2023-12-16 18:00:01,034 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 18:00:01,035 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 18:00:01,035 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 18:00:01,035 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 18:00:01,036 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:00:00" (1/1) ... [2023-12-16 18:00:01,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 18:00:01,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 18:00:01,088 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) [2023-12-16 18:00:01,091 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 [2023-12-16 18:00:01,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 18:00:01,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 18:00:01,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 18:00:01,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 18:00:01,218 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 18:00:01,220 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 18:00:01,494 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 18:00:01,519 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 18:00:01,519 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 18:00:01,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 06:00:01 BoogieIcfgContainer [2023-12-16 18:00:01,520 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 18:00:01,522 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 18:00:01,522 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 18:00:01,524 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 18:00:01,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 06:00:00" (1/3) ... [2023-12-16 18:00:01,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@266bb4cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 06:00:01, skipping insertion in model container [2023-12-16 18:00:01,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:00:00" (2/3) ... [2023-12-16 18:00:01,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@266bb4cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 06:00:01, skipping insertion in model container [2023-12-16 18:00:01,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 06:00:01" (3/3) ... [2023-12-16 18:00:01,526 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2023-12-16 18:00:01,540 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 18:00:01,541 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 18:00:01,584 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 18:00:01,589 INFO L357 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, mHoare=true, 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;@dc3f213, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 18:00:01,589 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 18:00:01,593 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 59 states have (on average 1.7627118644067796) internal successors, (104), 60 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:01,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-16 18:00:01,600 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:00:01,600 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:00:01,601 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:00:01,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:00:01,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1331125770, now seen corresponding path program 1 times [2023-12-16 18:00:01,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:00:01,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [186334226] [2023-12-16 18:00:01,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:00:01,621 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 [2023-12-16 18:00:01,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:00:01,637 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) [2023-12-16 18:00:01,701 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 [2023-12-16 18:00:01,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:00:01,759 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 18:00:01,765 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:00:01,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:00:01,822 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:00:01,823 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:00:01,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [186334226] [2023-12-16 18:00:01,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [186334226] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:00:01,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:00:01,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 18:00:01,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001190913] [2023-12-16 18:00:01,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:00:01,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 18:00:01,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:00:01,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 18:00:01,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 18:00:01,874 INFO L87 Difference]: Start difference. First operand has 61 states, 59 states have (on average 1.7627118644067796) internal successors, (104), 60 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:01,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:00:01,965 INFO L93 Difference]: Finished difference Result 142 states and 237 transitions. [2023-12-16 18:00:01,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 18:00:01,967 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-12-16 18:00:01,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:00:01,975 INFO L225 Difference]: With dead ends: 142 [2023-12-16 18:00:01,976 INFO L226 Difference]: Without dead ends: 97 [2023-12-16 18:00:01,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 18:00:01,982 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 60 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 18:00:01,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 264 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 18:00:01,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-12-16 18:00:02,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 59. [2023-12-16 18:00:02,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 58 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:02,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2023-12-16 18:00:02,019 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 22 [2023-12-16 18:00:02,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:00:02,019 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2023-12-16 18:00:02,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:02,019 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2023-12-16 18:00:02,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-16 18:00:02,020 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:00:02,021 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:00:02,035 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 [2023-12-16 18:00:02,224 WARN L477 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 [2023-12-16 18:00:02,225 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:00:02,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:00:02,226 INFO L85 PathProgramCache]: Analyzing trace with hash 855144128, now seen corresponding path program 1 times [2023-12-16 18:00:02,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:00:02,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1730986493] [2023-12-16 18:00:02,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:00:02,228 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 [2023-12-16 18:00:02,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:00:02,230 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) [2023-12-16 18:00:02,242 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 [2023-12-16 18:00:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:00:02,357 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 18:00:02,361 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:00:02,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:00:02,450 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:00:02,450 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:00:02,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1730986493] [2023-12-16 18:00:02,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1730986493] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:00:02,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:00:02,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 18:00:02,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232522905] [2023-12-16 18:00:02,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:00:02,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 18:00:02,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:00:02,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 18:00:02,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 18:00:02,453 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:02,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:00:02,487 INFO L93 Difference]: Finished difference Result 127 states and 190 transitions. [2023-12-16 18:00:02,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 18:00:02,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2023-12-16 18:00:02,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:00:02,489 INFO L225 Difference]: With dead ends: 127 [2023-12-16 18:00:02,489 INFO L226 Difference]: Without dead ends: 89 [2023-12-16 18:00:02,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 18:00:02,491 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 45 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 18:00:02,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 167 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 18:00:02,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-16 18:00:02,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2023-12-16 18:00:02,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.4767441860465116) internal successors, (127), 86 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:02,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 127 transitions. [2023-12-16 18:00:02,499 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 127 transitions. Word has length 38 [2023-12-16 18:00:02,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:00:02,499 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 127 transitions. [2023-12-16 18:00:02,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:02,500 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 127 transitions. [2023-12-16 18:00:02,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-16 18:00:02,501 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:00:02,501 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:00:02,516 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 [2023-12-16 18:00:02,716 WARN L477 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 [2023-12-16 18:00:02,716 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:00:02,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:00:02,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1766348127, now seen corresponding path program 1 times [2023-12-16 18:00:02,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:00:02,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [793698520] [2023-12-16 18:00:02,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:00:02,718 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 [2023-12-16 18:00:02,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:00:02,719 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) [2023-12-16 18:00:02,732 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 [2023-12-16 18:00:02,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:00:02,773 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 18:00:02,775 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:00:02,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:00:02,826 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:00:02,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:00:02,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [793698520] [2023-12-16 18:00:02,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [793698520] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:00:02,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:00:02,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 18:00:02,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288472754] [2023-12-16 18:00:02,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:00:02,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 18:00:02,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:00:02,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 18:00:02,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 18:00:02,833 INFO L87 Difference]: Start difference. First operand 87 states and 127 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:02,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:00:02,856 INFO L93 Difference]: Finished difference Result 203 states and 311 transitions. [2023-12-16 18:00:02,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 18:00:02,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2023-12-16 18:00:02,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:00:02,860 INFO L225 Difference]: With dead ends: 203 [2023-12-16 18:00:02,861 INFO L226 Difference]: Without dead ends: 137 [2023-12-16 18:00:02,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 18:00:02,862 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 41 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 18:00:02,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 164 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 18:00:02,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-12-16 18:00:02,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2023-12-16 18:00:02,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 1.507462686567164) internal successors, (202), 134 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:02,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 202 transitions. [2023-12-16 18:00:02,870 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 202 transitions. Word has length 38 [2023-12-16 18:00:02,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:00:02,870 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 202 transitions. [2023-12-16 18:00:02,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:02,870 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 202 transitions. [2023-12-16 18:00:02,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-16 18:00:02,871 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:00:02,871 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:00:02,892 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 [2023-12-16 18:00:03,077 WARN L477 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 [2023-12-16 18:00:03,077 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:00:03,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:00:03,078 INFO L85 PathProgramCache]: Analyzing trace with hash -2141824130, now seen corresponding path program 1 times [2023-12-16 18:00:03,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:00:03,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1437645760] [2023-12-16 18:00:03,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:00:03,078 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 [2023-12-16 18:00:03,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:00:03,101 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) [2023-12-16 18:00:03,105 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 [2023-12-16 18:00:03,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:00:03,148 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 18:00:03,155 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:00:03,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:00:03,362 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:00:03,363 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:00:03,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1437645760] [2023-12-16 18:00:03,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1437645760] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:00:03,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:00:03,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 18:00:03,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167964716] [2023-12-16 18:00:03,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:00:03,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 18:00:03,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:00:03,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 18:00:03,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-16 18:00:03,364 INFO L87 Difference]: Start difference. First operand 135 states and 202 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:03,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:00:03,427 INFO L93 Difference]: Finished difference Result 591 states and 926 transitions. [2023-12-16 18:00:03,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 18:00:03,428 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2023-12-16 18:00:03,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:00:03,429 INFO L225 Difference]: With dead ends: 591 [2023-12-16 18:00:03,429 INFO L226 Difference]: Without dead ends: 477 [2023-12-16 18:00:03,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-16 18:00:03,431 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 165 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 18:00:03,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 409 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 18:00:03,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2023-12-16 18:00:03,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 247. [2023-12-16 18:00:03,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 246 states have (on average 1.5203252032520325) internal successors, (374), 246 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:03,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 374 transitions. [2023-12-16 18:00:03,445 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 374 transitions. Word has length 38 [2023-12-16 18:00:03,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:00:03,445 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 374 transitions. [2023-12-16 18:00:03,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:03,445 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 374 transitions. [2023-12-16 18:00:03,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-16 18:00:03,446 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:00:03,446 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:00:03,448 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 [2023-12-16 18:00:03,649 WARN L477 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 [2023-12-16 18:00:03,649 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:00:03,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:00:03,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1985069537, now seen corresponding path program 1 times [2023-12-16 18:00:03,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:00:03,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [143800453] [2023-12-16 18:00:03,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:00:03,650 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 [2023-12-16 18:00:03,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:00:03,658 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) [2023-12-16 18:00:03,663 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 [2023-12-16 18:00:03,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:00:03,701 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 18:00:03,703 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:00:03,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:00:03,719 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:00:03,719 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:00:03,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [143800453] [2023-12-16 18:00:03,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [143800453] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:00:03,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:00:03,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 18:00:03,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780240696] [2023-12-16 18:00:03,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:00:03,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 18:00:03,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:00:03,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 18:00:03,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 18:00:03,720 INFO L87 Difference]: Start difference. First operand 247 states and 374 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:03,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:00:03,739 INFO L93 Difference]: Finished difference Result 273 states and 407 transitions. [2023-12-16 18:00:03,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 18:00:03,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-12-16 18:00:03,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:00:03,741 INFO L225 Difference]: With dead ends: 273 [2023-12-16 18:00:03,741 INFO L226 Difference]: Without dead ends: 271 [2023-12-16 18:00:03,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 18:00:03,742 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 1 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 18:00:03,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 227 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 18:00:03,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2023-12-16 18:00:03,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 263. [2023-12-16 18:00:03,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 262 states have (on average 1.4885496183206106) internal successors, (390), 262 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:03,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 390 transitions. [2023-12-16 18:00:03,751 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 390 transitions. Word has length 39 [2023-12-16 18:00:03,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:00:03,752 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 390 transitions. [2023-12-16 18:00:03,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:03,752 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 390 transitions. [2023-12-16 18:00:03,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-16 18:00:03,752 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:00:03,753 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:00:03,757 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 [2023-12-16 18:00:03,955 WARN L477 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 [2023-12-16 18:00:03,955 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:00:03,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:00:03,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1406583098, now seen corresponding path program 1 times [2023-12-16 18:00:03,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:00:03,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [591509300] [2023-12-16 18:00:03,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:00:03,956 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 [2023-12-16 18:00:03,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:00:03,957 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) [2023-12-16 18:00:03,981 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 [2023-12-16 18:00:03,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:00:03,998 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 18:00:03,999 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:00:04,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:00:04,040 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:00:04,040 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:00:04,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [591509300] [2023-12-16 18:00:04,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [591509300] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:00:04,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:00:04,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 18:00:04,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192062702] [2023-12-16 18:00:04,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:00:04,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 18:00:04,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:00:04,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 18:00:04,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 18:00:04,042 INFO L87 Difference]: Start difference. First operand 263 states and 390 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:04,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:00:04,056 INFO L93 Difference]: Finished difference Result 691 states and 1032 transitions. [2023-12-16 18:00:04,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 18:00:04,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2023-12-16 18:00:04,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:00:04,058 INFO L225 Difference]: With dead ends: 691 [2023-12-16 18:00:04,059 INFO L226 Difference]: Without dead ends: 449 [2023-12-16 18:00:04,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 18:00:04,060 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 34 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 18:00:04,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 137 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 18:00:04,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2023-12-16 18:00:04,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 447. [2023-12-16 18:00:04,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 446 states have (on average 1.4663677130044843) internal successors, (654), 446 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:04,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 654 transitions. [2023-12-16 18:00:04,071 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 654 transitions. Word has length 40 [2023-12-16 18:00:04,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:00:04,071 INFO L495 AbstractCegarLoop]: Abstraction has 447 states and 654 transitions. [2023-12-16 18:00:04,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:04,072 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 654 transitions. [2023-12-16 18:00:04,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-16 18:00:04,072 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:00:04,073 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:00:04,091 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 [2023-12-16 18:00:04,275 WARN L477 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 [2023-12-16 18:00:04,275 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:00:04,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:00:04,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1835898686, now seen corresponding path program 1 times [2023-12-16 18:00:04,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:00:04,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1009679563] [2023-12-16 18:00:04,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:00:04,276 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 [2023-12-16 18:00:04,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:00:04,277 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) [2023-12-16 18:00:04,279 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 [2023-12-16 18:00:04,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:00:04,326 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 18:00:04,327 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:00:04,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:00:04,353 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:00:04,353 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:00:04,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1009679563] [2023-12-16 18:00:04,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1009679563] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:00:04,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:00:04,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 18:00:04,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196208] [2023-12-16 18:00:04,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:00:04,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 18:00:04,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:00:04,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 18:00:04,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 18:00:04,355 INFO L87 Difference]: Start difference. First operand 447 states and 654 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:04,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:00:04,375 INFO L93 Difference]: Finished difference Result 877 states and 1299 transitions. [2023-12-16 18:00:04,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 18:00:04,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2023-12-16 18:00:04,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:00:04,380 INFO L225 Difference]: With dead ends: 877 [2023-12-16 18:00:04,380 INFO L226 Difference]: Without dead ends: 635 [2023-12-16 18:00:04,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 18:00:04,381 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 49 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 18:00:04,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 177 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 18:00:04,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2023-12-16 18:00:04,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 633. [2023-12-16 18:00:04,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 632 states have (on average 1.4556962025316456) internal successors, (920), 632 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:04,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 920 transitions. [2023-12-16 18:00:04,397 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 920 transitions. Word has length 40 [2023-12-16 18:00:04,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:00:04,427 INFO L495 AbstractCegarLoop]: Abstraction has 633 states and 920 transitions. [2023-12-16 18:00:04,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:04,427 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 920 transitions. [2023-12-16 18:00:04,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-16 18:00:04,432 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:00:04,432 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:00:04,437 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 (8)] Forceful destruction successful, exit code 0 [2023-12-16 18:00:04,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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 [2023-12-16 18:00:04,641 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:00:04,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:00:04,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1126850639, now seen corresponding path program 1 times [2023-12-16 18:00:04,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:00:04,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2143408739] [2023-12-16 18:00:04,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:00:04,642 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 [2023-12-16 18:00:04,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:00:04,653 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) [2023-12-16 18:00:04,654 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 [2023-12-16 18:00:04,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:00:04,744 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 18:00:04,748 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:00:05,164 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:00:05,164 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 18:00:05,482 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:00:05,482 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:00:05,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2143408739] [2023-12-16 18:00:05,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2143408739] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 18:00:05,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 18:00:05,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-12-16 18:00:05,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602408488] [2023-12-16 18:00:05,484 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 18:00:05,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-16 18:00:05,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:00:05,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-16 18:00:05,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2023-12-16 18:00:05,490 INFO L87 Difference]: Start difference. First operand 633 states and 920 transitions. Second operand has 16 states, 16 states have (on average 6.25) internal successors, (100), 15 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:06,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:00:06,035 INFO L93 Difference]: Finished difference Result 2103 states and 3027 transitions. [2023-12-16 18:00:06,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-16 18:00:06,035 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.25) internal successors, (100), 15 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2023-12-16 18:00:06,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:00:06,040 INFO L225 Difference]: With dead ends: 2103 [2023-12-16 18:00:06,040 INFO L226 Difference]: Without dead ends: 1677 [2023-12-16 18:00:06,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=186, Invalid=516, Unknown=0, NotChecked=0, Total=702 [2023-12-16 18:00:06,041 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 492 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 18:00:06,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 474 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 18:00:06,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1677 states. [2023-12-16 18:00:06,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1677 to 1333. [2023-12-16 18:00:06,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1333 states, 1332 states have (on average 1.4504504504504505) internal successors, (1932), 1332 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:06,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1932 transitions. [2023-12-16 18:00:06,079 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1932 transitions. Word has length 58 [2023-12-16 18:00:06,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:00:06,079 INFO L495 AbstractCegarLoop]: Abstraction has 1333 states and 1932 transitions. [2023-12-16 18:00:06,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.25) internal successors, (100), 15 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:06,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1932 transitions. [2023-12-16 18:00:06,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-16 18:00:06,080 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:00:06,080 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:00:06,085 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 (9)] Forceful destruction successful, exit code 0 [2023-12-16 18:00:06,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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 [2023-12-16 18:00:06,283 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:00:06,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:00:06,284 INFO L85 PathProgramCache]: Analyzing trace with hash -454931966, now seen corresponding path program 1 times [2023-12-16 18:00:06,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:00:06,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1083710273] [2023-12-16 18:00:06,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:00:06,284 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 [2023-12-16 18:00:06,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:00:06,325 INFO L229 MonitoredProcess]: Starting monitored process 10 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) [2023-12-16 18:00:06,351 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 (10)] Waiting until timeout for monitored process [2023-12-16 18:00:06,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:00:06,371 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 18:00:06,372 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:00:06,768 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:00:06,769 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 18:00:06,922 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:00:06,923 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:00:06,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1083710273] [2023-12-16 18:00:06,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1083710273] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 18:00:06,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 18:00:06,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-12-16 18:00:06,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086698356] [2023-12-16 18:00:06,923 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 18:00:06,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-16 18:00:06,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:00:06,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-16 18:00:06,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2023-12-16 18:00:06,924 INFO L87 Difference]: Start difference. First operand 1333 states and 1932 transitions. Second operand has 16 states, 16 states have (on average 6.625) internal successors, (106), 15 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:07,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:00:07,604 INFO L93 Difference]: Finished difference Result 5895 states and 8579 transitions. [2023-12-16 18:00:07,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-16 18:00:07,604 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.625) internal successors, (106), 15 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2023-12-16 18:00:07,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:00:07,616 INFO L225 Difference]: With dead ends: 5895 [2023-12-16 18:00:07,616 INFO L226 Difference]: Without dead ends: 4585 [2023-12-16 18:00:07,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=245, Invalid=685, Unknown=0, NotChecked=0, Total=930 [2023-12-16 18:00:07,619 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 1439 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1439 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 18:00:07,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1439 Valid, 488 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 18:00:07,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4585 states. [2023-12-16 18:00:07,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4585 to 2903. [2023-12-16 18:00:07,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2903 states, 2902 states have (on average 1.445210199862164) internal successors, (4194), 2902 states have internal predecessors, (4194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:07,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2903 states to 2903 states and 4194 transitions. [2023-12-16 18:00:07,705 INFO L78 Accepts]: Start accepts. Automaton has 2903 states and 4194 transitions. Word has length 59 [2023-12-16 18:00:07,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:00:07,705 INFO L495 AbstractCegarLoop]: Abstraction has 2903 states and 4194 transitions. [2023-12-16 18:00:07,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.625) internal successors, (106), 15 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:07,706 INFO L276 IsEmpty]: Start isEmpty. Operand 2903 states and 4194 transitions. [2023-12-16 18:00:07,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-16 18:00:07,707 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:00:07,707 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:00:07,715 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 (10)] Forceful destruction successful, exit code 0 [2023-12-16 18:00:07,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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 [2023-12-16 18:00:07,909 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:00:07,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:00:07,910 INFO L85 PathProgramCache]: Analyzing trace with hash -961217311, now seen corresponding path program 1 times [2023-12-16 18:00:07,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:00:07,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1384670486] [2023-12-16 18:00:07,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:00:07,910 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 [2023-12-16 18:00:07,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:00:07,913 INFO L229 MonitoredProcess]: Starting monitored process 11 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) [2023-12-16 18:00:07,943 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 (11)] Waiting until timeout for monitored process [2023-12-16 18:00:07,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:00:07,960 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 18:00:07,961 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:00:07,980 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:00:07,980 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:00:07,980 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:00:07,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1384670486] [2023-12-16 18:00:07,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1384670486] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:00:07,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:00:07,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 18:00:07,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926322228] [2023-12-16 18:00:07,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:00:07,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 18:00:07,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:00:07,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 18:00:07,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 18:00:07,981 INFO L87 Difference]: Start difference. First operand 2903 states and 4194 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:08,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:00:08,041 INFO L93 Difference]: Finished difference Result 5785 states and 8366 transitions. [2023-12-16 18:00:08,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 18:00:08,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2023-12-16 18:00:08,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:00:08,049 INFO L225 Difference]: With dead ends: 5785 [2023-12-16 18:00:08,049 INFO L226 Difference]: Without dead ends: 2905 [2023-12-16 18:00:08,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 18:00:08,052 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 38 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 18:00:08,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 166 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 18:00:08,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2905 states. [2023-12-16 18:00:08,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2905 to 2807. [2023-12-16 18:00:08,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2807 states, 2806 states have (on average 1.4233784746970777) internal successors, (3994), 2806 states have internal predecessors, (3994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:08,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2807 states to 2807 states and 3994 transitions. [2023-12-16 18:00:08,158 INFO L78 Accepts]: Start accepts. Automaton has 2807 states and 3994 transitions. Word has length 59 [2023-12-16 18:00:08,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:00:08,158 INFO L495 AbstractCegarLoop]: Abstraction has 2807 states and 3994 transitions. [2023-12-16 18:00:08,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:08,158 INFO L276 IsEmpty]: Start isEmpty. Operand 2807 states and 3994 transitions. [2023-12-16 18:00:08,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-16 18:00:08,159 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:00:08,159 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:00:08,172 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 (11)] Forceful destruction successful, exit code 0 [2023-12-16 18:00:08,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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 [2023-12-16 18:00:08,362 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:00:08,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:00:08,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1200740092, now seen corresponding path program 1 times [2023-12-16 18:00:08,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:00:08,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1701691741] [2023-12-16 18:00:08,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:00:08,363 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 [2023-12-16 18:00:08,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:00:08,364 INFO L229 MonitoredProcess]: Starting monitored process 12 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) [2023-12-16 18:00:08,366 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 (12)] Waiting until timeout for monitored process [2023-12-16 18:00:08,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:00:08,408 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 18:00:08,409 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:00:08,425 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:00:08,425 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:00:08,425 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:00:08,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1701691741] [2023-12-16 18:00:08,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1701691741] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:00:08,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:00:08,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 18:00:08,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669518463] [2023-12-16 18:00:08,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:00:08,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 18:00:08,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:00:08,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 18:00:08,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 18:00:08,427 INFO L87 Difference]: Start difference. First operand 2807 states and 3994 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:08,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:00:08,461 INFO L93 Difference]: Finished difference Result 4074 states and 5804 transitions. [2023-12-16 18:00:08,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 18:00:08,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2023-12-16 18:00:08,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:00:08,465 INFO L225 Difference]: With dead ends: 4074 [2023-12-16 18:00:08,465 INFO L226 Difference]: Without dead ends: 1290 [2023-12-16 18:00:08,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 18:00:08,467 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 31 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 18:00:08,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 155 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 18:00:08,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2023-12-16 18:00:08,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1268. [2023-12-16 18:00:08,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1268 states, 1267 states have (on average 1.4033149171270718) internal successors, (1778), 1267 states have internal predecessors, (1778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:08,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 1778 transitions. [2023-12-16 18:00:08,493 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 1778 transitions. Word has length 59 [2023-12-16 18:00:08,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:00:08,494 INFO L495 AbstractCegarLoop]: Abstraction has 1268 states and 1778 transitions. [2023-12-16 18:00:08,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:08,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 1778 transitions. [2023-12-16 18:00:08,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-16 18:00:08,494 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:00:08,494 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:00:08,512 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 (12)] Forceful destruction successful, exit code 0 [2023-12-16 18:00:08,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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 [2023-12-16 18:00:08,697 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:00:08,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:00:08,697 INFO L85 PathProgramCache]: Analyzing trace with hash -849298752, now seen corresponding path program 1 times [2023-12-16 18:00:08,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:00:08,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [409452107] [2023-12-16 18:00:08,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:00:08,698 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 [2023-12-16 18:00:08,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:00:08,712 INFO L229 MonitoredProcess]: Starting monitored process 13 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) [2023-12-16 18:00:08,716 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 (13)] Waiting until timeout for monitored process [2023-12-16 18:00:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:00:08,754 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 18:00:08,756 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:00:09,140 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:00:09,141 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 18:00:09,338 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:00:09,338 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:00:09,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [409452107] [2023-12-16 18:00:09,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [409452107] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 18:00:09,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 18:00:09,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-12-16 18:00:09,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385398859] [2023-12-16 18:00:09,339 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 18:00:09,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-16 18:00:09,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:00:09,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-16 18:00:09,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2023-12-16 18:00:09,340 INFO L87 Difference]: Start difference. First operand 1268 states and 1778 transitions. Second operand has 16 states, 16 states have (on average 6.875) internal successors, (110), 15 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:09,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:00:09,884 INFO L93 Difference]: Finished difference Result 5226 states and 7327 transitions. [2023-12-16 18:00:09,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-16 18:00:09,884 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.875) internal successors, (110), 15 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2023-12-16 18:00:09,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:00:09,894 INFO L225 Difference]: With dead ends: 5226 [2023-12-16 18:00:09,894 INFO L226 Difference]: Without dead ends: 4018 [2023-12-16 18:00:09,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=226, Invalid=644, Unknown=0, NotChecked=0, Total=870 [2023-12-16 18:00:09,897 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 648 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 18:00:09,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 349 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 18:00:09,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4018 states. [2023-12-16 18:00:09,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4018 to 3018. [2023-12-16 18:00:09,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3018 states, 3017 states have (on average 1.3987404706662248) internal successors, (4220), 3017 states have internal predecessors, (4220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:09,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 4220 transitions. [2023-12-16 18:00:09,981 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 4220 transitions. Word has length 59 [2023-12-16 18:00:09,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:00:09,981 INFO L495 AbstractCegarLoop]: Abstraction has 3018 states and 4220 transitions. [2023-12-16 18:00:09,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.875) internal successors, (110), 15 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:09,981 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 4220 transitions. [2023-12-16 18:00:09,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-16 18:00:09,982 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:00:09,982 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:00:10,000 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 (13)] Ended with exit code 0 [2023-12-16 18:00:10,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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 [2023-12-16 18:00:10,185 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:00:10,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:00:10,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1493546271, now seen corresponding path program 1 times [2023-12-16 18:00:10,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:00:10,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [185267776] [2023-12-16 18:00:10,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:00:10,186 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 [2023-12-16 18:00:10,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:00:10,202 INFO L229 MonitoredProcess]: Starting monitored process 14 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) [2023-12-16 18:00:10,228 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 (14)] Waiting until timeout for monitored process [2023-12-16 18:00:10,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:00:10,244 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 18:00:10,245 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:00:10,261 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:00:10,261 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:00:10,261 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:00:10,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [185267776] [2023-12-16 18:00:10,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [185267776] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:00:10,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:00:10,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 18:00:10,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404024978] [2023-12-16 18:00:10,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:00:10,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 18:00:10,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:00:10,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 18:00:10,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 18:00:10,262 INFO L87 Difference]: Start difference. First operand 3018 states and 4220 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:10,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:00:10,309 INFO L93 Difference]: Finished difference Result 4780 states and 6662 transitions. [2023-12-16 18:00:10,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 18:00:10,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2023-12-16 18:00:10,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:00:10,314 INFO L225 Difference]: With dead ends: 4780 [2023-12-16 18:00:10,314 INFO L226 Difference]: Without dead ends: 1848 [2023-12-16 18:00:10,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 18:00:10,317 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 29 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 18:00:10,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 133 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 18:00:10,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1848 states. [2023-12-16 18:00:10,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1848 to 1846. [2023-12-16 18:00:10,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1846 states, 1845 states have (on average 1.359349593495935) internal successors, (2508), 1845 states have internal predecessors, (2508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:10,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1846 states to 1846 states and 2508 transitions. [2023-12-16 18:00:10,364 INFO L78 Accepts]: Start accepts. Automaton has 1846 states and 2508 transitions. Word has length 59 [2023-12-16 18:00:10,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:00:10,364 INFO L495 AbstractCegarLoop]: Abstraction has 1846 states and 2508 transitions. [2023-12-16 18:00:10,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:10,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1846 states and 2508 transitions. [2023-12-16 18:00:10,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-16 18:00:10,365 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:00:10,365 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:00:10,369 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 (14)] Forceful destruction successful, exit code 0 [2023-12-16 18:00:10,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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 [2023-12-16 18:00:10,567 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:00:10,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:00:10,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1248541119, now seen corresponding path program 1 times [2023-12-16 18:00:10,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:00:10,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1509844322] [2023-12-16 18:00:10,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:00:10,568 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 [2023-12-16 18:00:10,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:00:10,570 INFO L229 MonitoredProcess]: Starting monitored process 15 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) [2023-12-16 18:00:10,571 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 (15)] Waiting until timeout for monitored process [2023-12-16 18:00:10,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:00:10,612 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 18:00:10,613 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:00:10,670 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-16 18:00:10,670 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 18:00:10,746 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-16 18:00:10,746 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:00:10,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1509844322] [2023-12-16 18:00:10,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1509844322] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 18:00:10,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 18:00:10,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-16 18:00:10,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454055512] [2023-12-16 18:00:10,746 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 18:00:10,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 18:00:10,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:00:10,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 18:00:10,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 18:00:10,747 INFO L87 Difference]: Start difference. First operand 1846 states and 2508 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:10,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:00:10,873 INFO L93 Difference]: Finished difference Result 6340 states and 8558 transitions. [2023-12-16 18:00:10,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 18:00:10,873 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2023-12-16 18:00:10,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:00:10,885 INFO L225 Difference]: With dead ends: 6340 [2023-12-16 18:00:10,885 INFO L226 Difference]: Without dead ends: 4580 [2023-12-16 18:00:10,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 18:00:10,888 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 100 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 18:00:10,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 344 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 18:00:10,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4580 states. [2023-12-16 18:00:10,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4580 to 4306. [2023-12-16 18:00:10,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4306 states, 4305 states have (on average 1.326829268292683) internal successors, (5712), 4305 states have internal predecessors, (5712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:11,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4306 states to 4306 states and 5712 transitions. [2023-12-16 18:00:11,002 INFO L78 Accepts]: Start accepts. Automaton has 4306 states and 5712 transitions. Word has length 60 [2023-12-16 18:00:11,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:00:11,002 INFO L495 AbstractCegarLoop]: Abstraction has 4306 states and 5712 transitions. [2023-12-16 18:00:11,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:11,002 INFO L276 IsEmpty]: Start isEmpty. Operand 4306 states and 5712 transitions. [2023-12-16 18:00:11,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-16 18:00:11,003 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:00:11,003 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:00:11,012 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 (15)] Forceful destruction successful, exit code 0 [2023-12-16 18:00:11,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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 [2023-12-16 18:00:11,213 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:00:11,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:00:11,214 INFO L85 PathProgramCache]: Analyzing trace with hash -978729939, now seen corresponding path program 1 times [2023-12-16 18:00:11,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:00:11,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1504033040] [2023-12-16 18:00:11,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:00:11,214 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 [2023-12-16 18:00:11,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:00:11,215 INFO L229 MonitoredProcess]: Starting monitored process 16 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) [2023-12-16 18:00:11,309 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 (16)] Waiting until timeout for monitored process [2023-12-16 18:00:11,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:00:11,325 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 18:00:11,326 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:00:11,341 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:00:11,342 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:00:11,342 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:00:11,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1504033040] [2023-12-16 18:00:11,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1504033040] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:00:11,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:00:11,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 18:00:11,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265542394] [2023-12-16 18:00:11,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:00:11,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 18:00:11,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:00:11,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 18:00:11,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 18:00:11,343 INFO L87 Difference]: Start difference. First operand 4306 states and 5712 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:11,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:00:11,457 INFO L93 Difference]: Finished difference Result 9939 states and 13133 transitions. [2023-12-16 18:00:11,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 18:00:11,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2023-12-16 18:00:11,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:00:11,484 INFO L225 Difference]: With dead ends: 9939 [2023-12-16 18:00:11,484 INFO L226 Difference]: Without dead ends: 6124 [2023-12-16 18:00:11,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 18:00:11,491 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 35 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 18:00:11,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 180 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 18:00:11,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6124 states. [2023-12-16 18:00:11,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6124 to 5750. [2023-12-16 18:00:11,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5750 states, 5749 states have (on average 1.29118107496956) internal successors, (7423), 5749 states have internal predecessors, (7423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:11,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5750 states to 5750 states and 7423 transitions. [2023-12-16 18:00:11,674 INFO L78 Accepts]: Start accepts. Automaton has 5750 states and 7423 transitions. Word has length 60 [2023-12-16 18:00:11,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:00:11,675 INFO L495 AbstractCegarLoop]: Abstraction has 5750 states and 7423 transitions. [2023-12-16 18:00:11,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:11,675 INFO L276 IsEmpty]: Start isEmpty. Operand 5750 states and 7423 transitions. [2023-12-16 18:00:11,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-16 18:00:11,676 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:00:11,676 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:00:11,690 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 (16)] Forceful destruction successful, exit code 0 [2023-12-16 18:00:11,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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 [2023-12-16 18:00:11,879 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:00:11,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:00:11,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1742324704, now seen corresponding path program 1 times [2023-12-16 18:00:11,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:00:11,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1138606399] [2023-12-16 18:00:11,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:00:11,880 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 [2023-12-16 18:00:11,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:00:11,881 INFO L229 MonitoredProcess]: Starting monitored process 17 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) [2023-12-16 18:00:11,883 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 (17)] Waiting until timeout for monitored process [2023-12-16 18:00:11,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:00:11,952 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 18:00:11,953 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:00:12,365 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:00:12,365 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 18:00:12,628 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:00:12,628 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:00:12,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1138606399] [2023-12-16 18:00:12,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1138606399] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 18:00:12,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 18:00:12,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2023-12-16 18:00:12,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416515846] [2023-12-16 18:00:12,629 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 18:00:12,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-16 18:00:12,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:00:12,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-16 18:00:12,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-12-16 18:00:12,630 INFO L87 Difference]: Start difference. First operand 5750 states and 7423 transitions. Second operand has 16 states, 16 states have (on average 7.125) internal successors, (114), 16 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:13,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:00:13,868 INFO L93 Difference]: Finished difference Result 19940 states and 25652 transitions. [2023-12-16 18:00:13,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-16 18:00:13,869 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.125) internal successors, (114), 16 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2023-12-16 18:00:13,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:00:13,885 INFO L225 Difference]: With dead ends: 19940 [2023-12-16 18:00:13,885 INFO L226 Difference]: Without dead ends: 14603 [2023-12-16 18:00:13,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=255, Invalid=867, Unknown=0, NotChecked=0, Total=1122 [2023-12-16 18:00:13,892 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 887 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 18:00:13,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 771 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 18:00:13,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14603 states. [2023-12-16 18:00:14,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14603 to 9309. [2023-12-16 18:00:14,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9309 states, 9308 states have (on average 1.2874946282767512) internal successors, (11984), 9308 states have internal predecessors, (11984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:14,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9309 states to 9309 states and 11984 transitions. [2023-12-16 18:00:14,160 INFO L78 Accepts]: Start accepts. Automaton has 9309 states and 11984 transitions. Word has length 60 [2023-12-16 18:00:14,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:00:14,160 INFO L495 AbstractCegarLoop]: Abstraction has 9309 states and 11984 transitions. [2023-12-16 18:00:14,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.125) internal successors, (114), 16 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:14,161 INFO L276 IsEmpty]: Start isEmpty. Operand 9309 states and 11984 transitions. [2023-12-16 18:00:14,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-16 18:00:14,162 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:00:14,162 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:00:14,176 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 (17)] Forceful destruction successful, exit code 0 [2023-12-16 18:00:14,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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 [2023-12-16 18:00:14,364 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:00:14,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:00:14,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1534022124, now seen corresponding path program 1 times [2023-12-16 18:00:14,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:00:14,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2005837744] [2023-12-16 18:00:14,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:00:14,365 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 [2023-12-16 18:00:14,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:00:14,377 INFO L229 MonitoredProcess]: Starting monitored process 18 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) [2023-12-16 18:00:14,399 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 (18)] Waiting until timeout for monitored process [2023-12-16 18:00:14,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:00:14,437 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 18:00:14,438 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:00:14,454 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:00:14,454 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:00:14,455 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:00:14,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2005837744] [2023-12-16 18:00:14,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2005837744] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:00:14,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:00:14,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 18:00:14,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654583702] [2023-12-16 18:00:14,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:00:14,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 18:00:14,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:00:14,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 18:00:14,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 18:00:14,456 INFO L87 Difference]: Start difference. First operand 9309 states and 11984 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:14,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:00:14,703 INFO L93 Difference]: Finished difference Result 18386 states and 23584 transitions. [2023-12-16 18:00:14,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 18:00:14,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2023-12-16 18:00:14,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:00:14,715 INFO L225 Difference]: With dead ends: 18386 [2023-12-16 18:00:14,716 INFO L226 Difference]: Without dead ends: 9607 [2023-12-16 18:00:14,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 18:00:14,725 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 35 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 18:00:14,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 189 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 18:00:14,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9607 states. [2023-12-16 18:00:14,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9607 to 7222. [2023-12-16 18:00:15,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7222 states, 7221 states have (on average 1.2629829663481513) internal successors, (9120), 7221 states have internal predecessors, (9120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:15,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7222 states to 7222 states and 9120 transitions. [2023-12-16 18:00:15,012 INFO L78 Accepts]: Start accepts. Automaton has 7222 states and 9120 transitions. Word has length 60 [2023-12-16 18:00:15,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:00:15,012 INFO L495 AbstractCegarLoop]: Abstraction has 7222 states and 9120 transitions. [2023-12-16 18:00:15,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:15,013 INFO L276 IsEmpty]: Start isEmpty. Operand 7222 states and 9120 transitions. [2023-12-16 18:00:15,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-16 18:00:15,014 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:00:15,014 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:00:15,032 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 (18)] Forceful destruction successful, exit code 0 [2023-12-16 18:00:15,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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 [2023-12-16 18:00:15,217 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:00:15,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:00:15,217 INFO L85 PathProgramCache]: Analyzing trace with hash -760251358, now seen corresponding path program 1 times [2023-12-16 18:00:15,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:00:15,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1689136032] [2023-12-16 18:00:15,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:00:15,217 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 [2023-12-16 18:00:15,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:00:15,218 INFO L229 MonitoredProcess]: Starting monitored process 19 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) [2023-12-16 18:00:15,219 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 (19)] Waiting until timeout for monitored process [2023-12-16 18:00:15,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:00:15,260 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 18:00:15,261 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:00:15,659 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:00:15,659 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 18:00:15,849 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:00:15,849 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:00:15,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1689136032] [2023-12-16 18:00:15,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1689136032] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 18:00:15,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 18:00:15,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2023-12-16 18:00:15,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056085057] [2023-12-16 18:00:15,852 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 18:00:15,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-16 18:00:15,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:00:15,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-16 18:00:15,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-12-16 18:00:15,853 INFO L87 Difference]: Start difference. First operand 7222 states and 9120 transitions. Second operand has 16 states, 16 states have (on average 6.9375) internal successors, (111), 16 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:17,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:00:17,134 INFO L93 Difference]: Finished difference Result 21122 states and 26728 transitions. [2023-12-16 18:00:17,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-16 18:00:17,135 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.9375) internal successors, (111), 16 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2023-12-16 18:00:17,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:00:17,153 INFO L225 Difference]: With dead ends: 21122 [2023-12-16 18:00:17,153 INFO L226 Difference]: Without dead ends: 18204 [2023-12-16 18:00:17,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=260, Invalid=862, Unknown=0, NotChecked=0, Total=1122 [2023-12-16 18:00:17,158 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 792 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 18:00:17,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 770 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 18:00:17,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18204 states. [2023-12-16 18:00:17,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18204 to 13579. [2023-12-16 18:00:17,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13579 states, 13578 states have (on average 1.2617469435852113) internal successors, (17132), 13578 states have internal predecessors, (17132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:17,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13579 states to 13579 states and 17132 transitions. [2023-12-16 18:00:17,575 INFO L78 Accepts]: Start accepts. Automaton has 13579 states and 17132 transitions. Word has length 61 [2023-12-16 18:00:17,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:00:17,575 INFO L495 AbstractCegarLoop]: Abstraction has 13579 states and 17132 transitions. [2023-12-16 18:00:17,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.9375) internal successors, (111), 16 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:17,575 INFO L276 IsEmpty]: Start isEmpty. Operand 13579 states and 17132 transitions. [2023-12-16 18:00:17,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-16 18:00:17,577 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:00:17,577 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:00:17,594 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 (19)] Ended with exit code 0 [2023-12-16 18:00:17,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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 [2023-12-16 18:00:17,779 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:00:17,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:00:17,780 INFO L85 PathProgramCache]: Analyzing trace with hash 794016731, now seen corresponding path program 1 times [2023-12-16 18:00:17,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:00:17,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1063645468] [2023-12-16 18:00:17,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:00:17,780 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 [2023-12-16 18:00:17,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:00:17,781 INFO L229 MonitoredProcess]: Starting monitored process 20 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) [2023-12-16 18:00:17,794 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 (20)] Waiting until timeout for monitored process [2023-12-16 18:00:17,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:00:17,829 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 18:00:17,840 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:00:18,273 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:00:18,274 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 18:00:18,539 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:00:18,539 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:00:18,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1063645468] [2023-12-16 18:00:18,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1063645468] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 18:00:18,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 18:00:18,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2023-12-16 18:00:18,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837515099] [2023-12-16 18:00:18,539 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 18:00:18,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-16 18:00:18,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:00:18,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-16 18:00:18,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-12-16 18:00:18,540 INFO L87 Difference]: Start difference. First operand 13579 states and 17132 transitions. Second operand has 16 states, 16 states have (on average 6.625) internal successors, (106), 16 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:20,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:00:20,291 INFO L93 Difference]: Finished difference Result 42194 states and 53194 transitions. [2023-12-16 18:00:20,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-16 18:00:20,292 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.625) internal successors, (106), 16 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2023-12-16 18:00:20,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:00:20,354 INFO L225 Difference]: With dead ends: 42194 [2023-12-16 18:00:20,355 INFO L226 Difference]: Without dead ends: 32156 [2023-12-16 18:00:20,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=257, Invalid=799, Unknown=0, NotChecked=0, Total=1056 [2023-12-16 18:00:20,370 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 567 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 18:00:20,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 983 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 18:00:20,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32156 states. [2023-12-16 18:00:21,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32156 to 21812. [2023-12-16 18:00:21,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21812 states, 21811 states have (on average 1.2647746549906012) internal successors, (27586), 21811 states have internal predecessors, (27586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:21,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21812 states to 21812 states and 27586 transitions. [2023-12-16 18:00:21,225 INFO L78 Accepts]: Start accepts. Automaton has 21812 states and 27586 transitions. Word has length 61 [2023-12-16 18:00:21,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:00:21,225 INFO L495 AbstractCegarLoop]: Abstraction has 21812 states and 27586 transitions. [2023-12-16 18:00:21,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.625) internal successors, (106), 16 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:21,225 INFO L276 IsEmpty]: Start isEmpty. Operand 21812 states and 27586 transitions. [2023-12-16 18:00:21,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-16 18:00:21,228 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:00:21,228 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:00:21,233 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 (20)] Forceful destruction successful, exit code 0 [2023-12-16 18:00:21,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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 [2023-12-16 18:00:21,431 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:00:21,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:00:21,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1789610656, now seen corresponding path program 1 times [2023-12-16 18:00:21,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:00:21,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1515962728] [2023-12-16 18:00:21,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:00:21,431 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 [2023-12-16 18:00:21,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:00:21,432 INFO L229 MonitoredProcess]: Starting monitored process 21 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) [2023-12-16 18:00:21,433 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 (21)] Waiting until timeout for monitored process [2023-12-16 18:00:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:00:21,474 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 18:00:21,475 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:00:21,583 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:00:21,583 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 18:00:21,628 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:00:21,628 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:00:21,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1515962728] [2023-12-16 18:00:21,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1515962728] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 18:00:21,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 18:00:21,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-16 18:00:21,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650022208] [2023-12-16 18:00:21,629 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 18:00:21,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 18:00:21,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:00:21,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 18:00:21,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-16 18:00:21,630 INFO L87 Difference]: Start difference. First operand 21812 states and 27586 transitions. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:22,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:00:22,345 INFO L93 Difference]: Finished difference Result 27583 states and 34809 transitions. [2023-12-16 18:00:22,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 18:00:22,346 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2023-12-16 18:00:22,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:00:22,371 INFO L225 Difference]: With dead ends: 27583 [2023-12-16 18:00:22,372 INFO L226 Difference]: Without dead ends: 21468 [2023-12-16 18:00:22,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-12-16 18:00:22,384 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 181 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 18:00:22,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 261 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 18:00:22,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21468 states. [2023-12-16 18:00:23,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21468 to 18215. [2023-12-16 18:00:23,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18215 states, 18214 states have (on average 1.2659492697924672) internal successors, (23058), 18214 states have internal predecessors, (23058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:23,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18215 states to 18215 states and 23058 transitions. [2023-12-16 18:00:23,319 INFO L78 Accepts]: Start accepts. Automaton has 18215 states and 23058 transitions. Word has length 61 [2023-12-16 18:00:23,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:00:23,320 INFO L495 AbstractCegarLoop]: Abstraction has 18215 states and 23058 transitions. [2023-12-16 18:00:23,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:23,320 INFO L276 IsEmpty]: Start isEmpty. Operand 18215 states and 23058 transitions. [2023-12-16 18:00:23,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-16 18:00:23,322 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:00:23,322 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:00:23,327 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 (21)] Ended with exit code 0 [2023-12-16 18:00:23,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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 [2023-12-16 18:00:23,528 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:00:23,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:00:23,528 INFO L85 PathProgramCache]: Analyzing trace with hash 2040899247, now seen corresponding path program 1 times [2023-12-16 18:00:23,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:00:23,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1228529320] [2023-12-16 18:00:23,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:00:23,528 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 [2023-12-16 18:00:23,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:00:23,531 INFO L229 MonitoredProcess]: Starting monitored process 22 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) [2023-12-16 18:00:23,531 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 (22)] Waiting until timeout for monitored process [2023-12-16 18:00:23,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:00:23,588 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 18:00:23,589 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:00:23,702 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:00:23,702 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 18:00:23,744 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:00:23,745 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:00:23,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1228529320] [2023-12-16 18:00:23,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1228529320] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 18:00:23,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 18:00:23,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-16 18:00:23,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657772080] [2023-12-16 18:00:23,745 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 18:00:23,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 18:00:23,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:00:23,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 18:00:23,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-16 18:00:23,752 INFO L87 Difference]: Start difference. First operand 18215 states and 23058 transitions. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:24,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:00:24,302 INFO L93 Difference]: Finished difference Result 34798 states and 43877 transitions. [2023-12-16 18:00:24,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 18:00:24,302 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2023-12-16 18:00:24,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:00:24,326 INFO L225 Difference]: With dead ends: 34798 [2023-12-16 18:00:24,326 INFO L226 Difference]: Without dead ends: 17531 [2023-12-16 18:00:24,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-12-16 18:00:24,346 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 122 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 18:00:24,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 284 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 18:00:24,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17531 states. [2023-12-16 18:00:24,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17531 to 16005. [2023-12-16 18:00:24,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16005 states, 16004 states have (on average 1.2411897025743563) internal successors, (19864), 16004 states have internal predecessors, (19864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:24,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16005 states to 16005 states and 19864 transitions. [2023-12-16 18:00:24,927 INFO L78 Accepts]: Start accepts. Automaton has 16005 states and 19864 transitions. Word has length 61 [2023-12-16 18:00:24,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:00:24,927 INFO L495 AbstractCegarLoop]: Abstraction has 16005 states and 19864 transitions. [2023-12-16 18:00:24,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:24,927 INFO L276 IsEmpty]: Start isEmpty. Operand 16005 states and 19864 transitions. [2023-12-16 18:00:24,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-16 18:00:24,928 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:00:24,928 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:00:24,931 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 (22)] Forceful destruction successful, exit code 0 [2023-12-16 18:00:25,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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 [2023-12-16 18:00:25,131 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:00:25,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:00:25,131 INFO L85 PathProgramCache]: Analyzing trace with hash -2005364408, now seen corresponding path program 1 times [2023-12-16 18:00:25,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:00:25,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1706002283] [2023-12-16 18:00:25,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:00:25,168 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 [2023-12-16 18:00:25,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:00:25,171 INFO L229 MonitoredProcess]: Starting monitored process 23 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) [2023-12-16 18:00:25,172 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 (23)] Waiting until timeout for monitored process [2023-12-16 18:00:25,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:00:25,213 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 18:00:25,214 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:00:25,305 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:00:25,305 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 18:00:25,344 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:00:25,344 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:00:25,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1706002283] [2023-12-16 18:00:25,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1706002283] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 18:00:25,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 18:00:25,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-16 18:00:25,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678631385] [2023-12-16 18:00:25,345 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 18:00:25,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 18:00:25,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:00:25,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 18:00:25,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-16 18:00:25,346 INFO L87 Difference]: Start difference. First operand 16005 states and 19864 transitions. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:25,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:00:25,772 INFO L93 Difference]: Finished difference Result 21312 states and 26310 transitions. [2023-12-16 18:00:25,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 18:00:25,772 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2023-12-16 18:00:25,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:00:25,788 INFO L225 Difference]: With dead ends: 21312 [2023-12-16 18:00:25,789 INFO L226 Difference]: Without dead ends: 15136 [2023-12-16 18:00:25,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-12-16 18:00:25,796 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 186 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 18:00:25,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 197 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 18:00:25,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15136 states. [2023-12-16 18:00:26,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15136 to 13369. [2023-12-16 18:00:26,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13369 states, 13368 states have (on average 1.2352633153800119) internal successors, (16513), 13368 states have internal predecessors, (16513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:26,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13369 states to 13369 states and 16513 transitions. [2023-12-16 18:00:26,323 INFO L78 Accepts]: Start accepts. Automaton has 13369 states and 16513 transitions. Word has length 62 [2023-12-16 18:00:26,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:00:26,325 INFO L495 AbstractCegarLoop]: Abstraction has 13369 states and 16513 transitions. [2023-12-16 18:00:26,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:26,325 INFO L276 IsEmpty]: Start isEmpty. Operand 13369 states and 16513 transitions. [2023-12-16 18:00:26,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-16 18:00:26,332 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:00:26,333 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:00:26,348 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 (23)] Forceful destruction successful, exit code 0 [2023-12-16 18:00:26,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /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 [2023-12-16 18:00:26,535 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:00:26,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:00:26,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1939165418, now seen corresponding path program 1 times [2023-12-16 18:00:26,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:00:26,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [58846692] [2023-12-16 18:00:26,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:00:26,536 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 [2023-12-16 18:00:26,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:00:26,537 INFO L229 MonitoredProcess]: Starting monitored process 24 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) [2023-12-16 18:00:26,548 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 (24)] Waiting until timeout for monitored process [2023-12-16 18:00:26,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:00:26,593 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 18:00:26,597 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:00:26,634 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-12-16 18:00:26,634 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:00:26,635 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:00:26,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [58846692] [2023-12-16 18:00:26,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [58846692] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:00:26,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:00:26,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 18:00:26,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496577800] [2023-12-16 18:00:26,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:00:26,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 18:00:26,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:00:26,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 18:00:26,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 18:00:26,637 INFO L87 Difference]: Start difference. First operand 13369 states and 16513 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:27,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:00:27,008 INFO L93 Difference]: Finished difference Result 14145 states and 17369 transitions. [2023-12-16 18:00:27,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 18:00:27,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2023-12-16 18:00:27,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:00:27,017 INFO L225 Difference]: With dead ends: 14145 [2023-12-16 18:00:27,017 INFO L226 Difference]: Without dead ends: 9682 [2023-12-16 18:00:27,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 18:00:27,022 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 29 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 18:00:27,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 152 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 18:00:27,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9682 states. [2023-12-16 18:00:27,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9682 to 9680. [2023-12-16 18:00:27,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9680 states, 9679 states have (on average 1.2110755243310258) internal successors, (11722), 9679 states have internal predecessors, (11722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:27,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9680 states to 9680 states and 11722 transitions. [2023-12-16 18:00:27,329 INFO L78 Accepts]: Start accepts. Automaton has 9680 states and 11722 transitions. Word has length 99 [2023-12-16 18:00:27,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:00:27,329 INFO L495 AbstractCegarLoop]: Abstraction has 9680 states and 11722 transitions. [2023-12-16 18:00:27,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:27,330 INFO L276 IsEmpty]: Start isEmpty. Operand 9680 states and 11722 transitions. [2023-12-16 18:00:27,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-16 18:00:27,334 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:00:27,334 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:00:27,357 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 (24)] Forceful destruction successful, exit code 0 [2023-12-16 18:00:27,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /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 [2023-12-16 18:00:27,537 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:00:27,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:00:27,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1791966976, now seen corresponding path program 1 times [2023-12-16 18:00:27,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:00:27,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [321226492] [2023-12-16 18:00:27,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:00:27,538 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 [2023-12-16 18:00:27,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:00:27,539 INFO L229 MonitoredProcess]: Starting monitored process 25 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) [2023-12-16 18:00:27,548 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 (25)] Waiting until timeout for monitored process [2023-12-16 18:00:27,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:00:27,593 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 18:00:27,595 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:00:27,617 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-12-16 18:00:27,617 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:00:27,618 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:00:27,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [321226492] [2023-12-16 18:00:27,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [321226492] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:00:27,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:00:27,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 18:00:27,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222148681] [2023-12-16 18:00:27,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:00:27,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 18:00:27,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:00:27,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 18:00:27,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 18:00:27,619 INFO L87 Difference]: Start difference. First operand 9680 states and 11722 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:27,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:00:27,947 INFO L93 Difference]: Finished difference Result 18090 states and 21995 transitions. [2023-12-16 18:00:27,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 18:00:27,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2023-12-16 18:00:27,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:00:27,955 INFO L225 Difference]: With dead ends: 18090 [2023-12-16 18:00:27,955 INFO L226 Difference]: Without dead ends: 9437 [2023-12-16 18:00:27,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 18:00:27,962 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 34 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 18:00:27,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 156 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 18:00:27,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9437 states. [2023-12-16 18:00:28,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9437 to 7825. [2023-12-16 18:00:28,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7825 states, 7824 states have (on average 1.1891615541922291) internal successors, (9304), 7824 states have internal predecessors, (9304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:28,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7825 states to 7825 states and 9304 transitions. [2023-12-16 18:00:28,235 INFO L78 Accepts]: Start accepts. Automaton has 7825 states and 9304 transitions. Word has length 100 [2023-12-16 18:00:28,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:00:28,236 INFO L495 AbstractCegarLoop]: Abstraction has 7825 states and 9304 transitions. [2023-12-16 18:00:28,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:28,236 INFO L276 IsEmpty]: Start isEmpty. Operand 7825 states and 9304 transitions. [2023-12-16 18:00:28,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-16 18:00:28,238 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:00:28,238 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:00:28,243 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 (25)] Forceful destruction successful, exit code 0 [2023-12-16 18:00:28,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /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 [2023-12-16 18:00:28,441 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:00:28,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:00:28,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1110967071, now seen corresponding path program 1 times [2023-12-16 18:00:28,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:00:28,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1602368794] [2023-12-16 18:00:28,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:00:28,443 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 [2023-12-16 18:00:28,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:00:28,444 INFO L229 MonitoredProcess]: Starting monitored process 26 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) [2023-12-16 18:00:28,446 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 (26)] Waiting until timeout for monitored process [2023-12-16 18:00:28,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:00:28,499 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 18:00:28,500 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:00:28,540 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-16 18:00:28,541 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:00:28,541 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:00:28,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1602368794] [2023-12-16 18:00:28,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1602368794] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:00:28,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:00:28,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 18:00:28,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930939162] [2023-12-16 18:00:28,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:00:28,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 18:00:28,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:00:28,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 18:00:28,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 18:00:28,543 INFO L87 Difference]: Start difference. First operand 7825 states and 9304 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:28,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:00:28,719 INFO L93 Difference]: Finished difference Result 10015 states and 11894 transitions. [2023-12-16 18:00:28,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 18:00:28,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2023-12-16 18:00:28,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:00:28,724 INFO L225 Difference]: With dead ends: 10015 [2023-12-16 18:00:28,724 INFO L226 Difference]: Without dead ends: 5630 [2023-12-16 18:00:28,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 18:00:28,728 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 26 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 18:00:28,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 197 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 18:00:28,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5630 states. [2023-12-16 18:00:28,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5630 to 4350. [2023-12-16 18:00:28,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4350 states, 4349 states have (on average 1.168774430903656) internal successors, (5083), 4349 states have internal predecessors, (5083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:28,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4350 states to 4350 states and 5083 transitions. [2023-12-16 18:00:28,899 INFO L78 Accepts]: Start accepts. Automaton has 4350 states and 5083 transitions. Word has length 100 [2023-12-16 18:00:28,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:00:28,899 INFO L495 AbstractCegarLoop]: Abstraction has 4350 states and 5083 transitions. [2023-12-16 18:00:28,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:28,900 INFO L276 IsEmpty]: Start isEmpty. Operand 4350 states and 5083 transitions. [2023-12-16 18:00:28,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-16 18:00:28,901 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:00:28,901 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:00:28,904 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 (26)] Forceful destruction successful, exit code 0 [2023-12-16 18:00:29,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /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 [2023-12-16 18:00:29,104 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:00:29,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:00:29,104 INFO L85 PathProgramCache]: Analyzing trace with hash 180074091, now seen corresponding path program 1 times [2023-12-16 18:00:29,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:00:29,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [736038501] [2023-12-16 18:00:29,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:00:29,105 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 [2023-12-16 18:00:29,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:00:29,106 INFO L229 MonitoredProcess]: Starting monitored process 27 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) [2023-12-16 18:00:29,107 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 (27)] Waiting until timeout for monitored process [2023-12-16 18:00:29,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:00:29,165 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 18:00:29,166 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:00:29,212 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-16 18:00:29,212 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:00:29,212 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:00:29,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [736038501] [2023-12-16 18:00:29,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [736038501] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:00:29,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:00:29,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 18:00:29,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320646960] [2023-12-16 18:00:29,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:00:29,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 18:00:29,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:00:29,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 18:00:29,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 18:00:29,214 INFO L87 Difference]: Start difference. First operand 4350 states and 5083 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:29,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:00:29,376 INFO L93 Difference]: Finished difference Result 5480 states and 6376 transitions. [2023-12-16 18:00:29,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 18:00:29,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2023-12-16 18:00:29,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:00:29,382 INFO L225 Difference]: With dead ends: 5480 [2023-12-16 18:00:29,382 INFO L226 Difference]: Without dead ends: 3932 [2023-12-16 18:00:29,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 18:00:29,386 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 25 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 18:00:29,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 183 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 18:00:29,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3932 states. [2023-12-16 18:00:29,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3932 to 3824. [2023-12-16 18:00:29,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3824 states, 3823 states have (on average 1.1375882814543552) internal successors, (4349), 3823 states have internal predecessors, (4349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:29,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3824 states to 3824 states and 4349 transitions. [2023-12-16 18:00:29,564 INFO L78 Accepts]: Start accepts. Automaton has 3824 states and 4349 transitions. Word has length 102 [2023-12-16 18:00:29,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:00:29,564 INFO L495 AbstractCegarLoop]: Abstraction has 3824 states and 4349 transitions. [2023-12-16 18:00:29,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:29,564 INFO L276 IsEmpty]: Start isEmpty. Operand 3824 states and 4349 transitions. [2023-12-16 18:00:29,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-16 18:00:29,565 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:00:29,572 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:00:29,577 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 (27)] Forceful destruction successful, exit code 0 [2023-12-16 18:00:29,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /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 [2023-12-16 18:00:29,776 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:00:29,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:00:29,776 INFO L85 PathProgramCache]: Analyzing trace with hash 2038895169, now seen corresponding path program 1 times [2023-12-16 18:00:29,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:00:29,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1953569823] [2023-12-16 18:00:29,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:00:29,776 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 [2023-12-16 18:00:29,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:00:29,777 INFO L229 MonitoredProcess]: Starting monitored process 28 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) [2023-12-16 18:00:29,779 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 (28)] Waiting until timeout for monitored process [2023-12-16 18:00:29,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:00:29,845 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-16 18:00:29,846 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:00:30,758 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 32 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:00:30,758 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 18:00:31,253 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 32 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:00:31,254 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:00:31,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1953569823] [2023-12-16 18:00:31,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1953569823] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 18:00:31,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 18:00:31,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2023-12-16 18:00:31,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868538188] [2023-12-16 18:00:31,254 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 18:00:31,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-16 18:00:31,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:00:31,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-16 18:00:31,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2023-12-16 18:00:31,255 INFO L87 Difference]: Start difference. First operand 3824 states and 4349 transitions. Second operand has 26 states, 26 states have (on average 7.269230769230769) internal successors, (189), 26 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:37,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:00:37,173 INFO L93 Difference]: Finished difference Result 7168 states and 8133 transitions. [2023-12-16 18:00:37,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2023-12-16 18:00:37,173 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.269230769230769) internal successors, (189), 26 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2023-12-16 18:00:37,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:00:37,179 INFO L225 Difference]: With dead ends: 7168 [2023-12-16 18:00:37,179 INFO L226 Difference]: Without dead ends: 6288 [2023-12-16 18:00:37,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2024 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1381, Invalid=6629, Unknown=0, NotChecked=0, Total=8010 [2023-12-16 18:00:37,182 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 1082 mSDsluCounter, 2617 mSDsCounter, 0 mSdLazyCounter, 2747 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1082 SdHoareTripleChecker+Valid, 2800 SdHoareTripleChecker+Invalid, 2784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 2747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-12-16 18:00:37,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1082 Valid, 2800 Invalid, 2784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 2747 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-12-16 18:00:37,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6288 states. [2023-12-16 18:00:37,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6288 to 3728. [2023-12-16 18:00:37,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3728 states, 3727 states have (on average 1.1330829085055003) internal successors, (4223), 3727 states have internal predecessors, (4223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:37,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3728 states to 3728 states and 4223 transitions. [2023-12-16 18:00:37,353 INFO L78 Accepts]: Start accepts. Automaton has 3728 states and 4223 transitions. Word has length 103 [2023-12-16 18:00:37,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:00:37,353 INFO L495 AbstractCegarLoop]: Abstraction has 3728 states and 4223 transitions. [2023-12-16 18:00:37,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.269230769230769) internal successors, (189), 26 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:37,353 INFO L276 IsEmpty]: Start isEmpty. Operand 3728 states and 4223 transitions. [2023-12-16 18:00:37,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-16 18:00:37,354 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:00:37,354 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:00:37,357 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 (28)] Forceful destruction successful, exit code 0 [2023-12-16 18:00:37,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /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 [2023-12-16 18:00:37,557 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:00:37,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:00:37,558 INFO L85 PathProgramCache]: Analyzing trace with hash 571342120, now seen corresponding path program 1 times [2023-12-16 18:00:37,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:00:37,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1991213034] [2023-12-16 18:00:37,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:00:37,558 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 [2023-12-16 18:00:37,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:00:37,559 INFO L229 MonitoredProcess]: Starting monitored process 29 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) [2023-12-16 18:00:37,586 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 (29)] Waiting until timeout for monitored process [2023-12-16 18:00:37,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:00:37,620 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-16 18:00:37,622 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:00:38,566 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 13 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:00:38,566 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 18:00:38,921 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 13 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:00:38,922 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:00:38,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1991213034] [2023-12-16 18:00:38,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1991213034] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 18:00:38,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 18:00:38,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2023-12-16 18:00:38,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165487345] [2023-12-16 18:00:38,922 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 18:00:38,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-16 18:00:38,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:00:38,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-16 18:00:38,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2023-12-16 18:00:38,923 INFO L87 Difference]: Start difference. First operand 3728 states and 4223 transitions. Second operand has 26 states, 26 states have (on average 7.6923076923076925) internal successors, (200), 26 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:43,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:00:43,954 INFO L93 Difference]: Finished difference Result 8143 states and 9280 transitions. [2023-12-16 18:00:43,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2023-12-16 18:00:43,955 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.6923076923076925) internal successors, (200), 26 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2023-12-16 18:00:43,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:00:43,961 INFO L225 Difference]: With dead ends: 8143 [2023-12-16 18:00:43,961 INFO L226 Difference]: Without dead ends: 6991 [2023-12-16 18:00:43,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2160 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1335, Invalid=7037, Unknown=0, NotChecked=0, Total=8372 [2023-12-16 18:00:43,965 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 1249 mSDsluCounter, 1914 mSDsCounter, 0 mSdLazyCounter, 2059 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1249 SdHoareTripleChecker+Valid, 2092 SdHoareTripleChecker+Invalid, 2101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-16 18:00:43,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1249 Valid, 2092 Invalid, 2101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2059 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-16 18:00:43,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6991 states. [2023-12-16 18:00:44,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6991 to 5260. [2023-12-16 18:00:44,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5260 states, 5259 states have (on average 1.1342460543829624) internal successors, (5965), 5259 states have internal predecessors, (5965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:44,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5260 states to 5260 states and 5965 transitions. [2023-12-16 18:00:44,264 INFO L78 Accepts]: Start accepts. Automaton has 5260 states and 5965 transitions. Word has length 103 [2023-12-16 18:00:44,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:00:44,265 INFO L495 AbstractCegarLoop]: Abstraction has 5260 states and 5965 transitions. [2023-12-16 18:00:44,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.6923076923076925) internal successors, (200), 26 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:44,265 INFO L276 IsEmpty]: Start isEmpty. Operand 5260 states and 5965 transitions. [2023-12-16 18:00:44,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-16 18:00:44,266 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:00:44,266 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:00:44,284 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 (29)] Ended with exit code 0 [2023-12-16 18:00:44,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /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 [2023-12-16 18:00:44,469 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:00:44,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:00:44,469 INFO L85 PathProgramCache]: Analyzing trace with hash -89237700, now seen corresponding path program 1 times [2023-12-16 18:00:44,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:00:44,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [152326927] [2023-12-16 18:00:44,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:00:44,470 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 [2023-12-16 18:00:44,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:00:44,470 INFO L229 MonitoredProcess]: Starting monitored process 30 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) [2023-12-16 18:00:44,496 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 (30)] Waiting until timeout for monitored process [2023-12-16 18:00:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:00:44,544 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-16 18:00:44,545 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:00:45,521 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 23 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:00:45,521 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 18:00:46,011 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 23 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:00:46,011 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:00:46,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [152326927] [2023-12-16 18:00:46,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [152326927] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 18:00:46,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 18:00:46,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2023-12-16 18:00:46,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106737497] [2023-12-16 18:00:46,012 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 18:00:46,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-16 18:00:46,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:00:46,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-16 18:00:46,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2023-12-16 18:00:46,015 INFO L87 Difference]: Start difference. First operand 5260 states and 5965 transitions. Second operand has 26 states, 26 states have (on average 7.615384615384615) internal successors, (198), 26 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:50,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:00:50,810 INFO L93 Difference]: Finished difference Result 8495 states and 9587 transitions. [2023-12-16 18:00:50,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-12-16 18:00:50,811 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.615384615384615) internal successors, (198), 26 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2023-12-16 18:00:50,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:00:50,817 INFO L225 Difference]: With dead ends: 8495 [2023-12-16 18:00:50,817 INFO L226 Difference]: Without dead ends: 8096 [2023-12-16 18:00:50,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1244 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=962, Invalid=4588, Unknown=0, NotChecked=0, Total=5550 [2023-12-16 18:00:50,820 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 744 mSDsluCounter, 2351 mSDsCounter, 0 mSdLazyCounter, 2360 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 744 SdHoareTripleChecker+Valid, 2523 SdHoareTripleChecker+Invalid, 2382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-16 18:00:50,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [744 Valid, 2523 Invalid, 2382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2360 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-16 18:00:50,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8096 states. [2023-12-16 18:00:51,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8096 to 6586. [2023-12-16 18:00:51,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6586 states, 6585 states have (on average 1.1315110098709187) internal successors, (7451), 6585 states have internal predecessors, (7451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:51,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6586 states to 6586 states and 7451 transitions. [2023-12-16 18:00:51,122 INFO L78 Accepts]: Start accepts. Automaton has 6586 states and 7451 transitions. Word has length 105 [2023-12-16 18:00:51,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:00:51,122 INFO L495 AbstractCegarLoop]: Abstraction has 6586 states and 7451 transitions. [2023-12-16 18:00:51,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.615384615384615) internal successors, (198), 26 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:51,122 INFO L276 IsEmpty]: Start isEmpty. Operand 6586 states and 7451 transitions. [2023-12-16 18:00:51,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-12-16 18:00:51,126 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:00:51,126 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:00:51,130 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 (30)] Forceful destruction successful, exit code 0 [2023-12-16 18:00:51,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /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 [2023-12-16 18:00:51,331 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:00:51,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:00:51,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1606776377, now seen corresponding path program 2 times [2023-12-16 18:00:51,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:00:51,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1842513269] [2023-12-16 18:00:51,332 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 18:00:51,332 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 [2023-12-16 18:00:51,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:00:51,333 INFO L229 MonitoredProcess]: Starting monitored process 31 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) [2023-12-16 18:00:51,334 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 (31)] Waiting until timeout for monitored process [2023-12-16 18:00:51,402 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 18:00:51,403 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 18:00:51,405 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-16 18:00:51,408 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:00:51,981 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 128 proven. 30 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-12-16 18:00:51,981 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 18:00:52,219 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 128 proven. 30 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-12-16 18:00:52,219 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:00:52,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1842513269] [2023-12-16 18:00:52,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1842513269] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 18:00:52,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 18:00:52,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2023-12-16 18:00:52,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094266296] [2023-12-16 18:00:52,219 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 18:00:52,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-16 18:00:52,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:00:52,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-16 18:00:52,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2023-12-16 18:00:52,221 INFO L87 Difference]: Start difference. First operand 6586 states and 7451 transitions. Second operand has 18 states, 18 states have (on average 9.722222222222221) internal successors, (175), 18 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:54,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:00:54,246 INFO L93 Difference]: Finished difference Result 9279 states and 10521 transitions. [2023-12-16 18:00:54,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-12-16 18:00:54,247 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 9.722222222222221) internal successors, (175), 18 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 136 [2023-12-16 18:00:54,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:00:54,255 INFO L225 Difference]: With dead ends: 9279 [2023-12-16 18:00:54,255 INFO L226 Difference]: Without dead ends: 7301 [2023-12-16 18:00:54,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=392, Invalid=1414, Unknown=0, NotChecked=0, Total=1806 [2023-12-16 18:00:54,258 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 617 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-16 18:00:54,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 1326 Invalid, 1172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1158 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-16 18:00:54,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7301 states. [2023-12-16 18:00:54,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7301 to 6756. [2023-12-16 18:00:54,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6756 states, 6755 states have (on average 1.1284974093264248) internal successors, (7623), 6755 states have internal predecessors, (7623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:54,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6756 states to 6756 states and 7623 transitions. [2023-12-16 18:00:54,579 INFO L78 Accepts]: Start accepts. Automaton has 6756 states and 7623 transitions. Word has length 136 [2023-12-16 18:00:54,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:00:54,579 INFO L495 AbstractCegarLoop]: Abstraction has 6756 states and 7623 transitions. [2023-12-16 18:00:54,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 9.722222222222221) internal successors, (175), 18 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:54,579 INFO L276 IsEmpty]: Start isEmpty. Operand 6756 states and 7623 transitions. [2023-12-16 18:00:54,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-12-16 18:00:54,583 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:00:54,583 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:00:54,585 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 (31)] Ended with exit code 0 [2023-12-16 18:00:54,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /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 [2023-12-16 18:00:54,788 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:00:54,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:00:54,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1209784893, now seen corresponding path program 1 times [2023-12-16 18:00:54,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:00:54,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [511490127] [2023-12-16 18:00:54,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:00:54,789 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 [2023-12-16 18:00:54,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:00:54,790 INFO L229 MonitoredProcess]: Starting monitored process 32 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) [2023-12-16 18:00:54,792 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 (32)] Waiting until timeout for monitored process [2023-12-16 18:00:54,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:00:54,855 INFO L262 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 18:00:54,869 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:00:54,983 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-16 18:00:54,983 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:00:54,984 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:00:54,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [511490127] [2023-12-16 18:00:54,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [511490127] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:00:54,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:00:54,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 18:00:54,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765759471] [2023-12-16 18:00:54,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:00:54,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 18:00:54,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:00:54,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 18:00:54,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-16 18:00:54,985 INFO L87 Difference]: Start difference. First operand 6756 states and 7623 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:55,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:00:55,322 INFO L93 Difference]: Finished difference Result 6762 states and 7626 transitions. [2023-12-16 18:00:55,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 18:00:55,322 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 136 [2023-12-16 18:00:55,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:00:55,328 INFO L225 Difference]: With dead ends: 6762 [2023-12-16 18:00:55,328 INFO L226 Difference]: Without dead ends: 6637 [2023-12-16 18:00:55,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-16 18:00:55,328 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 102 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 18:00:55,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 177 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 18:00:55,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6637 states. [2023-12-16 18:00:55,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6637 to 6633. [2023-12-16 18:00:55,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6633 states, 6632 states have (on average 1.1301266586248493) internal successors, (7495), 6632 states have internal predecessors, (7495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:55,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6633 states to 6633 states and 7495 transitions. [2023-12-16 18:00:55,623 INFO L78 Accepts]: Start accepts. Automaton has 6633 states and 7495 transitions. Word has length 136 [2023-12-16 18:00:55,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:00:55,623 INFO L495 AbstractCegarLoop]: Abstraction has 6633 states and 7495 transitions. [2023-12-16 18:00:55,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:00:55,623 INFO L276 IsEmpty]: Start isEmpty. Operand 6633 states and 7495 transitions. [2023-12-16 18:00:55,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-12-16 18:00:55,626 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:00:55,626 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:00:55,629 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 (32)] Ended with exit code 0 [2023-12-16 18:00:55,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /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 [2023-12-16 18:00:55,829 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:00:55,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:00:55,829 INFO L85 PathProgramCache]: Analyzing trace with hash -206448956, now seen corresponding path program 1 times [2023-12-16 18:00:55,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:00:55,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1091192604] [2023-12-16 18:00:55,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:00:55,830 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 [2023-12-16 18:00:55,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:00:55,831 INFO L229 MonitoredProcess]: Starting monitored process 33 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) [2023-12-16 18:00:55,842 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 (33)] Waiting until timeout for monitored process [2023-12-16 18:00:55,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 18:00:55,900 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 18:00:55,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 18:00:56,084 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-16 18:00:56,084 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 18:00:56,085 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 18:00:56,092 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 (33)] Forceful destruction successful, exit code 0 [2023-12-16 18:00:56,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /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 [2023-12-16 18:00:56,292 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:00:56,295 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 18:00:56,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 06:00:56 BoogieIcfgContainer [2023-12-16 18:00:56,392 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 18:00:56,392 INFO L158 Benchmark]: Toolchain (without parser) took 55646.24ms. Allocated memory was 328.2MB in the beginning and 2.3GB in the end (delta: 2.0GB). Free memory was 279.9MB in the beginning and 1.7GB in the end (delta: -1.4GB). Peak memory consumption was 595.1MB. Max. memory is 8.0GB. [2023-12-16 18:00:56,392 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 194.0MB. Free memory was 147.4MB in the beginning and 147.3MB in the end (delta: 158.8kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 18:00:56,392 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.81ms. Allocated memory is still 328.2MB. Free memory was 279.9MB in the beginning and 265.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-16 18:00:56,392 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.30ms. Allocated memory is still 328.2MB. Free memory was 265.2MB in the beginning and 263.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 18:00:56,392 INFO L158 Benchmark]: Boogie Preprocessor took 35.88ms. Allocated memory is still 328.2MB. Free memory was 263.1MB in the beginning and 260.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 18:00:56,392 INFO L158 Benchmark]: RCFGBuilder took 484.79ms. Allocated memory is still 328.2MB. Free memory was 260.4MB in the beginning and 237.3MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-12-16 18:00:56,393 INFO L158 Benchmark]: TraceAbstraction took 54870.05ms. Allocated memory was 328.2MB in the beginning and 2.3GB in the end (delta: 2.0GB). Free memory was 236.5MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 552.1MB. Max. memory is 8.0GB. [2023-12-16 18:00:56,393 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 194.0MB. Free memory was 147.4MB in the beginning and 147.3MB in the end (delta: 158.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 221.81ms. Allocated memory is still 328.2MB. Free memory was 279.9MB in the beginning and 265.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.30ms. Allocated memory is still 328.2MB. Free memory was 265.2MB in the beginning and 263.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.88ms. Allocated memory is still 328.2MB. Free memory was 263.1MB in the beginning and 260.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 484.79ms. Allocated memory is still 328.2MB. Free memory was 260.4MB in the beginning and 237.3MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 54870.05ms. Allocated memory was 328.2MB in the beginning and 2.3GB in the end (delta: 2.0GB). Free memory was 236.5MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 552.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 306]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] msg_t nomsg = (msg_t )-1; [L26] char r1 ; [L27] port_t p1 ; [L28] char p1_old ; [L29] char p1_new ; [L30] char id1 ; [L31] char st1 ; [L32] msg_t send1 ; [L33] _Bool mode1 ; [L34] _Bool alive1 ; [L35] port_t p2 ; [L36] char p2_old ; [L37] char p2_new ; [L38] char id2 ; [L39] char st2 ; [L40] msg_t send2 ; [L41] _Bool mode2 ; [L42] _Bool alive2 ; [L43] port_t p3 ; [L44] char p3_old ; [L45] char p3_new ; [L46] char id3 ; [L47] char st3 ; [L48] msg_t send3 ; [L49] _Bool mode3 ; [L50] _Bool alive3 ; [L250] int c1 ; [L251] int i2 ; [L254] c1 = 0 [L255] r1 = __VERIFIER_nondet_char() [L256] id1 = __VERIFIER_nondet_char() [L257] st1 = __VERIFIER_nondet_char() [L258] send1 = __VERIFIER_nondet_char() [L259] mode1 = __VERIFIER_nondet_bool() [L260] alive1 = __VERIFIER_nondet_bool() [L261] id2 = __VERIFIER_nondet_char() [L262] st2 = __VERIFIER_nondet_char() [L263] send2 = __VERIFIER_nondet_char() [L264] mode2 = __VERIFIER_nondet_bool() [L265] alive2 = __VERIFIER_nondet_bool() [L266] id3 = __VERIFIER_nondet_char() [L267] st3 = __VERIFIER_nondet_char() [L268] send3 = __VERIFIER_nondet_char() [L269] mode3 = __VERIFIER_nondet_bool() [L270] alive3 = __VERIFIER_nondet_bool() [L271] CALL, EXPR init() [L153] int tmp ; VAL [nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0] [L156] COND TRUE (int )r1 == 0 VAL [nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0] [L157] COND TRUE ((int )alive1 + (int )alive2) + (int )alive3 >= 1 VAL [alive1=0, alive2=0, alive3=1, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0] [L158] COND TRUE (int )id1 >= 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0] [L159] COND TRUE (int )st1 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, st1=0] [L160] COND TRUE (int )send1 == (int )id1 VAL [alive1=0, alive2=0, alive3=1, id1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, st1=0] [L161] COND TRUE (int )mode1 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, st1=0] [L162] COND TRUE (int )id2 >= 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, st1=0] [L163] COND TRUE (int )st2 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, st1=0, st2=0] [L164] COND TRUE (int )send2 == (int )id2 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=64, st1=0, st2=0] [L165] COND TRUE (int )mode2 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=64, st1=0, st2=0] [L166] COND TRUE (int )id3 >= 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=64, st1=0, st2=0] [L167] COND TRUE (int )st3 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=64, st1=0, st2=0, st3=0] [L168] COND TRUE (int )send3 == (int )id3 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L169] COND TRUE (int )mode3 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L170] COND TRUE (int )id1 != (int )id2 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L171] COND TRUE (int )id1 != (int )id3 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L172] COND TRUE (int )id2 != (int )id3 [L173] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0, tmp=1] [L225] return (tmp); [L271] RET, EXPR init() [L271] i2 = init() [L272] COND FALSE !(!(i2)) VAL [alive1=0, alive2=0, alive3=1, c1=0, i2=1, id1=0, id2=64, id3=96, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L273] p1_old = nomsg [L274] p1_new = nomsg [L275] p2_old = nomsg [L276] p2_new = nomsg [L277] p3_old = nomsg [L278] p3_new = nomsg [L279] i2 = 0 VAL [alive1=0, alive2=0, alive3=1, c1=0, i2=0, id1=0, id2=64, id3=96, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L280] COND TRUE i2 < 6 [L282] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L57] COND FALSE !(\read(mode1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L75] COND FALSE !(\read(alive1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L78] mode1 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L282] RET node1() [L283] CALL node2() [L85] msg_t m2 ; [L88] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L89] COND FALSE !(\read(mode2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L106] COND FALSE !(\read(alive2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L109] COND FALSE !((int )send2 != (int )id2) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L112] mode2 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L283] RET node2() [L284] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L123] COND FALSE !(\read(mode3)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L140] COND TRUE \read(alive3) [L141] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=96, p3_old=-1, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L146] mode3 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=96, p3_old=-1, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L284] RET node3() [L285] p1_old = p1_new [L286] p1_new = nomsg [L287] p2_old = p2_new [L288] p2_new = nomsg [L289] p3_old = p3_new [L290] p3_new = nomsg [L291] CALL, EXPR check() [L230] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L233] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L234] COND TRUE (int )r1 < 3 [L235] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0, tmp=1] [L245] return (tmp); [L291] RET, EXPR check() [L291] c1 = check() [L292] CALL assert(c1) [L304] COND FALSE !(! arg) VAL [\old(arg)=1, alive1=0, alive2=0, alive3=1, arg=1, id1=0, id2=64, id3=96, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L292] RET assert(c1) [L293] i2 ++ VAL [alive1=0, alive2=0, alive3=1, c1=1, i2=1, id1=0, id2=64, id3=96, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L280] COND TRUE i2 < 6 [L282] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L57] COND TRUE \read(mode1) [L58] r1 = (char )((int )r1 + 1) [L59] m1 = p3_old [L60] p3_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=96, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L61] COND TRUE (int )m1 != (int )nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=96, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L62] COND FALSE !(\read(alive1)) [L70] send1 = m1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=96, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L73] mode1 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=96, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L282] RET node1() [L283] CALL node2() [L85] msg_t m2 ; [L88] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L89] COND TRUE \read(mode2) [L90] m2 = p1_old [L91] p1_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L92] COND FALSE !((int )m2 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L104] mode2 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L283] RET node2() [L284] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L123] COND TRUE \read(mode3) [L124] m3 = p2_old [L125] p2_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L126] COND FALSE !((int )m3 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L138] mode3 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L284] RET node3() [L285] p1_old = p1_new [L286] p1_new = nomsg [L287] p2_old = p2_new [L288] p2_new = nomsg [L289] p3_old = p3_new [L290] p3_new = nomsg [L291] CALL, EXPR check() [L230] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L233] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L234] COND TRUE (int )r1 < 3 [L235] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0, tmp=1] [L245] return (tmp); [L291] RET, EXPR check() [L291] c1 = check() [L292] CALL assert(c1) [L304] COND FALSE !(! arg) VAL [\old(arg)=1, alive1=0, alive2=0, alive3=1, arg=1, id1=0, id2=64, id3=96, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L292] RET assert(c1) [L293] i2 ++ VAL [alive1=0, alive2=0, alive3=1, c1=1, i2=2, id1=0, id2=64, id3=96, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L280] COND TRUE i2 < 6 [L282] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L57] COND FALSE !(\read(mode1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L75] COND FALSE !(\read(alive1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L78] mode1 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L282] RET node1() [L283] CALL node2() [L85] msg_t m2 ; [L88] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L89] COND FALSE !(\read(mode2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L106] COND FALSE !(\read(alive2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L109] COND FALSE !((int )send2 != (int )id2) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L112] mode2 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L283] RET node2() [L284] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L123] COND FALSE !(\read(mode3)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L140] COND TRUE \read(alive3) [L141] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=96, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L146] mode3 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=96, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L284] RET node3() [L285] p1_old = p1_new [L286] p1_new = nomsg [L287] p2_old = p2_new [L288] p2_new = nomsg [L289] p3_old = p3_new [L290] p3_new = nomsg [L291] CALL, EXPR check() [L230] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L233] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L234] COND TRUE (int )r1 < 3 [L235] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0, tmp=1] [L245] return (tmp); [L291] RET, EXPR check() [L291] c1 = check() [L292] CALL assert(c1) [L304] COND FALSE !(! arg) VAL [\old(arg)=1, alive1=0, alive2=0, alive3=1, arg=1, id1=0, id2=64, id3=96, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L292] RET assert(c1) [L293] i2 ++ VAL [alive1=0, alive2=0, alive3=1, c1=1, i2=3, id1=0, id2=64, id3=96, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L280] COND TRUE i2 < 6 [L282] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L57] COND TRUE \read(mode1) [L58] r1 = (char )((int )r1 + 1) [L59] m1 = p3_old [L60] p3_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=96, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L61] COND TRUE (int )m1 != (int )nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=96, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L62] COND FALSE !(\read(alive1)) [L70] send1 = m1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=96, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L73] mode1 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=96, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L282] RET node1() [L283] CALL node2() [L85] msg_t m2 ; [L88] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L89] COND TRUE \read(mode2) [L90] m2 = p1_old [L91] p1_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L92] COND FALSE !((int )m2 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L104] mode2 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L283] RET node2() [L284] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L123] COND TRUE \read(mode3) [L124] m3 = p2_old [L125] p2_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L126] COND FALSE !((int )m3 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L138] mode3 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L284] RET node3() [L285] p1_old = p1_new [L286] p1_new = nomsg [L287] p2_old = p2_new [L288] p2_new = nomsg [L289] p3_old = p3_new [L290] p3_new = nomsg [L291] CALL, EXPR check() [L230] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L233] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L234] COND TRUE (int )r1 < 3 [L235] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0, tmp=1] [L245] return (tmp); [L291] RET, EXPR check() [L291] c1 = check() [L292] CALL assert(c1) [L304] COND FALSE !(! arg) VAL [\old(arg)=1, alive1=0, alive2=0, alive3=1, arg=1, id1=0, id2=64, id3=96, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L292] RET assert(c1) [L293] i2 ++ VAL [alive1=0, alive2=0, alive3=1, c1=1, i2=4, id1=0, id2=64, id3=96, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L280] COND TRUE i2 < 6 [L282] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L57] COND FALSE !(\read(mode1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L75] COND FALSE !(\read(alive1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L78] mode1 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L282] RET node1() [L283] CALL node2() [L85] msg_t m2 ; [L88] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L89] COND FALSE !(\read(mode2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L106] COND FALSE !(\read(alive2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L109] COND FALSE !((int )send2 != (int )id2) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L112] mode2 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L283] RET node2() [L284] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L123] COND FALSE !(\read(mode3)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L140] COND TRUE \read(alive3) [L141] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=96, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L146] mode3 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=96, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L284] RET node3() [L285] p1_old = p1_new [L286] p1_new = nomsg [L287] p2_old = p2_new [L288] p2_new = nomsg [L289] p3_old = p3_new [L290] p3_new = nomsg [L291] CALL, EXPR check() [L230] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L233] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L234] COND TRUE (int )r1 < 3 [L235] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0, tmp=1] [L245] return (tmp); [L291] RET, EXPR check() [L291] c1 = check() [L292] CALL assert(c1) [L304] COND FALSE !(! arg) VAL [\old(arg)=1, alive1=0, alive2=0, alive3=1, arg=1, id1=0, id2=64, id3=96, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L292] RET assert(c1) [L293] i2 ++ VAL [alive1=0, alive2=0, alive3=1, c1=1, i2=5, id1=0, id2=64, id3=96, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L280] COND TRUE i2 < 6 [L282] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L57] COND TRUE \read(mode1) [L58] r1 = (char )((int )r1 + 1) [L59] m1 = p3_old [L60] p3_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=96, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L61] COND TRUE (int )m1 != (int )nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=96, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L62] COND FALSE !(\read(alive1)) [L70] send1 = m1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=96, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L73] mode1 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=96, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L282] RET node1() [L283] CALL node2() [L85] msg_t m2 ; [L88] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L89] COND TRUE \read(mode2) [L90] m2 = p1_old [L91] p1_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L92] COND FALSE !((int )m2 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L104] mode2 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L283] RET node2() [L284] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L123] COND TRUE \read(mode3) [L124] m3 = p2_old [L125] p2_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L126] COND FALSE !((int )m3 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L138] mode3 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L284] RET node3() [L285] p1_old = p1_new [L286] p1_new = nomsg [L287] p2_old = p2_new [L288] p2_new = nomsg [L289] p3_old = p3_new [L290] p3_new = nomsg [L291] CALL, EXPR check() [L230] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L233] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L234] COND FALSE !((int )r1 < 3) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L237] COND FALSE !(((int )st1 + (int )st2) + (int )st3 == 1) [L240] tmp = 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0, tmp=0] [L245] return (tmp); [L291] RET, EXPR check() [L291] c1 = check() [L292] CALL assert(c1) [L304] COND TRUE ! arg VAL [\old(arg)=0, alive1=0, alive2=0, alive3=1, arg=0, id1=0, id2=64, id3=96, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L306] reach_error() VAL [\old(arg)=0, alive1=0, alive2=0, alive3=1, arg=0, id1=0, id2=64, id3=96, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 54.7s, OverallIterations: 32, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 28.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9885 SdHoareTripleChecker+Valid, 9.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9885 mSDsluCounter, 16895 SdHoareTripleChecker+Invalid, 8.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13692 mSDsCounter, 271 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11932 IncrementalHoareTripleChecker+Invalid, 12203 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 271 mSolverCounterUnsat, 3203 mSDtfsCounter, 11932 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3450 GetRequests, 2922 SyntacticMatches, 0 SemanticMatches, 528 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6859 ImplicationChecksByTransitivity, 14.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21812occurred in iteration=19, InterpolantAutomatonStates: 429, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.9s AutomataMinimizationTime, 31 MinimizatonAttempts, 42626 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 10.4s InterpolantComputationTime, 2274 NumberOfCodeBlocks, 2274 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 3142 ConstructedInterpolants, 563 QuantifiedInterpolants, 25575 SizeOfPredicates, 85 NumberOfNonLiveVariables, 4226 ConjunctsInSsa, 165 ConjunctsInUnsatCore, 45 InterpolantComputations, 17 PerfectInterpolantSequences, 1226/1732 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-12-16 18:00:56,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...