/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/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label04.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 07:49:12,997 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 07:49:13,057 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 07:49:13,061 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 07:49:13,061 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 07:49:13,089 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 07:49:13,089 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 07:49:13,089 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 07:49:13,090 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 07:49:13,093 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 07:49:13,093 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 07:49:13,093 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 07:49:13,093 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 07:49:13,095 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 07:49:13,095 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 07:49:13,095 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 07:49:13,095 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 07:49:13,096 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 07:49:13,096 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 07:49:13,097 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 07:49:13,097 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 07:49:13,097 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 07:49:13,097 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 07:49:13,097 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 07:49:13,097 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 07:49:13,098 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 07:49:13,098 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 07:49:13,098 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 07:49:13,098 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 07:49:13,098 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 07:49:13,099 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 07:49:13,099 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 07:49:13,099 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 07:49:13,099 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 07:49:13,099 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 07:49:13,099 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 07:49:13,099 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 07:49:13,100 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 07:49:13,100 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 07:49:13,100 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 07:49:13,100 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 07:49:13,100 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 07:49:13,100 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 07:49:13,100 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 07:49:13,101 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 07:49:13,101 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 07:49:13,101 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 07:49:13,278 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 07:49:13,300 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 07:49:13,302 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 07:49:13,303 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 07:49:13,303 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 07:49:13,305 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label04.c [2023-12-16 07:49:14,303 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 07:49:14,649 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 07:49:14,649 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label04.c [2023-12-16 07:49:14,673 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dfb435cc/5d4b6342995544dc95ab1683661eaf7b/FLAGf0e2561e1 [2023-12-16 07:49:14,687 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dfb435cc/5d4b6342995544dc95ab1683661eaf7b [2023-12-16 07:49:14,689 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 07:49:14,690 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 07:49:14,692 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 07:49:14,692 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 07:49:14,695 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 07:49:14,696 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:49:14" (1/1) ... [2023-12-16 07:49:14,697 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b018781 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:49:14, skipping insertion in model container [2023-12-16 07:49:14,697 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:49:14" (1/1) ... [2023-12-16 07:49:14,791 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 07:49:15,039 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label04.c[6354,6367] [2023-12-16 07:49:15,095 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label04.c[13415,13428] [2023-12-16 07:49:15,571 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 07:49:15,583 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 07:49:15,618 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label04.c[6354,6367] [2023-12-16 07:49:15,625 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label04.c[13415,13428] [2023-12-16 07:49:15,988 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 07:49:16,004 INFO L206 MainTranslator]: Completed translation [2023-12-16 07:49:16,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:49:16 WrapperNode [2023-12-16 07:49:16,005 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 07:49:16,006 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 07:49:16,006 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 07:49:16,006 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 07:49:16,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:49:16" (1/1) ... [2023-12-16 07:49:16,039 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:49:16" (1/1) ... [2023-12-16 07:49:16,125 INFO L138 Inliner]: procedures = 34, calls = 19, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 4961 [2023-12-16 07:49:16,125 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 07:49:16,126 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 07:49:16,126 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 07:49:16,126 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 07:49:16,134 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:49:16" (1/1) ... [2023-12-16 07:49:16,134 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:49:16" (1/1) ... [2023-12-16 07:49:16,171 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:49:16" (1/1) ... [2023-12-16 07:49:16,227 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 07:49:16,227 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:49:16" (1/1) ... [2023-12-16 07:49:16,227 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:49:16" (1/1) ... [2023-12-16 07:49:16,283 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:49:16" (1/1) ... [2023-12-16 07:49:16,303 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:49:16" (1/1) ... [2023-12-16 07:49:16,323 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:49:16" (1/1) ... [2023-12-16 07:49:16,338 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:49:16" (1/1) ... [2023-12-16 07:49:16,364 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 07:49:16,365 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 07:49:16,365 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 07:49:16,365 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 07:49:16,366 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:49:16" (1/1) ... [2023-12-16 07:49:16,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 07:49:16,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 07:49:16,400 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 07:49:16,420 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 07:49:16,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 07:49:16,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 07:49:16,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 07:49:16,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 07:49:16,517 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 07:49:16,519 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 07:49:39,562 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 07:49:39,610 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 07:49:39,610 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-16 07:49:39,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:49:39 BoogieIcfgContainer [2023-12-16 07:49:39,611 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 07:49:39,612 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 07:49:39,612 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 07:49:39,614 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 07:49:39,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 07:49:14" (1/3) ... [2023-12-16 07:49:39,615 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c96512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:49:39, skipping insertion in model container [2023-12-16 07:49:39,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:49:16" (2/3) ... [2023-12-16 07:49:39,615 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c96512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:49:39, skipping insertion in model container [2023-12-16 07:49:39,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:49:39" (3/3) ... [2023-12-16 07:49:39,616 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label04.c [2023-12-16 07:49:39,626 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 07:49:39,626 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-16 07:49:39,670 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 07:49:39,674 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;@630ffbb1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 07:49:39,674 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-16 07:49:39,680 INFO L276 IsEmpty]: Start isEmpty. Operand has 807 states, 804 states have (on average 1.9800995024875623) internal successors, (1592), 806 states have internal predecessors, (1592), 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 07:49:39,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-16 07:49:39,684 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:49:39,685 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:49:39,685 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:49:39,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:49:39,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1841440842, now seen corresponding path program 1 times [2023-12-16 07:49:39,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:49:39,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1897892446] [2023-12-16 07:49:39,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:49:39,697 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 07:49:39,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:49:39,699 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 07:49:39,706 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 07:49:39,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:49:39,803 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 07:49:39,806 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:49:39,819 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 07:49:39,819 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:49:39,820 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:49:39,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1897892446] [2023-12-16 07:49:39,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1897892446] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:49:39,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:49:39,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 07:49:39,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101432010] [2023-12-16 07:49:39,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:49:39,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 07:49:39,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:49:39,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 07:49:39,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 07:49:39,851 INFO L87 Difference]: Start difference. First operand has 807 states, 804 states have (on average 1.9800995024875623) internal successors, (1592), 806 states have internal predecessors, (1592), 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 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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 07:49:39,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:49:39,927 INFO L93 Difference]: Finished difference Result 1594 states and 3146 transitions. [2023-12-16 07:49:39,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 07:49:39,933 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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 17 [2023-12-16 07:49:39,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:49:39,950 INFO L225 Difference]: With dead ends: 1594 [2023-12-16 07:49:39,951 INFO L226 Difference]: Without dead ends: 803 [2023-12-16 07:49:39,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 07:49:39,959 INFO L413 NwaCegarLoop]: 1521 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1521 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:49:39,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1521 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:49:39,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2023-12-16 07:49:40,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 803. [2023-12-16 07:49:40,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 801 states have (on average 1.898876404494382) internal successors, (1521), 802 states have internal predecessors, (1521), 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 07:49:40,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1521 transitions. [2023-12-16 07:49:40,023 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1521 transitions. Word has length 17 [2023-12-16 07:49:40,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:49:40,024 INFO L495 AbstractCegarLoop]: Abstraction has 803 states and 1521 transitions. [2023-12-16 07:49:40,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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 07:49:40,024 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1521 transitions. [2023-12-16 07:49:40,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-16 07:49:40,025 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:49:40,025 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:49:40,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-16 07:49:40,230 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 07:49:40,230 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:49:40,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:49:40,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1254634828, now seen corresponding path program 1 times [2023-12-16 07:49:40,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:49:40,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [895301737] [2023-12-16 07:49:40,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:49:40,232 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 07:49:40,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:49:40,233 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 07:49:40,234 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 07:49:40,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:49:40,277 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 07:49:40,277 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:49:40,304 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 07:49:40,304 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:49:40,305 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:49:40,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [895301737] [2023-12-16 07:49:40,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [895301737] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:49:40,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:49:40,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 07:49:40,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661660675] [2023-12-16 07:49:40,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:49:40,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 07:49:40,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:49:40,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 07:49:40,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 07:49:40,308 INFO L87 Difference]: Start difference. First operand 803 states and 1521 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 07:49:40,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:49:40,377 INFO L93 Difference]: Finished difference Result 864 states and 1616 transitions. [2023-12-16 07:49:40,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 07:49:40,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2023-12-16 07:49:40,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:49:40,380 INFO L225 Difference]: With dead ends: 864 [2023-12-16 07:49:40,380 INFO L226 Difference]: Without dead ends: 832 [2023-12-16 07:49:40,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 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 07:49:40,382 INFO L413 NwaCegarLoop]: 1516 mSDtfsCounter, 45 mSDsluCounter, 3011 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 4527 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:49:40,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 4527 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:49:40,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2023-12-16 07:49:40,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 803. [2023-12-16 07:49:40,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 801 states have (on average 1.8789013732833957) internal successors, (1505), 802 states have internal predecessors, (1505), 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 07:49:40,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1505 transitions. [2023-12-16 07:49:40,403 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1505 transitions. Word has length 17 [2023-12-16 07:49:40,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:49:40,403 INFO L495 AbstractCegarLoop]: Abstraction has 803 states and 1505 transitions. [2023-12-16 07:49:40,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 07:49:40,404 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1505 transitions. [2023-12-16 07:49:40,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-16 07:49:40,405 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:49:40,405 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] [2023-12-16 07:49:40,410 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 07:49:40,607 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 07:49:40,607 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:49:40,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:49:40,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1671741616, now seen corresponding path program 1 times [2023-12-16 07:49:40,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:49:40,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1084920964] [2023-12-16 07:49:40,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:49:40,611 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 07:49:40,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:49:40,613 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 07:49:40,625 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 07:49:40,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:49:40,672 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 07:49:40,673 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:49:40,885 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 07:49:40,885 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:49:40,885 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:49:40,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1084920964] [2023-12-16 07:49:40,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1084920964] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:49:40,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:49:40,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 07:49:40,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217608091] [2023-12-16 07:49:40,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:49:40,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 07:49:40,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:49:40,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 07:49:40,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-16 07:49:40,887 INFO L87 Difference]: Start difference. First operand 803 states and 1505 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 07:49:40,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:49:40,977 INFO L93 Difference]: Finished difference Result 919 states and 1689 transitions. [2023-12-16 07:49:40,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 07:49:40,978 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 32 [2023-12-16 07:49:40,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:49:40,981 INFO L225 Difference]: With dead ends: 919 [2023-12-16 07:49:40,981 INFO L226 Difference]: Without dead ends: 890 [2023-12-16 07:49:40,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 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 07:49:40,982 INFO L413 NwaCegarLoop]: 1499 mSDtfsCounter, 3033 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3033 SdHoareTripleChecker+Valid, 1656 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 07:49:40,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3033 Valid, 1656 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 07:49:40,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2023-12-16 07:49:40,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 857. [2023-12-16 07:49:40,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 855 states have (on average 1.8619883040935672) internal successors, (1592), 856 states have internal predecessors, (1592), 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 07:49:40,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1592 transitions. [2023-12-16 07:49:40,994 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1592 transitions. Word has length 32 [2023-12-16 07:49:40,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:49:40,994 INFO L495 AbstractCegarLoop]: Abstraction has 857 states and 1592 transitions. [2023-12-16 07:49:40,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 07:49:40,995 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1592 transitions. [2023-12-16 07:49:40,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-16 07:49:40,998 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:49:40,998 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] [2023-12-16 07:49:41,001 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 07:49:41,200 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 07:49:41,200 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:49:41,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:49:41,201 INFO L85 PathProgramCache]: Analyzing trace with hash -349537184, now seen corresponding path program 1 times [2023-12-16 07:49:41,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:49:41,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1606411606] [2023-12-16 07:49:41,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:49:41,202 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 07:49:41,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:49:41,202 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 07:49:41,216 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 07:49:41,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:49:41,249 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 07:49:41,250 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:49:41,295 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 07:49:41,296 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:49:41,296 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:49:41,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1606411606] [2023-12-16 07:49:41,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1606411606] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:49:41,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:49:41,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 07:49:41,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522294980] [2023-12-16 07:49:41,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:49:41,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 07:49:41,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:49:41,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 07:49:41,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:49:41,302 INFO L87 Difference]: Start difference. First operand 857 states and 1592 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 07:49:41,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:49:41,337 INFO L93 Difference]: Finished difference Result 1007 states and 1830 transitions. [2023-12-16 07:49:41,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 07:49:41,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 34 [2023-12-16 07:49:41,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:49:41,343 INFO L225 Difference]: With dead ends: 1007 [2023-12-16 07:49:41,343 INFO L226 Difference]: Without dead ends: 924 [2023-12-16 07:49:41,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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 07:49:41,346 INFO L413 NwaCegarLoop]: 1501 mSDtfsCounter, 1464 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1464 SdHoareTripleChecker+Valid, 1541 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:49:41,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1464 Valid, 1541 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:49:41,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2023-12-16 07:49:41,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 922. [2023-12-16 07:49:41,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 920 states have (on average 1.8380434782608697) internal successors, (1691), 921 states have internal predecessors, (1691), 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 07:49:41,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1691 transitions. [2023-12-16 07:49:41,362 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1691 transitions. Word has length 34 [2023-12-16 07:49:41,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:49:41,362 INFO L495 AbstractCegarLoop]: Abstraction has 922 states and 1691 transitions. [2023-12-16 07:49:41,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 07:49:41,363 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1691 transitions. [2023-12-16 07:49:41,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-16 07:49:41,365 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:49:41,365 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] [2023-12-16 07:49:41,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-16 07:49:41,567 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 07:49:41,568 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:49:41,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:49:41,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1987359035, now seen corresponding path program 1 times [2023-12-16 07:49:41,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:49:41,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [953685611] [2023-12-16 07:49:41,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:49:41,569 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 07:49:41,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:49:41,570 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 07:49:41,572 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 07:49:41,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:49:41,618 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 07:49:41,620 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:49:41,650 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 07:49:41,650 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:49:41,651 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:49:41,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [953685611] [2023-12-16 07:49:41,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [953685611] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:49:41,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:49:41,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 07:49:41,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107491349] [2023-12-16 07:49:41,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:49:41,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 07:49:41,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:49:41,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 07:49:41,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 07:49:41,652 INFO L87 Difference]: Start difference. First operand 922 states and 1691 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 07:49:41,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:49:41,692 INFO L93 Difference]: Finished difference Result 936 states and 1708 transitions. [2023-12-16 07:49:41,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 07:49:41,693 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 35 [2023-12-16 07:49:41,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:49:41,696 INFO L225 Difference]: With dead ends: 936 [2023-12-16 07:49:41,696 INFO L226 Difference]: Without dead ends: 934 [2023-12-16 07:49:41,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 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 07:49:41,697 INFO L413 NwaCegarLoop]: 1501 mSDtfsCounter, 1 mSDsluCounter, 2994 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4495 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:49:41,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4495 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:49:41,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2023-12-16 07:49:41,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 930. [2023-12-16 07:49:41,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 928 states have (on average 1.8297413793103448) internal successors, (1698), 929 states have internal predecessors, (1698), 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 07:49:41,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1698 transitions. [2023-12-16 07:49:41,714 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1698 transitions. Word has length 35 [2023-12-16 07:49:41,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:49:41,714 INFO L495 AbstractCegarLoop]: Abstraction has 930 states and 1698 transitions. [2023-12-16 07:49:41,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 07:49:41,716 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1698 transitions. [2023-12-16 07:49:41,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-16 07:49:41,719 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:49:41,719 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] [2023-12-16 07:49:41,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-16 07:49:41,922 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 07:49:41,923 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:49:41,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:49:41,924 INFO L85 PathProgramCache]: Analyzing trace with hash 177158552, now seen corresponding path program 1 times [2023-12-16 07:49:41,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:49:41,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [426813435] [2023-12-16 07:49:41,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:49:41,925 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 07:49:41,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:49:41,926 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 07:49:41,940 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 07:49:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:49:41,973 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 07:49:41,974 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:49:42,011 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 07:49:42,012 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:49:42,012 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:49:42,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [426813435] [2023-12-16 07:49:42,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [426813435] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:49:42,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:49:42,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 07:49:42,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428354081] [2023-12-16 07:49:42,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:49:42,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 07:49:42,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:49:42,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 07:49:42,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:49:42,013 INFO L87 Difference]: Start difference. First operand 930 states and 1698 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 07:49:42,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:49:42,049 INFO L93 Difference]: Finished difference Result 1098 states and 1958 transitions. [2023-12-16 07:49:42,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 07:49:42,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 36 [2023-12-16 07:49:42,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:49:42,053 INFO L225 Difference]: With dead ends: 1098 [2023-12-16 07:49:42,053 INFO L226 Difference]: Without dead ends: 1009 [2023-12-16 07:49:42,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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 07:49:42,055 INFO L413 NwaCegarLoop]: 1532 mSDtfsCounter, 1474 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1578 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 07:49:42,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1578 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:49:42,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2023-12-16 07:49:42,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1007. [2023-12-16 07:49:42,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 1005 states have (on average 1.8049751243781094) internal successors, (1814), 1006 states have internal predecessors, (1814), 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 07:49:42,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1814 transitions. [2023-12-16 07:49:42,069 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1814 transitions. Word has length 36 [2023-12-16 07:49:42,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:49:42,069 INFO L495 AbstractCegarLoop]: Abstraction has 1007 states and 1814 transitions. [2023-12-16 07:49:42,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 07:49:42,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1814 transitions. [2023-12-16 07:49:42,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-16 07:49:42,070 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:49:42,070 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] [2023-12-16 07:49:42,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-16 07:49:42,273 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 07:49:42,273 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:49:42,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:49:42,274 INFO L85 PathProgramCache]: Analyzing trace with hash -448497512, now seen corresponding path program 1 times [2023-12-16 07:49:42,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:49:42,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1420094379] [2023-12-16 07:49:42,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:49:42,274 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 07:49:42,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:49:42,275 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 07:49:42,276 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 07:49:42,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:49:42,317 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 07:49:42,318 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:49:42,343 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 07:49:42,343 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:49:42,343 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:49:42,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1420094379] [2023-12-16 07:49:42,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1420094379] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:49:42,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:49:42,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 07:49:42,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970809344] [2023-12-16 07:49:42,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:49:42,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 07:49:42,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:49:42,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 07:49:42,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:49:42,344 INFO L87 Difference]: Start difference. First operand 1007 states and 1814 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 07:49:42,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:49:42,371 INFO L93 Difference]: Finished difference Result 1433 states and 2457 transitions. [2023-12-16 07:49:42,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 07:49:42,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 36 [2023-12-16 07:49:42,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:49:42,374 INFO L225 Difference]: With dead ends: 1433 [2023-12-16 07:49:42,375 INFO L226 Difference]: Without dead ends: 1202 [2023-12-16 07:49:42,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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 07:49:42,375 INFO L413 NwaCegarLoop]: 1534 mSDtfsCounter, 1472 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1472 SdHoareTripleChecker+Valid, 1584 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 07:49:42,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1472 Valid, 1584 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:49:42,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2023-12-16 07:49:42,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 1200. [2023-12-16 07:49:42,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1200 states, 1198 states have (on average 1.7479131886477461) internal successors, (2094), 1199 states have internal predecessors, (2094), 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 07:49:42,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 2094 transitions. [2023-12-16 07:49:42,391 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 2094 transitions. Word has length 36 [2023-12-16 07:49:42,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:49:42,391 INFO L495 AbstractCegarLoop]: Abstraction has 1200 states and 2094 transitions. [2023-12-16 07:49:42,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 07:49:42,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 2094 transitions. [2023-12-16 07:49:42,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-16 07:49:42,391 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:49:42,391 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] [2023-12-16 07:49:42,396 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 07:49:42,594 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 07:49:42,595 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:49:42,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:49:42,595 INFO L85 PathProgramCache]: Analyzing trace with hash 440235928, now seen corresponding path program 1 times [2023-12-16 07:49:42,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:49:42,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [504899946] [2023-12-16 07:49:42,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:49:42,596 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 07:49:42,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:49:42,596 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 07:49:42,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-16 07:49:42,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:49:42,650 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 07:49:42,651 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:49:42,682 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 07:49:42,682 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:49:42,682 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:49:42,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [504899946] [2023-12-16 07:49:42,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [504899946] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:49:42,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:49:42,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 07:49:42,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102943516] [2023-12-16 07:49:42,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:49:42,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 07:49:42,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:49:42,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 07:49:42,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:49:42,686 INFO L87 Difference]: Start difference. First operand 1200 states and 2094 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 07:49:42,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:49:42,725 INFO L93 Difference]: Finished difference Result 1976 states and 3234 transitions. [2023-12-16 07:49:42,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 07:49:42,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 36 [2023-12-16 07:49:42,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:49:42,731 INFO L225 Difference]: With dead ends: 1976 [2023-12-16 07:49:42,731 INFO L226 Difference]: Without dead ends: 1552 [2023-12-16 07:49:42,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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 07:49:42,732 INFO L413 NwaCegarLoop]: 1532 mSDtfsCounter, 1470 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1470 SdHoareTripleChecker+Valid, 1586 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 07:49:42,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1470 Valid, 1586 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:49:42,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2023-12-16 07:49:42,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1550. [2023-12-16 07:49:42,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1550 states, 1548 states have (on average 1.6679586563307494) internal successors, (2582), 1549 states have internal predecessors, (2582), 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 07:49:42,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2582 transitions. [2023-12-16 07:49:42,755 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 2582 transitions. Word has length 36 [2023-12-16 07:49:42,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:49:42,756 INFO L495 AbstractCegarLoop]: Abstraction has 1550 states and 2582 transitions. [2023-12-16 07:49:42,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 07:49:42,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 2582 transitions. [2023-12-16 07:49:42,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-16 07:49:42,757 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:49:42,758 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-16 07:49:42,763 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 07:49:42,960 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 07:49:42,961 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:49:42,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:49:42,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1612908441, now seen corresponding path program 1 times [2023-12-16 07:49:42,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:49:42,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [645252821] [2023-12-16 07:49:42,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:49:42,961 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 07:49:42,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:49:42,963 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 07:49:42,965 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 07:49:43,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:49:43,021 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 07:49:43,023 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:49:43,609 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 07:49:43,609 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:49:43,840 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 07:49:43,840 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:49:43,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [645252821] [2023-12-16 07:49:43,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [645252821] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:49:43,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:49:43,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2023-12-16 07:49:43,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42932192] [2023-12-16 07:49:43,840 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:49:43,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-16 07:49:43,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:49:43,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-16 07:49:43,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-12-16 07:49:43,841 INFO L87 Difference]: Start difference. First operand 1550 states and 2582 transitions. Second operand has 16 states, 16 states have (on average 5.625) internal successors, (90), 16 states have internal predecessors, (90), 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 07:49:45,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:49:45,144 INFO L93 Difference]: Finished difference Result 3268 states and 5027 transitions. [2023-12-16 07:49:45,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-16 07:49:45,145 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.625) internal successors, (90), 16 states have internal predecessors, (90), 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 50 [2023-12-16 07:49:45,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:49:45,151 INFO L225 Difference]: With dead ends: 3268 [2023-12-16 07:49:45,151 INFO L226 Difference]: Without dead ends: 2714 [2023-12-16 07:49:45,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=249, Invalid=743, Unknown=0, NotChecked=0, Total=992 [2023-12-16 07:49:45,152 INFO L413 NwaCegarLoop]: 1500 mSDtfsCounter, 3325 mSDsluCounter, 13527 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3325 SdHoareTripleChecker+Valid, 15027 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-16 07:49:45,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3325 Valid, 15027 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-16 07:49:45,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2714 states. [2023-12-16 07:49:45,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2714 to 2322. [2023-12-16 07:49:45,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2322 states, 2320 states have (on average 1.5905172413793103) internal successors, (3690), 2321 states have internal predecessors, (3690), 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 07:49:45,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2322 states to 2322 states and 3690 transitions. [2023-12-16 07:49:45,202 INFO L78 Accepts]: Start accepts. Automaton has 2322 states and 3690 transitions. Word has length 50 [2023-12-16 07:49:45,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:49:45,202 INFO L495 AbstractCegarLoop]: Abstraction has 2322 states and 3690 transitions. [2023-12-16 07:49:45,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.625) internal successors, (90), 16 states have internal predecessors, (90), 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 07:49:45,202 INFO L276 IsEmpty]: Start isEmpty. Operand 2322 states and 3690 transitions. [2023-12-16 07:49:45,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-16 07:49:45,203 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:49:45,203 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-16 07:49:45,208 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 07:49:45,405 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 07:49:45,405 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:49:45,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:49:45,406 INFO L85 PathProgramCache]: Analyzing trace with hash 2056402791, now seen corresponding path program 1 times [2023-12-16 07:49:45,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:49:45,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [151434571] [2023-12-16 07:49:45,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:49:45,406 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 07:49:45,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:49:45,409 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 07:49:45,430 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 07:49:45,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:49:45,468 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 07:49:45,469 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:49:45,488 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 07:49:45,489 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:49:45,489 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:49:45,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [151434571] [2023-12-16 07:49:45,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [151434571] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:49:45,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:49:45,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 07:49:45,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260870602] [2023-12-16 07:49:45,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:49:45,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 07:49:45,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:49:45,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 07:49:45,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:49:45,490 INFO L87 Difference]: Start difference. First operand 2322 states and 3690 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 07:49:45,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:49:45,529 INFO L93 Difference]: Finished difference Result 3444 states and 5327 transitions. [2023-12-16 07:49:45,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 07:49:45,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 50 [2023-12-16 07:49:45,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:49:45,535 INFO L225 Difference]: With dead ends: 3444 [2023-12-16 07:49:45,535 INFO L226 Difference]: Without dead ends: 1898 [2023-12-16 07:49:45,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 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 07:49:45,536 INFO L413 NwaCegarLoop]: 1526 mSDtfsCounter, 31 mSDsluCounter, 1491 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 3017 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 07:49:45,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 3017 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:49:45,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2023-12-16 07:49:45,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1891. [2023-12-16 07:49:45,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1891 states, 1889 states have (on average 1.6236103758602436) internal successors, (3067), 1890 states have internal predecessors, (3067), 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 07:49:45,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1891 states and 3067 transitions. [2023-12-16 07:49:45,568 INFO L78 Accepts]: Start accepts. Automaton has 1891 states and 3067 transitions. Word has length 50 [2023-12-16 07:49:45,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:49:45,569 INFO L495 AbstractCegarLoop]: Abstraction has 1891 states and 3067 transitions. [2023-12-16 07:49:45,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 07:49:45,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 3067 transitions. [2023-12-16 07:49:45,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-16 07:49:45,569 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:49:45,569 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] [2023-12-16 07:49:45,574 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 07:49:45,772 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 07:49:45,772 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:49:45,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:49:45,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1763012615, now seen corresponding path program 1 times [2023-12-16 07:49:45,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:49:45,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [993022149] [2023-12-16 07:49:45,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:49:45,773 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 07:49:45,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:49:45,774 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 07:49:45,778 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 07:49:45,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:49:45,828 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 07:49:45,829 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:49:45,852 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 07:49:45,853 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:49:45,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:49:45,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [993022149] [2023-12-16 07:49:45,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [993022149] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:49:45,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:49:45,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 07:49:45,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11097289] [2023-12-16 07:49:45,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:49:45,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 07:49:45,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:49:45,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 07:49:45,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:49:45,854 INFO L87 Difference]: Start difference. First operand 1891 states and 3067 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 07:49:45,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:49:45,883 INFO L93 Difference]: Finished difference Result 2447 states and 3867 transitions. [2023-12-16 07:49:45,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 07:49:45,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 52 [2023-12-16 07:49:45,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:49:45,888 INFO L225 Difference]: With dead ends: 2447 [2023-12-16 07:49:45,888 INFO L226 Difference]: Without dead ends: 1341 [2023-12-16 07:49:45,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 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 07:49:45,889 INFO L413 NwaCegarLoop]: 1519 mSDtfsCounter, 27 mSDsluCounter, 1483 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 3002 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 07:49:45,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 3002 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:49:45,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2023-12-16 07:49:45,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 1339. [2023-12-16 07:49:45,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1339 states, 1337 states have (on average 1.68810770381451) internal successors, (2257), 1338 states have internal predecessors, (2257), 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 07:49:45,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 2257 transitions. [2023-12-16 07:49:45,910 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 2257 transitions. Word has length 52 [2023-12-16 07:49:45,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:49:45,910 INFO L495 AbstractCegarLoop]: Abstraction has 1339 states and 2257 transitions. [2023-12-16 07:49:45,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 07:49:45,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 2257 transitions. [2023-12-16 07:49:45,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-16 07:49:45,911 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:49:45,911 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] [2023-12-16 07:49:45,916 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 (12)] Ended with exit code 0 [2023-12-16 07:49:46,113 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 07:49:46,114 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:49:46,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:49:46,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1511501427, now seen corresponding path program 1 times [2023-12-16 07:49:46,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:49:46,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [835736295] [2023-12-16 07:49:46,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:49:46,114 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 07:49:46,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:49:46,115 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 07:49:46,139 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 07:49:46,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:49:46,173 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 07:49:46,174 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:49:46,702 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 07:49:46,702 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:49:46,896 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 07:49:46,896 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:49:46,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [835736295] [2023-12-16 07:49:46,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [835736295] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:49:46,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:49:46,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2023-12-16 07:49:46,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460012580] [2023-12-16 07:49:46,897 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:49:46,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-16 07:49:46,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:49:46,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-16 07:49:46,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-12-16 07:49:46,898 INFO L87 Difference]: Start difference. First operand 1339 states and 2257 transitions. Second operand has 16 states, 16 states have (on average 6.125) internal successors, (98), 16 states have internal predecessors, (98), 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 07:49:47,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:49:47,872 INFO L93 Difference]: Finished difference Result 2871 states and 4397 transitions. [2023-12-16 07:49:47,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-16 07:49:47,873 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.125) internal successors, (98), 16 states have internal predecessors, (98), 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 53 [2023-12-16 07:49:47,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:49:47,879 INFO L225 Difference]: With dead ends: 2871 [2023-12-16 07:49:47,879 INFO L226 Difference]: Without dead ends: 2317 [2023-12-16 07:49:47,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=183, Invalid=573, Unknown=0, NotChecked=0, Total=756 [2023-12-16 07:49:47,880 INFO L413 NwaCegarLoop]: 1527 mSDtfsCounter, 4732 mSDsluCounter, 12045 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4732 SdHoareTripleChecker+Valid, 13572 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 07:49:47,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4732 Valid, 13572 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 07:49:47,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2317 states. [2023-12-16 07:49:47,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2317 to 1963. [2023-12-16 07:49:47,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1963 states, 1961 states have (on average 1.5823559408465069) internal successors, (3103), 1962 states have internal predecessors, (3103), 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 07:49:47,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1963 states and 3103 transitions. [2023-12-16 07:49:47,962 INFO L78 Accepts]: Start accepts. Automaton has 1963 states and 3103 transitions. Word has length 53 [2023-12-16 07:49:47,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:49:47,962 INFO L495 AbstractCegarLoop]: Abstraction has 1963 states and 3103 transitions. [2023-12-16 07:49:47,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.125) internal successors, (98), 16 states have internal predecessors, (98), 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 07:49:47,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 3103 transitions. [2023-12-16 07:49:47,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-16 07:49:47,963 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:49:47,963 INFO L195 NwaCegarLoop]: trace histogram [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 07:49:47,968 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 (13)] Forceful destruction successful, exit code 0 [2023-12-16 07:49:48,168 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 07:49:48,168 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:49:48,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:49:48,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1136546311, now seen corresponding path program 1 times [2023-12-16 07:49:48,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:49:48,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1351262956] [2023-12-16 07:49:48,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:49:48,169 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 07:49:48,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:49:48,170 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 07:49:48,173 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 07:49:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:49:48,220 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 07:49:48,222 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:49:48,253 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 07:49:48,254 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:49:48,254 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:49:48,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1351262956] [2023-12-16 07:49:48,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1351262956] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:49:48,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:49:48,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 07:49:48,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320539976] [2023-12-16 07:49:48,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:49:48,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 07:49:48,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:49:48,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 07:49:48,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:49:48,255 INFO L87 Difference]: Start difference. First operand 1963 states and 3103 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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 07:49:48,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:49:48,292 INFO L93 Difference]: Finished difference Result 2503 states and 3844 transitions. [2023-12-16 07:49:48,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 07:49:48,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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 55 [2023-12-16 07:49:48,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:49:48,296 INFO L225 Difference]: With dead ends: 2503 [2023-12-16 07:49:48,296 INFO L226 Difference]: Without dead ends: 1325 [2023-12-16 07:49:48,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 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 07:49:48,297 INFO L413 NwaCegarLoop]: 1512 mSDtfsCounter, 23 mSDsluCounter, 1475 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2987 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 07:49:48,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2987 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:49:48,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2023-12-16 07:49:48,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 1323. [2023-12-16 07:49:48,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1323 states, 1321 states have (on average 1.6646479939439818) internal successors, (2199), 1322 states have internal predecessors, (2199), 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 07:49:48,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1323 states and 2199 transitions. [2023-12-16 07:49:48,326 INFO L78 Accepts]: Start accepts. Automaton has 1323 states and 2199 transitions. Word has length 55 [2023-12-16 07:49:48,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:49:48,326 INFO L495 AbstractCegarLoop]: Abstraction has 1323 states and 2199 transitions. [2023-12-16 07:49:48,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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 07:49:48,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 2199 transitions. [2023-12-16 07:49:48,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-16 07:49:48,326 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:49:48,327 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] [2023-12-16 07:49:48,332 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 07:49:48,529 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 07:49:48,530 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:49:48,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:49:48,530 INFO L85 PathProgramCache]: Analyzing trace with hash -314781477, now seen corresponding path program 1 times [2023-12-16 07:49:48,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:49:48,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1715483462] [2023-12-16 07:49:48,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:49:48,530 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 07:49:48,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:49:48,531 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 07:49:48,532 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 07:49:48,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:49:48,585 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 07:49:48,586 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:49:49,097 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 07:49:49,097 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:49:49,337 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 07:49:49,337 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:49:49,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1715483462] [2023-12-16 07:49:49,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1715483462] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:49:49,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:49:49,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2023-12-16 07:49:49,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995501857] [2023-12-16 07:49:49,338 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:49:49,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-16 07:49:49,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:49:49,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-16 07:49:49,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-12-16 07:49:49,338 INFO L87 Difference]: Start difference. First operand 1323 states and 2199 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 07:49:50,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:49:50,225 INFO L93 Difference]: Finished difference Result 2361 states and 3578 transitions. [2023-12-16 07:49:50,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-16 07:49:50,225 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 56 [2023-12-16 07:49:50,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:49:50,230 INFO L225 Difference]: With dead ends: 2361 [2023-12-16 07:49:50,230 INFO L226 Difference]: Without dead ends: 1823 [2023-12-16 07:49:50,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2023-12-16 07:49:50,231 INFO L413 NwaCegarLoop]: 1509 mSDtfsCounter, 3206 mSDsluCounter, 11940 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3206 SdHoareTripleChecker+Valid, 13449 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 07:49:50,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3206 Valid, 13449 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 07:49:50,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1823 states. [2023-12-16 07:49:50,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1823 to 1705. [2023-12-16 07:49:50,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1705 states, 1703 states have (on average 1.5783910745742806) internal successors, (2688), 1704 states have internal predecessors, (2688), 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 07:49:50,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 2688 transitions. [2023-12-16 07:49:50,270 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 2688 transitions. Word has length 56 [2023-12-16 07:49:50,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:49:50,270 INFO L495 AbstractCegarLoop]: Abstraction has 1705 states and 2688 transitions. [2023-12-16 07:49:50,270 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 07:49:50,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 2688 transitions. [2023-12-16 07:49:50,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-16 07:49:50,271 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:49:50,271 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 07:49:50,276 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 07:49:50,485 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 07:49:50,485 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:49:50,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:49:50,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1527728915, now seen corresponding path program 1 times [2023-12-16 07:49:50,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:49:50,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [666520387] [2023-12-16 07:49:50,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:49:50,486 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 07:49:50,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:49:50,487 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 07:49:50,488 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 07:49:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:49:50,535 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 07:49:50,536 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:49:50,626 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-16 07:49:50,627 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:49:50,704 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-16 07:49:50,704 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:49:50,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [666520387] [2023-12-16 07:49:50,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [666520387] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:49:50,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:49:50,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-16 07:49:50,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071476239] [2023-12-16 07:49:50,705 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:49:50,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 07:49:50,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:49:50,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 07:49:50,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 07:49:50,706 INFO L87 Difference]: Start difference. First operand 1705 states and 2688 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 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 07:49:50,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:49:50,820 INFO L93 Difference]: Finished difference Result 3525 states and 5026 transitions. [2023-12-16 07:49:50,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 07:49:50,821 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 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 07:49:50,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:49:50,827 INFO L225 Difference]: With dead ends: 3525 [2023-12-16 07:49:50,827 INFO L226 Difference]: Without dead ends: 2605 [2023-12-16 07:49:50,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 110 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 07:49:50,830 INFO L413 NwaCegarLoop]: 1510 mSDtfsCounter, 1480 mSDsluCounter, 1613 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 3123 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 07:49:50,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1480 Valid, 3123 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 07:49:50,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2605 states. [2023-12-16 07:49:50,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2605 to 2509. [2023-12-16 07:49:50,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2509 states, 2507 states have (on average 1.4387714399680893) internal successors, (3607), 2508 states have internal predecessors, (3607), 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 07:49:50,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2509 states to 2509 states and 3607 transitions. [2023-12-16 07:49:50,899 INFO L78 Accepts]: Start accepts. Automaton has 2509 states and 3607 transitions. Word has length 58 [2023-12-16 07:49:50,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:49:50,899 INFO L495 AbstractCegarLoop]: Abstraction has 2509 states and 3607 transitions. [2023-12-16 07:49:50,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 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 07:49:50,900 INFO L276 IsEmpty]: Start isEmpty. Operand 2509 states and 3607 transitions. [2023-12-16 07:49:50,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-16 07:49:50,900 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:49:50,901 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:49:50,918 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 07:49:51,119 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 07:49:51,119 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:49:51,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:49:51,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1248748378, now seen corresponding path program 1 times [2023-12-16 07:49:51,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:49:51,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1494262988] [2023-12-16 07:49:51,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:49:51,120 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 07:49:51,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:49:51,121 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 07:49:51,123 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 07:49:51,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:49:51,159 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 07:49:51,160 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:49:51,272 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 07:49:51,272 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:49:51,272 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:49:51,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1494262988] [2023-12-16 07:49:51,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1494262988] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:49:51,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:49:51,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 07:49:51,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551898901] [2023-12-16 07:49:51,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:49:51,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 07:49:51,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:49:51,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 07:49:51,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:49:51,273 INFO L87 Difference]: Start difference. First operand 2509 states and 3607 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 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 07:50:23,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:50:23,500 INFO L93 Difference]: Finished difference Result 4013 states and 6480 transitions. [2023-12-16 07:50:23,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 07:50:23,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 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 07:50:23,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:50:23,508 INFO L225 Difference]: With dead ends: 4013 [2023-12-16 07:50:23,508 INFO L226 Difference]: Without dead ends: 3260 [2023-12-16 07:50:23,510 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 07:50:23,510 INFO L413 NwaCegarLoop]: 531 mSDtfsCounter, 807 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2406 mSolverCounterSat, 456 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 2862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 456 IncrementalHoareTripleChecker+Valid, 2406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.1s IncrementalHoareTripleChecker+Time [2023-12-16 07:50:23,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 538 Invalid, 2862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [456 Valid, 2406 Invalid, 0 Unknown, 0 Unchecked, 32.1s Time] [2023-12-16 07:50:23,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3260 states. [2023-12-16 07:50:23,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3260 to 3260. [2023-12-16 07:50:23,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3260 states, 3258 states have (on average 1.4076120319214243) internal successors, (4586), 3259 states have internal predecessors, (4586), 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 07:50:23,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3260 states to 3260 states and 4586 transitions. [2023-12-16 07:50:23,611 INFO L78 Accepts]: Start accepts. Automaton has 3260 states and 4586 transitions. Word has length 60 [2023-12-16 07:50:23,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:50:23,611 INFO L495 AbstractCegarLoop]: Abstraction has 3260 states and 4586 transitions. [2023-12-16 07:50:23,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 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 07:50:23,611 INFO L276 IsEmpty]: Start isEmpty. Operand 3260 states and 4586 transitions. [2023-12-16 07:50:23,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-16 07:50:23,615 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:50:23,615 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2023-12-16 07:50:23,618 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 07:50:23,815 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 07:50:23,816 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:50:23,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:50:23,816 INFO L85 PathProgramCache]: Analyzing trace with hash -622593213, now seen corresponding path program 1 times [2023-12-16 07:50:23,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:50:23,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [860710007] [2023-12-16 07:50:23,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:50:23,816 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 07:50:23,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:50:23,817 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 07:50:23,821 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 07:50:23,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:50:23,889 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-16 07:50:23,891 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:50:24,768 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 30 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:50:24,769 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:50:25,203 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 30 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:50:25,203 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:50:25,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [860710007] [2023-12-16 07:50:25,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [860710007] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:50:25,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:50:25,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2023-12-16 07:50:25,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483118686] [2023-12-16 07:50:25,203 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:50:25,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-16 07:50:25,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:50:25,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-16 07:50:25,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2023-12-16 07:50:25,204 INFO L87 Difference]: Start difference. First operand 3260 states and 4586 transitions. Second operand has 26 states, 26 states have (on average 6.384615384615385) internal successors, (166), 25 states have internal predecessors, (166), 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) Received shutdown request... [2023-12-16 07:50:26,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-16 07:50:26,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=383, Invalid=1423, Unknown=0, NotChecked=0, Total=1806 [2023-12-16 07:50:26,374 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 1457 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1457 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 07:50:26,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1457 Valid, 729 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 07:50:26,375 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-16 07:50:26,378 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 07:50:26,383 WARN L340 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)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 07:50:26,383 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 07:50:26,575 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 07:50:26,576 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (3260states) and FLOYD_HOARE automaton (currently 19 states, 26 states before enhancement),while ReachableStatesComputation was computing reachable states (596 states constructed, input type IntersectNwa). [2023-12-16 07:50:26,578 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-16 07:50:26,580 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:50:26,581 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 07:50:26,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 07:50:26 BoogieIcfgContainer [2023-12-16 07:50:26,582 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 07:50:26,583 INFO L158 Benchmark]: Toolchain (without parser) took 71892.55ms. Allocated memory was 208.7MB in the beginning and 596.6MB in the end (delta: 388.0MB). Free memory was 142.3MB in the beginning and 183.6MB in the end (delta: -41.3MB). Peak memory consumption was 347.2MB. Max. memory is 8.0GB. [2023-12-16 07:50:26,583 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 208.7MB. Free memory was 161.3MB in the beginning and 161.2MB in the end (delta: 153.8kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 07:50:26,583 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1313.11ms. Allocated memory was 208.7MB in the beginning and 305.1MB in the end (delta: 96.5MB). Free memory was 142.0MB in the beginning and 242.0MB in the end (delta: -100.1MB). Peak memory consumption was 115.5MB. Max. memory is 8.0GB. [2023-12-16 07:50:26,583 INFO L158 Benchmark]: Boogie Procedure Inliner took 119.78ms. Allocated memory is still 305.1MB. Free memory was 242.0MB in the beginning and 206.4MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2023-12-16 07:50:26,583 INFO L158 Benchmark]: Boogie Preprocessor took 238.74ms. Allocated memory is still 305.1MB. Free memory was 206.4MB in the beginning and 168.1MB in the end (delta: 38.3MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. [2023-12-16 07:50:26,584 INFO L158 Benchmark]: RCFGBuilder took 23245.28ms. Allocated memory was 305.1MB in the beginning and 497.0MB in the end (delta: 191.9MB). Free memory was 168.1MB in the beginning and 245.7MB in the end (delta: -77.6MB). Peak memory consumption was 172.9MB. Max. memory is 8.0GB. [2023-12-16 07:50:26,584 INFO L158 Benchmark]: TraceAbstraction took 46970.64ms. Allocated memory was 497.0MB in the beginning and 596.6MB in the end (delta: 99.6MB). Free memory was 244.6MB in the beginning and 183.6MB in the end (delta: 61.1MB). Peak memory consumption was 160.9MB. Max. memory is 8.0GB. [2023-12-16 07:50:26,585 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.42ms. Allocated memory is still 208.7MB. Free memory was 161.3MB in the beginning and 161.2MB in the end (delta: 153.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 1313.11ms. Allocated memory was 208.7MB in the beginning and 305.1MB in the end (delta: 96.5MB). Free memory was 142.0MB in the beginning and 242.0MB in the end (delta: -100.1MB). Peak memory consumption was 115.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 119.78ms. Allocated memory is still 305.1MB. Free memory was 242.0MB in the beginning and 206.4MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 238.74ms. Allocated memory is still 305.1MB. Free memory was 206.4MB in the beginning and 168.1MB in the end (delta: 38.3MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. * RCFGBuilder took 23245.28ms. Allocated memory was 305.1MB in the beginning and 497.0MB in the end (delta: 191.9MB). Free memory was 168.1MB in the beginning and 245.7MB in the end (delta: -77.6MB). Peak memory consumption was 172.9MB. Max. memory is 8.0GB. * TraceAbstraction took 46970.64ms. Allocated memory was 497.0MB in the beginning and 596.6MB in the end (delta: 99.6MB). Free memory was 244.6MB in the beginning and 183.6MB in the end (delta: 61.1MB). Peak memory consumption was 160.9MB. 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 - TimeoutResultAtElement [Line: 290]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 290). Cancelled while NwaCegarLoop was constructing difference of abstraction (3260states) and FLOYD_HOARE automaton (currently 19 states, 26 states before enhancement),while ReachableStatesComputation was computing reachable states (596 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 488]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 488). Cancelled while NwaCegarLoop was constructing difference of abstraction (3260states) and FLOYD_HOARE automaton (currently 19 states, 26 states before enhancement),while ReachableStatesComputation was computing reachable states (596 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 807 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 46.9s, OverallIterations: 17, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 37.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 24047 SdHoareTripleChecker+Valid, 34.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 24047 mSDsluCounter, 73932 SdHoareTripleChecker+Invalid, 28.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50531 mSDsCounter, 546 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4733 IncrementalHoareTripleChecker+Invalid, 5279 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 546 mSolverCounterUnsat, 23401 mSDtfsCounter, 4733 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1110 GetRequests, 969 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3260occurred in iteration=16, InterpolantAutomatonStates: 98, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 1045 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 768 NumberOfCodeBlocks, 768 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1054 ConstructedInterpolants, 179 QuantifiedInterpolants, 7702 SizeOfPredicates, 38 NumberOfNonLiveVariables, 2147 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 22 InterpolantComputations, 12 PerfectInterpolantSequences, 140/276 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 could not prove your program: Timeout Completed graceful shutdown