/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/reducercommutativity/sep40-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 17:25:44,879 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 17:25:44,946 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-21 17:25:44,950 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 17:25:44,950 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 17:25:44,971 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 17:25:44,971 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 17:25:44,971 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 17:25:44,972 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 17:25:44,975 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 17:25:44,975 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 17:25:44,975 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 17:25:44,976 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 17:25:44,977 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 17:25:44,977 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 17:25:44,977 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 17:25:44,977 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 17:25:44,978 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 17:25:44,978 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 17:25:44,978 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 17:25:44,978 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 17:25:44,978 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 17:25:44,978 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 17:25:44,979 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-21 17:25:44,979 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-21 17:25:44,979 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 17:25:44,979 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-21 17:25:44,979 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 17:25:44,979 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 17:25:44,979 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 17:25:44,980 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 17:25:44,980 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 17:25:44,980 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 17:25:44,980 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 17:25:44,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 17:25:44,981 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 17:25:44,981 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 17:25:44,981 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 17:25:44,981 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-21 17:25:44,981 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-21 17:25:44,981 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 17:25:44,981 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 17:25:44,981 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 17:25:44,982 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 17:25:44,982 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 17:25:44,982 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-21 17:25:44,982 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-21 17:25:45,146 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 17:25:45,164 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 17:25:45,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 17:25:45,167 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 17:25:45,167 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 17:25:45,168 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/sep40-1.i [2023-12-21 17:25:46,321 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 17:25:46,506 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 17:25:46,507 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/sep40-1.i [2023-12-21 17:25:46,511 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5577ee1f9/8019db072cb24818b4bf6866db9064f8/FLAGc76a69fde [2023-12-21 17:25:46,520 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5577ee1f9/8019db072cb24818b4bf6866db9064f8 [2023-12-21 17:25:46,522 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 17:25:46,523 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 17:25:46,524 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 17:25:46,524 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 17:25:46,527 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 17:25:46,528 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 05:25:46" (1/1) ... [2023-12-21 17:25:46,528 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@663965ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:25:46, skipping insertion in model container [2023-12-21 17:25:46,528 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 05:25:46" (1/1) ... [2023-12-21 17:25:46,542 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 17:25:46,639 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/sep40-1.i[1293,1306] [2023-12-21 17:25:46,642 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 17:25:46,651 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 17:25:46,666 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/sep40-1.i[1293,1306] [2023-12-21 17:25:46,667 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 17:25:46,676 INFO L206 MainTranslator]: Completed translation [2023-12-21 17:25:46,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:25:46 WrapperNode [2023-12-21 17:25:46,677 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 17:25:46,677 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 17:25:46,678 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 17:25:46,678 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 17:25:46,682 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:25:46" (1/1) ... [2023-12-21 17:25:46,688 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:25:46" (1/1) ... [2023-12-21 17:25:46,699 INFO L138 Inliner]: procedures = 18, calls = 22, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 65 [2023-12-21 17:25:46,700 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 17:25:46,700 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 17:25:46,700 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 17:25:46,700 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 17:25:46,707 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:25:46" (1/1) ... [2023-12-21 17:25:46,707 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:25:46" (1/1) ... [2023-12-21 17:25:46,710 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:25:46" (1/1) ... [2023-12-21 17:25:46,719 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2023-12-21 17:25:46,720 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:25:46" (1/1) ... [2023-12-21 17:25:46,720 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:25:46" (1/1) ... [2023-12-21 17:25:46,725 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:25:46" (1/1) ... [2023-12-21 17:25:46,727 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:25:46" (1/1) ... [2023-12-21 17:25:46,728 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:25:46" (1/1) ... [2023-12-21 17:25:46,728 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:25:46" (1/1) ... [2023-12-21 17:25:46,730 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 17:25:46,730 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 17:25:46,731 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 17:25:46,731 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 17:25:46,731 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:25:46" (1/1) ... [2023-12-21 17:25:46,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 17:25:46,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 17:25:46,758 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-21 17:25:46,779 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-21 17:25:46,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 17:25:46,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-21 17:25:46,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-21 17:25:46,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-21 17:25:46,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-21 17:25:46,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-21 17:25:46,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 17:25:46,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 17:25:46,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-21 17:25:46,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-21 17:25:46,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-21 17:25:46,798 INFO L130 BoogieDeclarations]: Found specification of procedure sep [2023-12-21 17:25:46,798 INFO L138 BoogieDeclarations]: Found implementation of procedure sep [2023-12-21 17:25:46,848 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 17:25:46,850 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 17:25:47,053 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 17:25:47,089 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 17:25:47,089 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-21 17:25:47,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 05:25:47 BoogieIcfgContainer [2023-12-21 17:25:47,090 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 17:25:47,091 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 17:25:47,091 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 17:25:47,093 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 17:25:47,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 05:25:46" (1/3) ... [2023-12-21 17:25:47,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c6edf47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 05:25:47, skipping insertion in model container [2023-12-21 17:25:47,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:25:46" (2/3) ... [2023-12-21 17:25:47,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c6edf47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 05:25:47, skipping insertion in model container [2023-12-21 17:25:47,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 05:25:47" (3/3) ... [2023-12-21 17:25:47,095 INFO L112 eAbstractionObserver]: Analyzing ICFG sep40-1.i [2023-12-21 17:25:47,109 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 17:25:47,109 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 17:25:47,173 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 17:25:47,181 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;@437313aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 17:25:47,181 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 17:25:47,184 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 17:25:47,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-21 17:25:47,191 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:25:47,191 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:25:47,191 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:25:47,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:25:47,198 INFO L85 PathProgramCache]: Analyzing trace with hash -110337137, now seen corresponding path program 1 times [2023-12-21 17:25:47,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:25:47,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [334384474] [2023-12-21 17:25:47,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 17:25:47,208 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-21 17:25:47,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:25:47,209 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-21 17:25:47,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-21 17:25:47,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 17:25:47,352 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-21 17:25:47,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:25:47,373 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-21 17:25:47,373 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 17:25:47,374 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:25:47,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [334384474] [2023-12-21 17:25:47,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [334384474] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 17:25:47,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 17:25:47,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 17:25:47,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125229320] [2023-12-21 17:25:47,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 17:25:47,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 17:25:47,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:25:47,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 17:25:47,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 17:25:47,397 INFO L87 Difference]: Start difference. First operand has 22 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-21 17:25:47,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:25:47,418 INFO L93 Difference]: Finished difference Result 42 states and 61 transitions. [2023-12-21 17:25:47,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 17:25:47,419 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2023-12-21 17:25:47,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:25:47,423 INFO L225 Difference]: With dead ends: 42 [2023-12-21 17:25:47,424 INFO L226 Difference]: Without dead ends: 20 [2023-12-21 17:25:47,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 24 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-21 17:25:47,428 INFO L413 NwaCegarLoop]: 22 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, 22 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-21 17:25:47,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 17:25:47,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-12-21 17:25:47,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-12-21 17:25:47,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 17:25:47,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2023-12-21 17:25:47,449 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 25 [2023-12-21 17:25:47,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:25:47,450 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2023-12-21 17:25:47,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-21 17:25:47,450 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2023-12-21 17:25:47,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-21 17:25:47,451 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:25:47,451 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:25:47,453 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-21 17:25:47,653 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-21 17:25:47,654 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:25:47,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:25:47,654 INFO L85 PathProgramCache]: Analyzing trace with hash -2072867306, now seen corresponding path program 1 times [2023-12-21 17:25:47,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:25:47,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [791030907] [2023-12-21 17:25:47,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 17:25:47,655 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-21 17:25:47,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:25:47,659 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-21 17:25:47,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-21 17:25:47,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 17:25:47,723 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 17:25:47,725 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:25:47,739 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-21 17:25:47,740 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 17:25:47,740 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:25:47,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [791030907] [2023-12-21 17:25:47,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [791030907] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 17:25:47,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 17:25:47,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 17:25:47,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782038555] [2023-12-21 17:25:47,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 17:25:47,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 17:25:47,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:25:47,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 17:25:47,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 17:25:47,743 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-21 17:25:47,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:25:47,760 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2023-12-21 17:25:47,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 17:25:47,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2023-12-21 17:25:47,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:25:47,762 INFO L225 Difference]: With dead ends: 39 [2023-12-21 17:25:47,762 INFO L226 Difference]: Without dead ends: 21 [2023-12-21 17:25:47,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 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-21 17:25:47,764 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 17:25:47,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 17:25:47,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-21 17:25:47,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-12-21 17:25:47,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 17:25:47,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2023-12-21 17:25:47,773 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 25 [2023-12-21 17:25:47,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:25:47,773 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2023-12-21 17:25:47,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-21 17:25:47,773 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2023-12-21 17:25:47,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-21 17:25:47,774 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:25:47,774 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:25:47,779 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-21 17:25:47,976 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-21 17:25:47,978 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:25:47,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:25:47,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1417820460, now seen corresponding path program 1 times [2023-12-21 17:25:47,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:25:47,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1257940256] [2023-12-21 17:25:47,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 17:25:47,979 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-21 17:25:47,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:25:47,981 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-21 17:25:47,996 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-21 17:25:48,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 17:25:48,065 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 17:25:48,067 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:25:48,098 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-21 17:25:48,099 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:25:48,138 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-21 17:25:48,139 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:25:48,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1257940256] [2023-12-21 17:25:48,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1257940256] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:25:48,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:25:48,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 6 [2023-12-21 17:25:48,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728100164] [2023-12-21 17:25:48,143 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:25:48,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 17:25:48,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:25:48,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 17:25:48,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-21 17:25:48,146 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-21 17:25:48,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:25:48,189 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2023-12-21 17:25:48,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 17:25:48,189 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 26 [2023-12-21 17:25:48,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:25:48,190 INFO L225 Difference]: With dead ends: 42 [2023-12-21 17:25:48,190 INFO L226 Difference]: Without dead ends: 24 [2023-12-21 17:25:48,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-21 17:25:48,191 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 17:25:48,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 17:25:48,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-21 17:25:48,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-12-21 17:25:48,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 17:25:48,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2023-12-21 17:25:48,195 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 26 [2023-12-21 17:25:48,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:25:48,195 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2023-12-21 17:25:48,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-21 17:25:48,195 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2023-12-21 17:25:48,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-21 17:25:48,196 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:25:48,196 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:25:48,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-21 17:25:48,398 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-21 17:25:48,399 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:25:48,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:25:48,399 INFO L85 PathProgramCache]: Analyzing trace with hash -527457386, now seen corresponding path program 2 times [2023-12-21 17:25:48,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:25:48,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1949873647] [2023-12-21 17:25:48,400 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 17:25:48,400 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-21 17:25:48,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:25:48,403 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-21 17:25:48,404 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-21 17:25:48,460 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-21 17:25:48,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 17:25:48,461 INFO L262 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 17:25:48,463 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:25:48,487 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-21 17:25:48,488 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 17:25:48,488 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:25:48,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1949873647] [2023-12-21 17:25:48,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1949873647] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 17:25:48,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 17:25:48,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 17:25:48,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983075838] [2023-12-21 17:25:48,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 17:25:48,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 17:25:48,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:25:48,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 17:25:48,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 17:25:48,489 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-21 17:25:48,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:25:48,512 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2023-12-21 17:25:48,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 17:25:48,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2023-12-21 17:25:48,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:25:48,513 INFO L225 Difference]: With dead ends: 43 [2023-12-21 17:25:48,513 INFO L226 Difference]: Without dead ends: 27 [2023-12-21 17:25:48,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 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-21 17:25:48,514 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 3 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 17:25:48,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 36 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 17:25:48,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-21 17:25:48,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2023-12-21 17:25:48,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 17:25:48,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2023-12-21 17:25:48,517 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 29 [2023-12-21 17:25:48,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:25:48,518 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2023-12-21 17:25:48,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-21 17:25:48,518 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2023-12-21 17:25:48,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-21 17:25:48,518 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:25:48,518 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:25:48,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-21 17:25:48,738 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-21 17:25:48,739 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:25:48,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:25:48,740 INFO L85 PathProgramCache]: Analyzing trace with hash -480004917, now seen corresponding path program 1 times [2023-12-21 17:25:48,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:25:48,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1632302562] [2023-12-21 17:25:48,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 17:25:48,741 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-21 17:25:48,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:25:48,743 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-21 17:25:48,744 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-21 17:25:48,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 17:25:48,827 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 17:25:48,829 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:25:48,875 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-21 17:25:48,875 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:25:48,970 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-21 17:25:48,970 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:25:48,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1632302562] [2023-12-21 17:25:48,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1632302562] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:25:48,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:25:48,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2023-12-21 17:25:48,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909139767] [2023-12-21 17:25:48,971 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:25:48,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-21 17:25:48,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:25:48,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-21 17:25:48,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-12-21 17:25:48,972 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-21 17:25:49,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:25:49,119 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2023-12-21 17:25:49,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-21 17:25:49,120 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 38 [2023-12-21 17:25:49,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:25:49,120 INFO L225 Difference]: With dead ends: 50 [2023-12-21 17:25:49,120 INFO L226 Difference]: Without dead ends: 31 [2023-12-21 17:25:49,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2023-12-21 17:25:49,121 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 17:25:49,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 17:25:49,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-21 17:25:49,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-12-21 17:25:49,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 17:25:49,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2023-12-21 17:25:49,125 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 38 [2023-12-21 17:25:49,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:25:49,125 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2023-12-21 17:25:49,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-21 17:25:49,126 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2023-12-21 17:25:49,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-21 17:25:49,126 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:25:49,126 INFO L195 NwaCegarLoop]: trace histogram [10, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:25:49,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-21 17:25:49,329 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-21 17:25:49,329 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:25:49,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:25:49,329 INFO L85 PathProgramCache]: Analyzing trace with hash -881195893, now seen corresponding path program 2 times [2023-12-21 17:25:49,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:25:49,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2057142061] [2023-12-21 17:25:49,330 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 17:25:49,330 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-21 17:25:49,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:25:49,331 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-21 17:25:49,332 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-21 17:25:49,394 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 17:25:49,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 17:25:49,397 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-21 17:25:49,399 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:25:49,489 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-21 17:25:49,489 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:25:49,818 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-21 17:25:49,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:25:49,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2057142061] [2023-12-21 17:25:49,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2057142061] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:25:49,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:25:49,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 24 [2023-12-21 17:25:49,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496307812] [2023-12-21 17:25:49,819 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:25:49,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-21 17:25:49,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:25:49,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-21 17:25:49,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2023-12-21 17:25:49,820 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 24 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 24 states have internal predecessors, (44), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-21 17:25:50,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:25:50,530 INFO L93 Difference]: Finished difference Result 62 states and 83 transitions. [2023-12-21 17:25:50,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-21 17:25:50,531 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 24 states have internal predecessors, (44), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 44 [2023-12-21 17:25:50,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:25:50,532 INFO L225 Difference]: With dead ends: 62 [2023-12-21 17:25:50,532 INFO L226 Difference]: Without dead ends: 43 [2023-12-21 17:25:50,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2023-12-21 17:25:50,533 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 17:25:50,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 306 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 17:25:50,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-21 17:25:50,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-12-21 17:25:50,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 17:25:50,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2023-12-21 17:25:50,543 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 44 [2023-12-21 17:25:50,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:25:50,543 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2023-12-21 17:25:50,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 24 states have internal predecessors, (44), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-21 17:25:50,543 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2023-12-21 17:25:50,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-21 17:25:50,545 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:25:50,545 INFO L195 NwaCegarLoop]: trace histogram [22, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:25:50,548 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-21 17:25:50,748 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-21 17:25:50,748 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:25:50,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:25:50,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1281504267, now seen corresponding path program 3 times [2023-12-21 17:25:50,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:25:50,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [846103584] [2023-12-21 17:25:50,749 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 17:25:50,749 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-21 17:25:50,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:25:50,750 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-21 17:25:50,751 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-21 17:25:50,810 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-21 17:25:50,810 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 17:25:50,812 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 17:25:50,813 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:25:50,818 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2023-12-21 17:25:50,818 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 17:25:50,819 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:25:50,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [846103584] [2023-12-21 17:25:50,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [846103584] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 17:25:50,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 17:25:50,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 17:25:50,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738039869] [2023-12-21 17:25:50,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 17:25:50,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 17:25:50,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:25:50,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 17:25:50,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 17:25:50,820 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-21 17:25:50,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:25:50,835 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2023-12-21 17:25:50,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 17:25:50,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 56 [2023-12-21 17:25:50,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:25:50,836 INFO L225 Difference]: With dead ends: 57 [2023-12-21 17:25:50,836 INFO L226 Difference]: Without dead ends: 44 [2023-12-21 17:25:50,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 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-21 17:25:50,837 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 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-21 17:25:50,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 17:25:50,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-21 17:25:50,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-12-21 17:25:50,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 17:25:50,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2023-12-21 17:25:50,842 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 56 [2023-12-21 17:25:50,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:25:50,843 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2023-12-21 17:25:50,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-21 17:25:50,843 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2023-12-21 17:25:50,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-21 17:25:50,844 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:25:50,844 INFO L195 NwaCegarLoop]: trace histogram [22, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:25:50,865 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-21 17:25:51,046 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-21 17:25:51,047 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:25:51,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:25:51,047 INFO L85 PathProgramCache]: Analyzing trace with hash -248258483, now seen corresponding path program 1 times [2023-12-21 17:25:51,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:25:51,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [62129686] [2023-12-21 17:25:51,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 17:25:51,048 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-21 17:25:51,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:25:51,056 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-21 17:25:51,057 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-21 17:25:51,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 17:25:51,155 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-21 17:25:51,158 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:25:51,438 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-12-21 17:25:51,438 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:25:52,461 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-12-21 17:25:52,461 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:25:52,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [62129686] [2023-12-21 17:25:52,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [62129686] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:25:52,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:25:52,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 48 [2023-12-21 17:25:52,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201616734] [2023-12-21 17:25:52,462 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:25:52,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-12-21 17:25:52,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:25:52,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-12-21 17:25:52,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=607, Invalid=1649, Unknown=0, NotChecked=0, Total=2256 [2023-12-21 17:25:52,464 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 48 states, 48 states have (on average 1.4375) internal successors, (69), 48 states have internal predecessors, (69), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-21 17:25:55,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:25:55,148 INFO L93 Difference]: Finished difference Result 82 states and 109 transitions. [2023-12-21 17:25:55,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-12-21 17:25:55,153 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.4375) internal successors, (69), 48 states have internal predecessors, (69), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 57 [2023-12-21 17:25:55,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:25:55,153 INFO L225 Difference]: With dead ends: 82 [2023-12-21 17:25:55,153 INFO L226 Difference]: Without dead ends: 62 [2023-12-21 17:25:55,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1279, Invalid=2753, Unknown=0, NotChecked=0, Total=4032 [2023-12-21 17:25:55,155 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 17:25:55,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 477 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 17:25:55,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-12-21 17:25:55,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-12-21 17:25:55,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 57 states have (on average 1.0701754385964912) internal successors, (61), 57 states have internal predecessors, (61), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 17:25:55,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2023-12-21 17:25:55,162 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 57 [2023-12-21 17:25:55,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:25:55,162 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2023-12-21 17:25:55,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.4375) internal successors, (69), 48 states have internal predecessors, (69), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-21 17:25:55,163 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2023-12-21 17:25:55,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-21 17:25:55,163 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:25:55,163 INFO L195 NwaCegarLoop]: trace histogram [40, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:25:55,170 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 (9)] Ended with exit code 0 [2023-12-21 17:25:55,367 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-21 17:25:55,367 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:25:55,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:25:55,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1833212173, now seen corresponding path program 2 times [2023-12-21 17:25:55,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:25:55,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1998702349] [2023-12-21 17:25:55,369 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 17:25:55,369 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-21 17:25:55,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:25:55,370 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-21 17:25:55,371 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-21 17:25:55,499 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 17:25:55,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 17:25:55,505 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 17:25:55,507 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:25:55,518 INFO L134 CoverageAnalysis]: Checked inductivity of 851 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 836 trivial. 0 not checked. [2023-12-21 17:25:55,518 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:25:55,541 INFO L134 CoverageAnalysis]: Checked inductivity of 851 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 834 trivial. 0 not checked. [2023-12-21 17:25:55,541 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:25:55,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1998702349] [2023-12-21 17:25:55,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1998702349] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:25:55,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:25:55,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-21 17:25:55,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455704459] [2023-12-21 17:25:55,542 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:25:55,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 17:25:55,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:25:55,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 17:25:55,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-21 17:25:55,543 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 17:25:55,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:25:55,587 INFO L93 Difference]: Finished difference Result 89 states and 106 transitions. [2023-12-21 17:25:55,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 17:25:55,588 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 75 [2023-12-21 17:25:55,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:25:55,588 INFO L225 Difference]: With dead ends: 89 [2023-12-21 17:25:55,588 INFO L226 Difference]: Without dead ends: 71 [2023-12-21 17:25:55,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-21 17:25:55,589 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 11 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 17:25:55,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 87 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 17:25:55,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-12-21 17:25:55,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2023-12-21 17:25:55,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.106060606060606) internal successors, (73), 66 states have internal predecessors, (73), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 17:25:55,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2023-12-21 17:25:55,595 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 75 [2023-12-21 17:25:55,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:25:55,595 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2023-12-21 17:25:55,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 17:25:55,596 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2023-12-21 17:25:55,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-21 17:25:55,598 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:25:55,598 INFO L195 NwaCegarLoop]: trace histogram [40, 12, 12, 12, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:25:55,609 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-21 17:25:55,804 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-21 17:25:55,804 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:25:55,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:25:55,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1202271268, now seen corresponding path program 3 times [2023-12-21 17:25:55,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:25:55,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1005314872] [2023-12-21 17:25:55,805 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 17:25:55,805 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-21 17:25:55,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:25:55,807 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-21 17:25:55,808 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-21 17:25:55,913 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-21 17:25:55,913 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 17:25:55,916 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 17:25:55,917 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:25:55,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1067 backedges. 120 proven. 1 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-21 17:25:55,932 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:25:55,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1067 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1066 trivial. 0 not checked. [2023-12-21 17:25:55,954 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:25:55,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1005314872] [2023-12-21 17:25:55,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1005314872] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:25:55,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:25:55,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-21 17:25:55,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343663615] [2023-12-21 17:25:55,955 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:25:55,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 17:25:55,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:25:55,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 17:25:55,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-21 17:25:55,956 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-21 17:25:55,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:25:55,995 INFO L93 Difference]: Finished difference Result 96 states and 111 transitions. [2023-12-21 17:25:55,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 17:25:55,995 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 102 [2023-12-21 17:25:55,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:25:55,996 INFO L225 Difference]: With dead ends: 96 [2023-12-21 17:25:55,996 INFO L226 Difference]: Without dead ends: 74 [2023-12-21 17:25:55,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-21 17:25:55,997 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 17:25:55,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 17:25:55,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-12-21 17:25:56,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2023-12-21 17:25:56,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.1014492753623188) internal successors, (76), 69 states have internal predecessors, (76), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 17:25:56,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2023-12-21 17:25:56,003 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 102 [2023-12-21 17:25:56,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:25:56,003 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2023-12-21 17:25:56,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-21 17:25:56,003 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2023-12-21 17:25:56,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-21 17:25:56,004 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:25:56,004 INFO L195 NwaCegarLoop]: trace histogram [40, 12, 12, 12, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:25:56,009 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-21 17:25:56,207 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-21 17:25:56,208 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:25:56,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:25:56,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1623013334, now seen corresponding path program 4 times [2023-12-21 17:25:56,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:25:56,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [878344709] [2023-12-21 17:25:56,209 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-21 17:25:56,209 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 17:25:56,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:25:56,210 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-21 17:25:56,210 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-21 17:25:56,379 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-21 17:25:56,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 17:25:56,388 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 17:25:56,390 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:25:56,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1076 backedges. 116 proven. 22 refuted. 0 times theorem prover too weak. 938 trivial. 0 not checked. [2023-12-21 17:25:56,423 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:25:56,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1076 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 936 trivial. 0 not checked. [2023-12-21 17:25:56,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:25:56,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [878344709] [2023-12-21 17:25:56,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [878344709] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:25:56,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:25:56,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-12-21 17:25:56,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685652897] [2023-12-21 17:25:56,504 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:25:56,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-21 17:25:56,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:25:56,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-21 17:25:56,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-12-21 17:25:56,505 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 17:25:56,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:25:56,648 INFO L93 Difference]: Finished difference Result 122 states and 151 transitions. [2023-12-21 17:25:56,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-21 17:25:56,649 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 105 [2023-12-21 17:25:56,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:25:56,649 INFO L225 Difference]: With dead ends: 122 [2023-12-21 17:25:56,649 INFO L226 Difference]: Without dead ends: 92 [2023-12-21 17:25:56,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2023-12-21 17:25:56,650 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 39 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 17:25:56,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 150 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 17:25:56,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-12-21 17:25:56,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2023-12-21 17:25:56,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 87 states have (on average 1.1494252873563218) internal successors, (100), 87 states have internal predecessors, (100), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 17:25:56,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 106 transitions. [2023-12-21 17:25:56,657 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 106 transitions. Word has length 105 [2023-12-21 17:25:56,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:25:56,657 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 106 transitions. [2023-12-21 17:25:56,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 17:25:56,657 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 106 transitions. [2023-12-21 17:25:56,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-12-21 17:25:56,658 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:25:56,658 INFO L195 NwaCegarLoop]: trace histogram [40, 30, 30, 30, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:25:56,664 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-21 17:25:56,864 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-21 17:25:56,864 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:25:56,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:25:56,864 INFO L85 PathProgramCache]: Analyzing trace with hash -497689162, now seen corresponding path program 5 times [2023-12-21 17:25:56,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:25:56,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [687813790] [2023-12-21 17:25:56,865 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-21 17:25:56,865 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-21 17:25:56,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:25:56,866 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-21 17:25:56,867 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-21 17:25:57,785 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2023-12-21 17:25:57,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 17:25:57,801 INFO L262 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-21 17:25:57,804 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:25:57,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2237 backedges. 644 proven. 145 refuted. 0 times theorem prover too weak. 1448 trivial. 0 not checked. [2023-12-21 17:25:57,936 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:25:58,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2237 backedges. 0 proven. 791 refuted. 0 times theorem prover too weak. 1446 trivial. 0 not checked. [2023-12-21 17:25:58,500 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:25:58,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [687813790] [2023-12-21 17:25:58,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [687813790] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:25:58,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:25:58,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2023-12-21 17:25:58,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010941180] [2023-12-21 17:25:58,500 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:25:58,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-21 17:25:58,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:25:58,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-21 17:25:58,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2023-12-21 17:25:58,502 INFO L87 Difference]: Start difference. First operand 92 states and 106 transitions. Second operand has 25 states, 25 states have (on average 3.52) internal successors, (88), 25 states have internal predecessors, (88), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 17:25:59,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:25:59,407 INFO L93 Difference]: Finished difference Result 176 states and 229 transitions. [2023-12-21 17:25:59,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-21 17:25:59,407 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.52) internal successors, (88), 25 states have internal predecessors, (88), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 159 [2023-12-21 17:25:59,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:25:59,408 INFO L225 Difference]: With dead ends: 176 [2023-12-21 17:25:59,408 INFO L226 Difference]: Without dead ends: 128 [2023-12-21 17:25:59,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=454, Invalid=806, Unknown=0, NotChecked=0, Total=1260 [2023-12-21 17:25:59,409 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 166 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 17:25:59,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 444 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 17:25:59,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-12-21 17:25:59,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2023-12-21 17:25:59,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 123 states have (on average 1.2032520325203253) internal successors, (148), 123 states have internal predecessors, (148), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 17:25:59,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 154 transitions. [2023-12-21 17:25:59,419 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 154 transitions. Word has length 159 [2023-12-21 17:25:59,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:25:59,419 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 154 transitions. [2023-12-21 17:25:59,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.52) internal successors, (88), 25 states have internal predecessors, (88), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 17:25:59,419 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 154 transitions. [2023-12-21 17:25:59,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2023-12-21 17:25:59,421 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:25:59,421 INFO L195 NwaCegarLoop]: trace histogram [66, 66, 66, 40, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:25:59,439 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-21 17:25:59,630 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-21 17:25:59,630 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:25:59,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:25:59,631 INFO L85 PathProgramCache]: Analyzing trace with hash -2139164298, now seen corresponding path program 6 times [2023-12-21 17:25:59,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:25:59,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1768792993] [2023-12-21 17:25:59,631 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-21 17:25:59,631 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-21 17:25:59,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:25:59,633 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-21 17:25:59,633 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-21 17:25:59,820 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2023-12-21 17:25:59,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 17:25:59,825 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 17:25:59,828 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:25:59,856 INFO L134 CoverageAnalysis]: Checked inductivity of 7475 backedges. 3000 proven. 10 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2023-12-21 17:25:59,857 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:25:59,924 INFO L134 CoverageAnalysis]: Checked inductivity of 7475 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7465 trivial. 0 not checked. [2023-12-21 17:25:59,924 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:25:59,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1768792993] [2023-12-21 17:25:59,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1768792993] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:25:59,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:25:59,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-12-21 17:25:59,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148536115] [2023-12-21 17:25:59,925 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:25:59,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-21 17:25:59,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:25:59,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-21 17:25:59,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-12-21 17:25:59,926 INFO L87 Difference]: Start difference. First operand 128 states and 154 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-21 17:26:00,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:26:00,052 INFO L93 Difference]: Finished difference Result 210 states and 264 transitions. [2023-12-21 17:26:00,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-21 17:26:00,052 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 267 [2023-12-21 17:26:00,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:26:00,053 INFO L225 Difference]: With dead ends: 210 [2023-12-21 17:26:00,053 INFO L226 Difference]: Without dead ends: 134 [2023-12-21 17:26:00,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 522 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2023-12-21 17:26:00,054 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 17:26:00,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 17:26:00,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-12-21 17:26:00,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2023-12-21 17:26:00,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 129 states have (on average 1.193798449612403) internal successors, (154), 129 states have internal predecessors, (154), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 17:26:00,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 160 transitions. [2023-12-21 17:26:00,061 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 160 transitions. Word has length 267 [2023-12-21 17:26:00,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:26:00,061 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 160 transitions. [2023-12-21 17:26:00,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-21 17:26:00,061 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 160 transitions. [2023-12-21 17:26:00,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2023-12-21 17:26:00,063 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:26:00,063 INFO L195 NwaCegarLoop]: trace histogram [66, 66, 66, 40, 10, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:26:00,069 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-21 17:26:00,269 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-21 17:26:00,269 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:26:00,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:26:00,270 INFO L85 PathProgramCache]: Analyzing trace with hash -693685322, now seen corresponding path program 7 times [2023-12-21 17:26:00,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:26:00,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1508300849] [2023-12-21 17:26:00,270 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-21 17:26:00,270 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-21 17:26:00,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:26:00,272 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-21 17:26:00,300 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-21 17:26:00,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 17:26:00,763 INFO L262 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-21 17:26:00,766 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:26:01,079 INFO L134 CoverageAnalysis]: Checked inductivity of 7520 backedges. 2996 proven. 715 refuted. 0 times theorem prover too weak. 3809 trivial. 0 not checked. [2023-12-21 17:26:01,079 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:26:02,148 INFO L134 CoverageAnalysis]: Checked inductivity of 7520 backedges. 0 proven. 3713 refuted. 0 times theorem prover too weak. 3807 trivial. 0 not checked. [2023-12-21 17:26:02,149 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:26:02,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1508300849] [2023-12-21 17:26:02,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1508300849] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:26:02,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:26:02,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2023-12-21 17:26:02,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057297682] [2023-12-21 17:26:02,149 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:26:02,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-12-21 17:26:02,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:26:02,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-12-21 17:26:02,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=607, Invalid=1649, Unknown=0, NotChecked=0, Total=2256 [2023-12-21 17:26:02,151 INFO L87 Difference]: Start difference. First operand 134 states and 160 transitions. Second operand has 48 states, 48 states have (on average 3.3333333333333335) internal successors, (160), 48 states have internal predecessors, (160), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 17:26:04,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:26:04,780 INFO L93 Difference]: Finished difference Result 278 states and 367 transitions. [2023-12-21 17:26:04,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-12-21 17:26:04,797 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 3.3333333333333335) internal successors, (160), 48 states have internal predecessors, (160), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 273 [2023-12-21 17:26:04,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:26:04,798 INFO L225 Difference]: With dead ends: 278 [2023-12-21 17:26:04,798 INFO L226 Difference]: Without dead ends: 188 [2023-12-21 17:26:04,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 576 GetRequests, 514 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1279, Invalid=2753, Unknown=0, NotChecked=0, Total=4032 [2023-12-21 17:26:04,800 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 504 mSDsluCounter, 1277 mSDsCounter, 0 mSdLazyCounter, 1110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-21 17:26:04,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 1340 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1110 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-21 17:26:04,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2023-12-21 17:26:04,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2023-12-21 17:26:04,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 183 states have (on average 1.2349726775956285) internal successors, (226), 183 states have internal predecessors, (226), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 17:26:04,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 232 transitions. [2023-12-21 17:26:04,811 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 232 transitions. Word has length 273 [2023-12-21 17:26:04,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:26:04,811 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 232 transitions. [2023-12-21 17:26:04,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 3.3333333333333335) internal successors, (160), 48 states have internal predecessors, (160), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 17:26:04,812 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 232 transitions. [2023-12-21 17:26:04,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2023-12-21 17:26:04,815 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:26:04,815 INFO L195 NwaCegarLoop]: trace histogram [120, 120, 120, 40, 10, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:26:04,829 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-21 17:26:05,015 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-21 17:26:05,016 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:26:05,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:26:05,016 INFO L85 PathProgramCache]: Analyzing trace with hash -33086122, now seen corresponding path program 8 times [2023-12-21 17:26:05,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:26:05,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1401711061] [2023-12-21 17:26:05,017 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 17:26:05,017 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-21 17:26:05,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:26:05,021 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-21 17:26:05,021 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-21 17:26:08,148 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 17:26:08,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 17:26:08,194 INFO L262 TraceCheckSpWp]: Trace formula consists of 1040 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-21 17:26:08,199 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:26:08,281 INFO L134 CoverageAnalysis]: Checked inductivity of 22667 backedges. 9768 proven. 55 refuted. 0 times theorem prover too weak. 12844 trivial. 0 not checked. [2023-12-21 17:26:08,281 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:26:08,553 INFO L134 CoverageAnalysis]: Checked inductivity of 22667 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 22612 trivial. 0 not checked. [2023-12-21 17:26:08,554 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:26:08,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1401711061] [2023-12-21 17:26:08,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1401711061] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:26:08,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:26:08,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2023-12-21 17:26:08,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008249463] [2023-12-21 17:26:08,554 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:26:08,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-21 17:26:08,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:26:08,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-21 17:26:08,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2023-12-21 17:26:08,555 INFO L87 Difference]: Start difference. First operand 188 states and 232 transitions. Second operand has 24 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-21 17:26:09,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:26:09,212 INFO L93 Difference]: Finished difference Result 330 states and 426 transitions. [2023-12-21 17:26:09,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-21 17:26:09,214 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 435 [2023-12-21 17:26:09,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:26:09,224 INFO L225 Difference]: With dead ends: 330 [2023-12-21 17:26:09,224 INFO L226 Difference]: Without dead ends: 200 [2023-12-21 17:26:09,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 878 GetRequests, 846 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2023-12-21 17:26:09,225 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 17:26:09,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 273 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 17:26:09,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-12-21 17:26:09,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2023-12-21 17:26:09,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 195 states have (on average 1.2205128205128206) internal successors, (238), 195 states have internal predecessors, (238), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 17:26:09,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 244 transitions. [2023-12-21 17:26:09,234 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 244 transitions. Word has length 435 [2023-12-21 17:26:09,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:26:09,235 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 244 transitions. [2023-12-21 17:26:09,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-21 17:26:09,235 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 244 transitions. [2023-12-21 17:26:09,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2023-12-21 17:26:09,237 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:26:09,237 INFO L195 NwaCegarLoop]: trace histogram [120, 120, 120, 40, 22, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:26:09,259 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-21 17:26:09,459 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-21 17:26:09,459 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:26:09,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:26:09,460 INFO L85 PathProgramCache]: Analyzing trace with hash -15902250, now seen corresponding path program 9 times [2023-12-21 17:26:09,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:26:09,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [689822010] [2023-12-21 17:26:09,460 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 17:26:09,460 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-21 17:26:09,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:26:09,473 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-21 17:26:09,473 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-21 17:26:10,351 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2023-12-21 17:26:10,351 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 17:26:10,370 INFO L262 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-21 17:26:10,374 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:26:10,603 INFO L134 CoverageAnalysis]: Checked inductivity of 22865 backedges. 9768 proven. 253 refuted. 0 times theorem prover too weak. 12844 trivial. 0 not checked. [2023-12-21 17:26:10,603 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:26:11,573 INFO L134 CoverageAnalysis]: Checked inductivity of 22865 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 22612 trivial. 0 not checked. [2023-12-21 17:26:11,573 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:26:11,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [689822010] [2023-12-21 17:26:11,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [689822010] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:26:11,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:26:11,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2023-12-21 17:26:11,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067059280] [2023-12-21 17:26:11,574 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:26:11,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-12-21 17:26:11,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:26:11,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-12-21 17:26:11,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=601, Invalid=1655, Unknown=0, NotChecked=0, Total=2256 [2023-12-21 17:26:11,575 INFO L87 Difference]: Start difference. First operand 200 states and 244 transitions. Second operand has 48 states, 48 states have (on average 1.4375) internal successors, (69), 48 states have internal predecessors, (69), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-21 17:26:13,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:26:13,937 INFO L93 Difference]: Finished difference Result 347 states and 448 transitions. [2023-12-21 17:26:13,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-12-21 17:26:13,938 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.4375) internal successors, (69), 48 states have internal predecessors, (69), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 447 [2023-12-21 17:26:13,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:26:13,949 INFO L225 Difference]: With dead ends: 347 [2023-12-21 17:26:13,949 INFO L226 Difference]: Without dead ends: 217 [2023-12-21 17:26:13,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 907 GetRequests, 846 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1216, Invalid=2690, Unknown=0, NotChecked=0, Total=3906 [2023-12-21 17:26:13,952 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 17:26:13,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 453 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 17:26:13,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2023-12-21 17:26:13,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2023-12-21 17:26:13,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 212 states have (on average 1.2028301886792452) internal successors, (255), 212 states have internal predecessors, (255), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 17:26:13,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 261 transitions. [2023-12-21 17:26:13,959 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 261 transitions. Word has length 447 [2023-12-21 17:26:13,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:26:13,960 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 261 transitions. [2023-12-21 17:26:13,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.4375) internal successors, (69), 48 states have internal predecessors, (69), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-21 17:26:13,960 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 261 transitions. [2023-12-21 17:26:13,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2023-12-21 17:26:13,986 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:26:13,987 INFO L195 NwaCegarLoop]: trace histogram [120, 120, 120, 40, 39, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:26:13,997 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 (17)] Ended with exit code 0 [2023-12-21 17:26:14,189 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-21 17:26:14,189 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:26:14,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:26:14,190 INFO L85 PathProgramCache]: Analyzing trace with hash -683472164, now seen corresponding path program 10 times [2023-12-21 17:26:14,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:26:14,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [83966123] [2023-12-21 17:26:14,191 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-21 17:26:14,191 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-21 17:26:14,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:26:14,192 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-21 17:26:14,196 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-21 17:26:21,757 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-21 17:26:21,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 17:26:21,814 INFO L262 TraceCheckSpWp]: Trace formula consists of 1185 conjuncts, 253 conjunts are in the unsatisfiable core [2023-12-21 17:26:21,824 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:26:23,328 INFO L134 CoverageAnalysis]: Checked inductivity of 23392 backedges. 0 proven. 21420 refuted. 0 times theorem prover too weak. 1972 trivial. 0 not checked. [2023-12-21 17:26:23,328 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:26:30,518 INFO L134 CoverageAnalysis]: Checked inductivity of 23392 backedges. 0 proven. 21420 refuted. 0 times theorem prover too weak. 1972 trivial. 0 not checked. [2023-12-21 17:26:30,518 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:26:30,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [83966123] [2023-12-21 17:26:30,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [83966123] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:26:30,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:26:30,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 93 [2023-12-21 17:26:30,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962685893] [2023-12-21 17:26:30,519 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:26:30,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 93 states [2023-12-21 17:26:30,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:26:30,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2023-12-21 17:26:30,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=8324, Unknown=0, NotChecked=0, Total=8556 [2023-12-21 17:26:30,522 INFO L87 Difference]: Start difference. First operand 217 states and 261 transitions. Second operand has 93 states, 91 states have (on average 2.857142857142857) internal successors, (260), 89 states have internal predecessors, (260), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-21 17:26:33,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:26:33,845 INFO L93 Difference]: Finished difference Result 1759 states and 2491 transitions. [2023-12-21 17:26:33,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-12-21 17:26:33,845 INFO L78 Accepts]: Start accepts. Automaton has has 93 states, 91 states have (on average 2.857142857142857) internal successors, (260), 89 states have internal predecessors, (260), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 464 [2023-12-21 17:26:33,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:26:33,854 INFO L225 Difference]: With dead ends: 1759 [2023-12-21 17:26:33,854 INFO L226 Difference]: Without dead ends: 1755 [2023-12-21 17:26:33,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 927 GetRequests, 835 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=237, Invalid=8505, Unknown=0, NotChecked=0, Total=8742 [2023-12-21 17:26:33,859 INFO L413 NwaCegarLoop]: 301 mSDtfsCounter, 131 mSDsluCounter, 20016 mSDsCounter, 0 mSdLazyCounter, 9318 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 20317 SdHoareTripleChecker+Invalid, 9397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 9318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-12-21 17:26:33,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 20317 Invalid, 9397 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [79 Valid, 9318 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-12-21 17:26:33,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1755 states. [2023-12-21 17:26:33,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1755 to 1624. [2023-12-21 17:26:33,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1616 states have (on average 1.3248762376237624) internal successors, (2141), 1617 states have internal predecessors, (2141), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2023-12-21 17:26:33,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2155 transitions. [2023-12-21 17:26:33,965 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2155 transitions. Word has length 464 [2023-12-21 17:26:33,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:26:33,965 INFO L495 AbstractCegarLoop]: Abstraction has 1624 states and 2155 transitions. [2023-12-21 17:26:33,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 93 states, 91 states have (on average 2.857142857142857) internal successors, (260), 89 states have internal predecessors, (260), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-21 17:26:33,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2155 transitions. [2023-12-21 17:26:33,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2023-12-21 17:26:33,974 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:26:33,974 INFO L195 NwaCegarLoop]: trace histogram [120, 120, 119, 40, 39, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:26:34,000 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-21 17:26:34,194 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-21 17:26:34,194 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:26:34,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:26:34,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1492818790, now seen corresponding path program 1 times [2023-12-21 17:26:34,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:26:34,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [205884813] [2023-12-21 17:26:34,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 17:26:34,196 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-21 17:26:34,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:26:34,197 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 17:26:34,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-12-21 17:26:42,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 17:26:42,221 INFO L262 TraceCheckSpWp]: Trace formula consists of 1185 conjuncts, 97 conjunts are in the unsatisfiable core [2023-12-21 17:26:42,227 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:26:43,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-21 17:26:43,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-21 17:26:49,159 INFO L134 CoverageAnalysis]: Checked inductivity of 23392 backedges. 9769 proven. 8160 refuted. 0 times theorem prover too weak. 5463 trivial. 0 not checked. [2023-12-21 17:26:49,159 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:27:00,469 INFO L349 Elim1Store]: treesize reduction 4, result has 73.3 percent of original size [2023-12-21 17:27:00,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2023-12-21 17:27:04,750 INFO L134 CoverageAnalysis]: Checked inductivity of 23392 backedges. 9884 proven. 7224 refuted. 0 times theorem prover too weak. 6284 trivial. 0 not checked. [2023-12-21 17:27:04,750 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:27:04,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [205884813] [2023-12-21 17:27:04,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [205884813] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:27:04,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:27:04,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 50] total 138 [2023-12-21 17:27:04,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765448390] [2023-12-21 17:27:04,751 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:27:04,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 138 states [2023-12-21 17:27:04,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:27:04,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2023-12-21 17:27:04,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=491, Invalid=18414, Unknown=1, NotChecked=0, Total=18906 [2023-12-21 17:27:04,756 INFO L87 Difference]: Start difference. First operand 1624 states and 2155 transitions. Second operand has 138 states, 136 states have (on average 2.375) internal successors, (323), 135 states have internal predecessors, (323), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-21 17:27:08,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 17:27:13,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 17:27:17,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 17:27:21,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 17:27:25,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 17:27:29,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 17:27:33,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 17:27:37,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 17:27:42,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 17:27:46,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 17:27:50,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 17:27:54,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 17:27:59,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 17:28:03,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 17:28:07,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 17:28:11,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 17:28:16,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 17:28:20,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 17:28:24,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 17:28:28,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 17:28:32,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 17:28:37,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 17:28:41,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 17:28:45,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 17:28:49,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 17:28:53,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 17:28:57,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 17:29:02,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 17:29:24,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 17:29:28,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 17:29:50,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 17:29:50,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:29:50,945 INFO L93 Difference]: Finished difference Result 3783 states and 5146 transitions. [2023-12-21 17:29:50,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 222 states. [2023-12-21 17:29:50,946 INFO L78 Accepts]: Start accepts. Automaton has has 138 states, 136 states have (on average 2.375) internal successors, (323), 135 states have internal predecessors, (323), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 464 [2023-12-21 17:29:50,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:29:50,956 INFO L225 Difference]: With dead ends: 3783 [2023-12-21 17:29:50,957 INFO L226 Difference]: Without dead ends: 3622 [2023-12-21 17:29:50,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1099 GetRequests, 869 SyntacticMatches, 0 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9918 ImplicationChecksByTransitivity, 34.3s TimeCoverageRelationStatistics Valid=1466, Invalid=52125, Unknown=1, NotChecked=0, Total=53592 [2023-12-21 17:29:50,961 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 352 mSDsluCounter, 16691 mSDsCounter, 0 mSdLazyCounter, 24584 mSolverCounterSat, 16 mSolverCounterUnsat, 31 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 147.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 16863 SdHoareTripleChecker+Invalid, 24631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 24584 IncrementalHoareTripleChecker+Invalid, 31 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 150.9s IncrementalHoareTripleChecker+Time [2023-12-21 17:29:50,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 16863 Invalid, 24631 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [16 Valid, 24584 Invalid, 31 Unknown, 0 Unchecked, 150.9s Time] [2023-12-21 17:29:50,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3622 states. [2023-12-21 17:29:51,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3622 to 3289. [2023-12-21 17:29:51,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3289 states, 3277 states have (on average 1.3314006713457431) internal successors, (4363), 3280 states have internal predecessors, (4363), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2023-12-21 17:29:51,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3289 states to 3289 states and 4384 transitions. [2023-12-21 17:29:51,199 INFO L78 Accepts]: Start accepts. Automaton has 3289 states and 4384 transitions. Word has length 464 [2023-12-21 17:29:51,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:29:51,200 INFO L495 AbstractCegarLoop]: Abstraction has 3289 states and 4384 transitions. [2023-12-21 17:29:51,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 138 states, 136 states have (on average 2.375) internal successors, (323), 135 states have internal predecessors, (323), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-21 17:29:51,200 INFO L276 IsEmpty]: Start isEmpty. Operand 3289 states and 4384 transitions. [2023-12-21 17:29:51,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2023-12-21 17:29:51,212 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:29:51,212 INFO L195 NwaCegarLoop]: trace histogram [120, 120, 119, 40, 39, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:29:51,244 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 (19)] Forceful destruction successful, exit code 0 [2023-12-21 17:29:51,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 17:29:51,440 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:29:51,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:29:51,441 INFO L85 PathProgramCache]: Analyzing trace with hash 17592414, now seen corresponding path program 2 times [2023-12-21 17:29:51,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:29:51,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [389347531] [2023-12-21 17:29:51,442 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 17:29:51,442 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-21 17:29:51,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:29:51,444 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 17:29:51,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-12-21 17:30:07,272 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 17:30:07,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 17:30:07,429 INFO L262 TraceCheckSpWp]: Trace formula consists of 1185 conjuncts, 298 conjunts are in the unsatisfiable core [2023-12-21 17:30:07,442 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:30:08,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-21 17:30:11,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 13 [2023-12-21 17:30:17,717 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:30:17,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2023-12-21 17:30:17,929 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:30:17,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 37 [2023-12-21 17:30:18,134 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:30:18,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 37 [2023-12-21 17:30:18,343 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:30:18,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 37 [2023-12-21 17:30:18,579 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:30:18,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 37 [2023-12-21 17:30:18,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:30:18,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 37 [2023-12-21 17:30:19,142 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:30:19,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 37 [2023-12-21 17:30:19,415 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:30:19,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 37 [2023-12-21 17:30:19,652 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:30:19,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 37 [2023-12-21 17:30:19,892 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:30:19,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 37 [2023-12-21 17:30:20,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:30:20,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 37 [2023-12-21 17:30:20,367 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:30:20,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 37 [2023-12-21 17:30:20,613 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:30:20,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 37 [2023-12-21 17:30:20,880 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:30:20,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 37 [2023-12-21 17:30:21,152 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:30:21,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 37 [2023-12-21 17:30:21,392 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:30:21,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 37 [2023-12-21 17:30:21,633 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:30:21,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 37 [2023-12-21 17:30:21,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:30:21,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 37 [2023-12-21 17:30:22,117 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:30:22,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 37 [2023-12-21 17:30:22,361 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:30:22,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 37 [2023-12-21 17:30:22,617 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:30:22,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 37 [2023-12-21 17:30:22,887 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:30:22,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 37 [2023-12-21 17:30:23,138 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:30:23,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 37 [2023-12-21 17:30:23,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:30:23,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 37 [2023-12-21 17:30:23,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:30:23,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 37 [2023-12-21 17:30:23,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:30:23,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 37 [2023-12-21 17:30:24,188 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:30:24,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 37 [2023-12-21 17:30:24,468 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:30:24,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 37 [2023-12-21 17:30:24,717 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:30:24,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 37 [2023-12-21 17:30:24,999 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:30:24,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 37 [2023-12-21 17:30:25,303 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:30:25,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 37 [2023-12-21 17:30:25,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:30:25,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 37 [2023-12-21 17:30:25,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:30:25,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 37 [2023-12-21 17:30:26,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:30:26,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 37 [2023-12-21 17:30:26,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:30:26,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 37 [2023-12-21 17:30:26,841 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:30:26,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 37 [2023-12-21 17:30:27,153 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:30:27,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 37 [2023-12-21 17:30:27,462 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:30:27,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 37 [2023-12-21 17:30:27,713 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:30:27,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 30 [2023-12-21 17:30:27,948 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:30:27,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 16 [2023-12-21 17:30:38,515 INFO L134 CoverageAnalysis]: Checked inductivity of 23392 backedges. 117 proven. 23271 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-21 17:30:38,516 INFO L327 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2023-12-21 17:40:21,609 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 (20)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-21 17:40:21,610 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-21 17:40:22,500 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 17:40:22,557 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 (20)] Ended with exit code 0 [2023-12-21 17:40:22,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 [2023-12-21 17:40:22,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 17:40:22,701 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 465 with TraceHistMax 120,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 287 known predicates. [2023-12-21 17:40:22,705 INFO L445 BasicCegarLoop]: Path program histogram: [10, 3, 2, 2, 1, 1] [2023-12-21 17:40:22,706 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 17:40:22,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 05:40:22 BoogieIcfgContainer [2023-12-21 17:40:22,708 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 17:40:22,708 INFO L158 Benchmark]: Toolchain (without parser) took 876184.90ms. Allocated memory was 275.8MB in the beginning and 580.9MB in the end (delta: 305.1MB). Free memory was 228.8MB in the beginning and 438.6MB in the end (delta: -209.8MB). Peak memory consumption was 374.8MB. Max. memory is 8.0GB. [2023-12-21 17:40:22,708 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 182.5MB. Free memory is still 130.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 17:40:22,708 INFO L158 Benchmark]: CACSL2BoogieTranslator took 153.02ms. Allocated memory is still 275.8MB. Free memory was 228.3MB in the beginning and 216.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-21 17:40:22,708 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.27ms. Allocated memory is still 275.8MB. Free memory was 216.7MB in the beginning and 215.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-21 17:40:22,708 INFO L158 Benchmark]: Boogie Preprocessor took 29.84ms. Allocated memory is still 275.8MB. Free memory was 215.2MB in the beginning and 213.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 17:40:22,709 INFO L158 Benchmark]: RCFGBuilder took 359.25ms. Allocated memory is still 275.8MB. Free memory was 213.1MB in the beginning and 197.8MB in the end (delta: 15.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-21 17:40:22,709 INFO L158 Benchmark]: TraceAbstraction took 875616.69ms. Allocated memory was 275.8MB in the beginning and 580.9MB in the end (delta: 305.1MB). Free memory was 197.3MB in the beginning and 438.6MB in the end (delta: -241.3MB). Peak memory consumption was 343.3MB. Max. memory is 8.0GB. [2023-12-21 17:40:22,709 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.12ms. Allocated memory is still 182.5MB. Free memory is still 130.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 153.02ms. Allocated memory is still 275.8MB. Free memory was 228.3MB in the beginning and 216.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.27ms. Allocated memory is still 275.8MB. Free memory was 216.7MB in the beginning and 215.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.84ms. Allocated memory is still 275.8MB. Free memory was 215.2MB in the beginning and 213.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 359.25ms. Allocated memory is still 275.8MB. Free memory was 213.1MB in the beginning and 197.8MB in the end (delta: 15.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 875616.69ms. Allocated memory was 275.8MB in the beginning and 580.9MB in the end (delta: 305.1MB). Free memory was 197.3MB in the beginning and 438.6MB in the end (delta: -241.3MB). Peak memory consumption was 343.3MB. 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: 53]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 53). Cancelled while NwaCegarLoop was analyzing trace of length 465 with TraceHistMax 120,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 287 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 875.5s, OverallIterations: 19, TraceHistogramMax: 120, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.1s, AutomataDifference: 180.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 31 mSolverCounterUnknown, 1274 SdHoareTripleChecker+Valid, 156.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1206 mSDsluCounter, 41226 SdHoareTripleChecker+Invalid, 152.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 40352 mSDsCounter, 128 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 37348 IncrementalHoareTripleChecker+Invalid, 37507 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 128 mSolverCounterUnsat, 874 mSDtfsCounter, 37348 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6313 GetRequests, 5648 SyntacticMatches, 0 SemanticMatches, 665 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11831 ImplicationChecksByTransitivity, 49.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3289occurred in iteration=18, InterpolantAutomatonStates: 535, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 466 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 20.6s SatisfiabilityAnalysisTime, 37.5s InterpolantComputationTime, 3091 NumberOfCodeBlocks, 2434 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 6015 ConstructedInterpolants, 124 QuantifiedInterpolants, 18725 SizeOfPredicates, 133 NumberOfNonLiveVariables, 6654 ConjunctsInSsa, 493 ConjunctsInUnsatCore, 32 InterpolantComputations, 4 PerfectInterpolantSequences, 161213/226257 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