/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/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-5.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 19:50:38,608 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 19:50:38,671 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-24 19:50:38,676 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 19:50:38,677 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 19:50:38,704 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 19:50:38,705 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 19:50:38,705 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 19:50:38,706 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 19:50:38,709 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 19:50:38,709 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 19:50:38,710 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 19:50:38,710 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 19:50:38,711 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 19:50:38,711 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 19:50:38,712 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 19:50:38,712 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 19:50:38,712 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 19:50:38,712 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 19:50:38,713 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 19:50:38,713 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 19:50:38,713 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 19:50:38,714 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 19:50:38,714 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 19:50:38,714 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 19:50:38,714 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 19:50:38,714 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 19:50:38,714 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 19:50:38,715 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 19:50:38,715 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 19:50:38,715 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 19:50:38,716 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 19:50:38,716 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 19:50:38,716 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 19:50:38,716 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 19:50:38,716 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 19:50:38,716 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 19:50:38,716 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 19:50:38,717 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 19:50:38,717 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 19:50:38,717 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 19:50:38,717 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 19:50:38,717 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 19:50:38,717 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 19:50:38,718 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 19:50:38,718 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 19:50:38,718 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-24 19:50:38,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 19:50:38,931 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 19:50:38,932 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 19:50:38,933 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 19:50:38,933 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 19:50:38,935 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-5.i [2023-12-24 19:50:40,064 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 19:50:40,249 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 19:50:40,249 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-5.i [2023-12-24 19:50:40,255 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68bea9b39/b912c144580d4f73b3cbf5cd5d35220a/FLAG56917ae1d [2023-12-24 19:50:40,265 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68bea9b39/b912c144580d4f73b3cbf5cd5d35220a [2023-12-24 19:50:40,267 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 19:50:40,268 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 19:50:40,269 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 19:50:40,269 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 19:50:40,275 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 19:50:40,276 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 07:50:40" (1/1) ... [2023-12-24 19:50:40,277 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@408102bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 07:50:40, skipping insertion in model container [2023-12-24 19:50:40,277 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 07:50:40" (1/1) ... [2023-12-24 19:50:40,307 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 19:50:40,421 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-5.i[916,929] [2023-12-24 19:50:40,465 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 19:50:40,487 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 19:50:40,495 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-5.i[916,929] [2023-12-24 19:50:40,519 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 19:50:40,543 INFO L206 MainTranslator]: Completed translation [2023-12-24 19:50:40,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 07:50:40 WrapperNode [2023-12-24 19:50:40,544 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 19:50:40,544 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 19:50:40,544 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 19:50:40,545 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 19:50:40,561 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 07:50:40" (1/1) ... [2023-12-24 19:50:40,572 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 07:50:40" (1/1) ... [2023-12-24 19:50:40,603 INFO L138 Inliner]: procedures = 33, calls = 154, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 422 [2023-12-24 19:50:40,603 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 19:50:40,604 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 19:50:40,604 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 19:50:40,604 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 19:50:40,611 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 07:50:40" (1/1) ... [2023-12-24 19:50:40,611 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 07:50:40" (1/1) ... [2023-12-24 19:50:40,618 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 07:50:40" (1/1) ... [2023-12-24 19:50:40,630 INFO L175 MemorySlicer]: Split 122 memory accesses to 2 slices as follows [2, 120]. 98 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 15]. The 17 writes are split as follows [0, 17]. [2023-12-24 19:50:40,631 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 07:50:40" (1/1) ... [2023-12-24 19:50:40,631 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 07:50:40" (1/1) ... [2023-12-24 19:50:40,642 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 07:50:40" (1/1) ... [2023-12-24 19:50:40,644 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 07:50:40" (1/1) ... [2023-12-24 19:50:40,646 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 07:50:40" (1/1) ... [2023-12-24 19:50:40,648 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 07:50:40" (1/1) ... [2023-12-24 19:50:40,651 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 19:50:40,652 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 19:50:40,652 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 19:50:40,652 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 19:50:40,652 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 07:50:40" (1/1) ... [2023-12-24 19:50:40,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 19:50:40,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 19:50:40,698 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-24 19:50:40,710 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-24 19:50:40,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 19:50:40,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-12-24 19:50:40,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-12-24 19:50:40,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2023-12-24 19:50:40,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2023-12-24 19:50:40,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 19:50:40,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 19:50:40,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2023-12-24 19:50:40,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2023-12-24 19:50:40,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-24 19:50:40,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-24 19:50:40,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2023-12-24 19:50:40,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2023-12-24 19:50:40,731 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 19:50:40,731 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 19:50:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 19:50:40,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 19:50:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-12-24 19:50:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-12-24 19:50:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2023-12-24 19:50:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2023-12-24 19:50:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-24 19:50:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-24 19:50:40,828 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 19:50:40,829 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 19:50:41,345 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 19:50:41,377 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 19:50:41,377 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 19:50:41,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 07:50:41 BoogieIcfgContainer [2023-12-24 19:50:41,378 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 19:50:41,379 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 19:50:41,379 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 19:50:41,381 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 19:50:41,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 07:50:40" (1/3) ... [2023-12-24 19:50:41,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5730b841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 07:50:41, skipping insertion in model container [2023-12-24 19:50:41,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 07:50:40" (2/3) ... [2023-12-24 19:50:41,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5730b841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 07:50:41, skipping insertion in model container [2023-12-24 19:50:41,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 07:50:41" (3/3) ... [2023-12-24 19:50:41,384 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-5.i [2023-12-24 19:50:41,396 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 19:50:41,396 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 19:50:41,426 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 19:50:41,431 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;@23e11227, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 19:50:41,431 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 19:50:41,434 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 66 states have internal predecessors, (89), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 19:50:41,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-24 19:50:41,445 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 19:50:41,445 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 19:50:41,446 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 19:50:41,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 19:50:41,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1153577596, now seen corresponding path program 1 times [2023-12-24 19:50:41,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 19:50:41,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1081555429] [2023-12-24 19:50:41,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 19:50:41,459 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-24 19:50:41,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 19:50:41,461 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-24 19:50:41,463 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-24 19:50:41,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 19:50:41,672 INFO L262 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 19:50:41,678 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 19:50:41,709 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2023-12-24 19:50:41,710 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 19:50:41,710 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 19:50:41,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1081555429] [2023-12-24 19:50:41,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1081555429] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 19:50:41,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 19:50:41,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 19:50:41,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832447801] [2023-12-24 19:50:41,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 19:50:41,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 19:50:41,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 19:50:41,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 19:50:41,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 19:50:41,746 INFO L87 Difference]: Start difference. First operand has 88 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 66 states have internal predecessors, (89), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-24 19:50:41,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 19:50:41,811 INFO L93 Difference]: Finished difference Result 173 states and 276 transitions. [2023-12-24 19:50:41,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 19:50:41,813 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 142 [2023-12-24 19:50:41,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 19:50:41,821 INFO L225 Difference]: With dead ends: 173 [2023-12-24 19:50:41,821 INFO L226 Difference]: Without dead ends: 86 [2023-12-24 19:50:41,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 141 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-24 19:50:41,828 INFO L413 NwaCegarLoop]: 119 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, 119 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-24 19:50:41,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 19:50:41,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-12-24 19:50:41,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-12-24 19:50:41,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 64 states have (on average 1.3125) internal successors, (84), 64 states have internal predecessors, (84), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 19:50:41,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 124 transitions. [2023-12-24 19:50:41,859 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 124 transitions. Word has length 142 [2023-12-24 19:50:41,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 19:50:41,859 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 124 transitions. [2023-12-24 19:50:41,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-24 19:50:41,859 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 124 transitions. [2023-12-24 19:50:41,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-24 19:50:41,864 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 19:50:41,864 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 19:50:41,871 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-24 19:50:42,067 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-24 19:50:42,068 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 19:50:42,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 19:50:42,069 INFO L85 PathProgramCache]: Analyzing trace with hash 2125771348, now seen corresponding path program 1 times [2023-12-24 19:50:42,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 19:50:42,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1490393668] [2023-12-24 19:50:42,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 19:50:42,070 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-24 19:50:42,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 19:50:42,082 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-24 19:50:42,084 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-24 19:50:42,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 19:50:42,266 INFO L262 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 19:50:42,270 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 19:50:42,305 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 19:50:42,305 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 19:50:42,306 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 19:50:42,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1490393668] [2023-12-24 19:50:42,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1490393668] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 19:50:42,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 19:50:42,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 19:50:42,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148642712] [2023-12-24 19:50:42,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 19:50:42,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 19:50:42,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 19:50:42,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 19:50:42,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 19:50:42,308 INFO L87 Difference]: Start difference. First operand 86 states and 124 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 19:50:42,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 19:50:42,409 INFO L93 Difference]: Finished difference Result 192 states and 278 transitions. [2023-12-24 19:50:42,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 19:50:42,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 142 [2023-12-24 19:50:42,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 19:50:42,414 INFO L225 Difference]: With dead ends: 192 [2023-12-24 19:50:42,414 INFO L226 Difference]: Without dead ends: 107 [2023-12-24 19:50:42,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-24 19:50:42,416 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 46 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 19:50:42,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 374 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 19:50:42,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-12-24 19:50:42,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 88. [2023-12-24 19:50:42,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 66 states have (on average 1.303030303030303) internal successors, (86), 66 states have internal predecessors, (86), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 19:50:42,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 126 transitions. [2023-12-24 19:50:42,427 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 126 transitions. Word has length 142 [2023-12-24 19:50:42,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 19:50:42,429 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 126 transitions. [2023-12-24 19:50:42,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 19:50:42,429 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 126 transitions. [2023-12-24 19:50:42,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-24 19:50:42,431 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 19:50:42,431 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 19:50:42,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 (3)] Forceful destruction successful, exit code 0 [2023-12-24 19:50:42,640 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-24 19:50:42,642 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 19:50:42,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 19:50:42,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1410206841, now seen corresponding path program 1 times [2023-12-24 19:50:42,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 19:50:42,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1102967599] [2023-12-24 19:50:42,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 19:50:42,650 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 19:50:42,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 19:50:42,651 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-24 19:50:42,693 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-24 19:50:42,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 19:50:42,858 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 19:50:42,861 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 19:50:42,887 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 19:50:42,887 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 19:50:42,887 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 19:50:42,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1102967599] [2023-12-24 19:50:42,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1102967599] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 19:50:42,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 19:50:42,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 19:50:42,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631321] [2023-12-24 19:50:42,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 19:50:42,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 19:50:42,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 19:50:42,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 19:50:42,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 19:50:42,889 INFO L87 Difference]: Start difference. First operand 88 states and 126 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 19:50:42,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 19:50:42,979 INFO L93 Difference]: Finished difference Result 196 states and 281 transitions. [2023-12-24 19:50:42,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 19:50:42,980 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2023-12-24 19:50:42,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 19:50:42,981 INFO L225 Difference]: With dead ends: 196 [2023-12-24 19:50:42,981 INFO L226 Difference]: Without dead ends: 109 [2023-12-24 19:50:42,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-24 19:50:42,983 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 46 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 19:50:42,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 457 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 19:50:42,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-12-24 19:50:42,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 92. [2023-12-24 19:50:42,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 70 states have internal predecessors, (90), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 19:50:42,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 130 transitions. [2023-12-24 19:50:42,997 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 130 transitions. Word has length 144 [2023-12-24 19:50:42,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 19:50:42,997 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 130 transitions. [2023-12-24 19:50:42,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 19:50:42,998 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 130 transitions. [2023-12-24 19:50:42,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-24 19:50:42,999 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 19:50:42,999 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 19:50:43,023 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-24 19:50:43,207 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-24 19:50:43,207 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 19:50:43,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 19:50:43,208 INFO L85 PathProgramCache]: Analyzing trace with hash 600860215, now seen corresponding path program 1 times [2023-12-24 19:50:43,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 19:50:43,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [617062897] [2023-12-24 19:50:43,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 19:50:43,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-24 19:50:43,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 19:50:43,225 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-24 19:50:43,238 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-24 19:50:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 19:50:43,429 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 19:50:43,432 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 19:50:43,458 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 19:50:43,458 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 19:50:43,458 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 19:50:43,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [617062897] [2023-12-24 19:50:43,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [617062897] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 19:50:43,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 19:50:43,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 19:50:43,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381883696] [2023-12-24 19:50:43,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 19:50:43,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 19:50:43,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 19:50:43,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 19:50:43,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-24 19:50:43,460 INFO L87 Difference]: Start difference. First operand 92 states and 130 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 19:50:43,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 19:50:43,608 INFO L93 Difference]: Finished difference Result 203 states and 286 transitions. [2023-12-24 19:50:43,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 19:50:43,610 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2023-12-24 19:50:43,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 19:50:43,612 INFO L225 Difference]: With dead ends: 203 [2023-12-24 19:50:43,612 INFO L226 Difference]: Without dead ends: 112 [2023-12-24 19:50:43,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-12-24 19:50:43,614 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 49 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 19:50:43,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 565 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 19:50:43,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-12-24 19:50:43,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 94. [2023-12-24 19:50:43,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 72 states have internal predecessors, (92), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 19:50:43,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 132 transitions. [2023-12-24 19:50:43,624 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 132 transitions. Word has length 144 [2023-12-24 19:50:43,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 19:50:43,625 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 132 transitions. [2023-12-24 19:50:43,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 19:50:43,625 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 132 transitions. [2023-12-24 19:50:43,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-24 19:50:43,627 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 19:50:43,627 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 19:50:43,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-24 19:50:43,834 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-24 19:50:43,834 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 19:50:43,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 19:50:43,836 INFO L85 PathProgramCache]: Analyzing trace with hash 658118517, now seen corresponding path program 1 times [2023-12-24 19:50:43,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 19:50:43,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1965775440] [2023-12-24 19:50:43,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 19:50:43,836 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-24 19:50:43,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 19:50:43,837 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-24 19:50:43,852 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-24 19:50:44,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 19:50:44,035 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 19:50:44,038 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 19:50:44,080 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 19:50:44,080 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 19:50:44,080 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 19:50:44,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1965775440] [2023-12-24 19:50:44,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1965775440] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 19:50:44,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 19:50:44,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-24 19:50:44,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475036751] [2023-12-24 19:50:44,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 19:50:44,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 19:50:44,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 19:50:44,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 19:50:44,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-24 19:50:44,082 INFO L87 Difference]: Start difference. First operand 94 states and 132 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 19:50:44,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 19:50:44,241 INFO L93 Difference]: Finished difference Result 206 states and 286 transitions. [2023-12-24 19:50:44,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-24 19:50:44,242 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2023-12-24 19:50:44,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 19:50:44,243 INFO L225 Difference]: With dead ends: 206 [2023-12-24 19:50:44,243 INFO L226 Difference]: Without dead ends: 113 [2023-12-24 19:50:44,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2023-12-24 19:50:44,244 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 40 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 19:50:44,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 667 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 19:50:44,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-12-24 19:50:44,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 96. [2023-12-24 19:50:44,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 74 states have internal predecessors, (94), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 19:50:44,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 134 transitions. [2023-12-24 19:50:44,250 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 134 transitions. Word has length 144 [2023-12-24 19:50:44,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 19:50:44,251 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 134 transitions. [2023-12-24 19:50:44,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 19:50:44,251 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 134 transitions. [2023-12-24 19:50:44,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-24 19:50:44,252 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 19:50:44,252 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 19:50:44,267 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-24 19:50:44,459 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-24 19:50:44,459 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 19:50:44,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 19:50:44,459 INFO L85 PathProgramCache]: Analyzing trace with hash 658178099, now seen corresponding path program 1 times [2023-12-24 19:50:44,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 19:50:44,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1082909219] [2023-12-24 19:50:44,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 19:50:44,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-24 19:50:44,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 19:50:44,462 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-24 19:50:44,463 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-24 19:50:44,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 19:50:44,762 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 19:50:44,765 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 19:50:44,807 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 19:50:44,808 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 35 treesize of output 31 [2023-12-24 19:50:44,843 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 19:50:44,843 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 19:50:44,844 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 19:50:44,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1082909219] [2023-12-24 19:50:44,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1082909219] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 19:50:44,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 19:50:44,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 19:50:44,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396851015] [2023-12-24 19:50:44,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 19:50:44,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 19:50:44,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 19:50:44,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 19:50:44,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 19:50:44,845 INFO L87 Difference]: Start difference. First operand 96 states and 134 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 19:50:44,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 19:50:44,888 INFO L93 Difference]: Finished difference Result 191 states and 267 transitions. [2023-12-24 19:50:44,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 19:50:44,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2023-12-24 19:50:44,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 19:50:44,889 INFO L225 Difference]: With dead ends: 191 [2023-12-24 19:50:44,889 INFO L226 Difference]: Without dead ends: 96 [2023-12-24 19:50:44,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 142 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-24 19:50:44,890 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 19:50:44,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 233 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 19:50:44,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-12-24 19:50:44,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2023-12-24 19:50:44,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 74 states have internal predecessors, (93), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 19:50:44,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 133 transitions. [2023-12-24 19:50:44,895 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 133 transitions. Word has length 144 [2023-12-24 19:50:44,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 19:50:44,896 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 133 transitions. [2023-12-24 19:50:44,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 19:50:44,896 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 133 transitions. [2023-12-24 19:50:44,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-24 19:50:44,897 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 19:50:44,897 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 19:50:44,906 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-24 19:50:45,106 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-24 19:50:45,106 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 19:50:45,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 19:50:45,107 INFO L85 PathProgramCache]: Analyzing trace with hash 419948696, now seen corresponding path program 1 times [2023-12-24 19:50:45,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 19:50:45,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [974797036] [2023-12-24 19:50:45,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 19:50:45,108 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-24 19:50:45,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 19:50:45,109 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-24 19:50:45,109 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-24 19:50:45,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 19:50:45,307 INFO L262 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 19:50:45,310 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 19:50:45,318 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-24 19:50:45,331 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 19:50:45,331 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 19:50:45,331 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 19:50:45,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [974797036] [2023-12-24 19:50:45,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [974797036] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 19:50:45,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 19:50:45,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 19:50:45,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323707626] [2023-12-24 19:50:45,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 19:50:45,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 19:50:45,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 19:50:45,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 19:50:45,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 19:50:45,333 INFO L87 Difference]: Start difference. First operand 96 states and 133 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 19:50:45,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 19:50:45,384 INFO L93 Difference]: Finished difference Result 191 states and 265 transitions. [2023-12-24 19:50:45,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 19:50:45,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 146 [2023-12-24 19:50:45,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 19:50:45,385 INFO L225 Difference]: With dead ends: 191 [2023-12-24 19:50:45,385 INFO L226 Difference]: Without dead ends: 96 [2023-12-24 19:50:45,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 144 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-24 19:50:45,386 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 1 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 19:50:45,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 230 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 19:50:45,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-12-24 19:50:45,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2023-12-24 19:50:45,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 74 states have (on average 1.2432432432432432) internal successors, (92), 74 states have internal predecessors, (92), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 19:50:45,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 132 transitions. [2023-12-24 19:50:45,390 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 132 transitions. Word has length 146 [2023-12-24 19:50:45,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 19:50:45,390 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 132 transitions. [2023-12-24 19:50:45,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 19:50:45,390 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 132 transitions. [2023-12-24 19:50:45,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-24 19:50:45,391 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 19:50:45,391 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 19:50:45,398 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-24 19:50:45,599 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-24 19:50:45,599 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 19:50:45,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 19:50:45,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1268995046, now seen corresponding path program 1 times [2023-12-24 19:50:45,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 19:50:45,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [209602726] [2023-12-24 19:50:45,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 19:50:45,600 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-24 19:50:45,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 19:50:45,601 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-24 19:50:45,603 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-24 19:50:45,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 19:50:45,810 INFO L262 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 19:50:45,813 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 19:50:45,822 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-24 19:50:45,835 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 19:50:45,836 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 19:50:45,836 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 19:50:45,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [209602726] [2023-12-24 19:50:45,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [209602726] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 19:50:45,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 19:50:45,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 19:50:45,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970504914] [2023-12-24 19:50:45,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 19:50:45,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 19:50:45,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 19:50:45,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 19:50:45,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 19:50:45,837 INFO L87 Difference]: Start difference. First operand 96 states and 132 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 19:50:45,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 19:50:45,882 INFO L93 Difference]: Finished difference Result 216 states and 297 transitions. [2023-12-24 19:50:45,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 19:50:45,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 146 [2023-12-24 19:50:45,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 19:50:45,883 INFO L225 Difference]: With dead ends: 216 [2023-12-24 19:50:45,883 INFO L226 Difference]: Without dead ends: 121 [2023-12-24 19:50:45,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 144 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-24 19:50:45,884 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 32 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 19:50:45,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 248 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 19:50:45,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-12-24 19:50:45,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 96. [2023-12-24 19:50:45,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 74 states have (on average 1.2297297297297298) internal successors, (91), 74 states have internal predecessors, (91), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 19:50:45,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 131 transitions. [2023-12-24 19:50:45,887 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 131 transitions. Word has length 146 [2023-12-24 19:50:45,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 19:50:45,888 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 131 transitions. [2023-12-24 19:50:45,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 19:50:45,888 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 131 transitions. [2023-12-24 19:50:45,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-24 19:50:45,889 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 19:50:45,889 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 19:50:45,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-24 19:50:46,102 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-24 19:50:46,103 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 19:50:46,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 19:50:46,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1746108572, now seen corresponding path program 1 times [2023-12-24 19:50:46,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 19:50:46,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [500228752] [2023-12-24 19:50:46,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 19:50:46,104 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-24 19:50:46,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 19:50:46,105 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-24 19:50:46,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-24 19:50:46,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 19:50:46,430 INFO L262 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 45 conjunts are in the unsatisfiable core [2023-12-24 19:50:46,436 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 19:50:46,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-12-24 19:50:47,219 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 0 case distinctions, treesize of input 29 treesize of output 31 [2023-12-24 19:50:47,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2023-12-24 19:50:48,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2023-12-24 19:50:49,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 53 [2023-12-24 19:50:50,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 64 [2023-12-24 19:50:51,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 75 [2023-12-24 19:50:52,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 78 [2023-12-24 19:50:53,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 86 [2023-12-24 19:50:54,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 105 [2023-12-24 19:50:54,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 66 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 127 [2023-12-24 19:50:54,856 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 19:50:54,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 55 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 138 treesize of output 70 [2023-12-24 19:50:54,968 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 524 proven. 144 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2023-12-24 19:50:54,968 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 19:50:55,155 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_236 (_ BitVec 32)) (v_ArrVal_237 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (store (store |c_#memory_int#1| c_~WrapperStruct00_var_1_18_Pointer~0.base v_ArrVal_237) c_~WrapperStruct00_var_1_19_Pointer~0.base (let ((.cse3 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_18_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_18_Pointer~0.base) c_~WrapperStruct00_var_1_18_Pointer~0.offset (_ bv4294967292 32))))) (store (select .cse3 c_~WrapperStruct00_var_1_19_Pointer~0.base) c_~WrapperStruct00_var_1_19_Pointer~0.offset ((_ sign_extend 16) ((_ zero_extend 8) ((_ extract 7 0) (select (select .cse3 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset))))))))) (store .cse2 c_~WrapperStruct00_var_1_20_Pointer~0.base (store (select .cse2 c_~WrapperStruct00_var_1_20_Pointer~0.base) c_~WrapperStruct00_var_1_20_Pointer~0.offset v_ArrVal_236))))) (= ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse0 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset))) ((_ sign_extend 16) ((_ extract 15 0) (let ((.cse1 ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset))))) (bvadd (bvneg .cse1) .cse1))))))) is different from false [2023-12-24 19:50:55,219 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_236 (_ BitVec 32)) (v_ArrVal_237 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) |c_ULTIMATE.start_step_#t~ite32#1|)))))) (store (store .cse3 c_~WrapperStruct00_var_1_18_Pointer~0.base v_ArrVal_237) c_~WrapperStruct00_var_1_19_Pointer~0.base (let ((.cse4 (store .cse3 c_~WrapperStruct00_var_1_18_Pointer~0.base (store (select .cse3 c_~WrapperStruct00_var_1_18_Pointer~0.base) c_~WrapperStruct00_var_1_18_Pointer~0.offset (_ bv4294967292 32))))) (store (select .cse4 c_~WrapperStruct00_var_1_19_Pointer~0.base) c_~WrapperStruct00_var_1_19_Pointer~0.offset ((_ sign_extend 16) ((_ zero_extend 8) ((_ extract 7 0) (select (select .cse4 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset)))))))))) (store .cse2 c_~WrapperStruct00_var_1_20_Pointer~0.base (store (select .cse2 c_~WrapperStruct00_var_1_20_Pointer~0.base) c_~WrapperStruct00_var_1_20_Pointer~0.offset v_ArrVal_236))))) (= ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse0 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset))) ((_ sign_extend 16) ((_ extract 15 0) (let ((.cse1 ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset))))) (bvadd (bvneg .cse1) .cse1))))))) is different from false [2023-12-24 19:50:55,801 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 19:50:55,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [500228752] [2023-12-24 19:50:55,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [500228752] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 19:50:55,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1146099007] [2023-12-24 19:50:55,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 19:50:55,802 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 19:50:55,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 19:50:55,829 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 19:50:55,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2023-12-24 19:50:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 19:50:56,382 INFO L262 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 47 conjunts are in the unsatisfiable core [2023-12-24 19:50:56,389 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 19:50:56,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-12-24 19:50:57,221 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 0 case distinctions, treesize of input 32 treesize of output 23 [2023-12-24 19:50:57,788 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 0 case distinctions, treesize of input 29 treesize of output 31 [2023-12-24 19:50:58,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2023-12-24 19:50:59,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2023-12-24 19:50:59,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 53 [2023-12-24 19:51:01,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 56 [2023-12-24 19:51:02,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 64 [2023-12-24 19:51:02,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 67 [2023-12-24 19:51:04,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 83 [2023-12-24 19:51:04,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 45 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 105 [2023-12-24 19:51:04,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 65 [2023-12-24 19:51:04,723 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 496 proven. 144 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-12-24 19:51:04,724 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 19:51:05,180 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_279 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_281 (_ BitVec 32))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) |c_ULTIMATE.start_step_#t~ite32#1|)))))) (store (store .cse3 c_~WrapperStruct00_var_1_18_Pointer~0.base v_ArrVal_279) c_~WrapperStruct00_var_1_19_Pointer~0.base (let ((.cse4 (store .cse3 c_~WrapperStruct00_var_1_18_Pointer~0.base (store (select .cse3 c_~WrapperStruct00_var_1_18_Pointer~0.base) c_~WrapperStruct00_var_1_18_Pointer~0.offset (_ bv4294967292 32))))) (store (select .cse4 c_~WrapperStruct00_var_1_19_Pointer~0.base) c_~WrapperStruct00_var_1_19_Pointer~0.offset ((_ sign_extend 16) ((_ zero_extend 8) ((_ extract 7 0) (select (select .cse4 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset)))))))))) (store .cse2 c_~WrapperStruct00_var_1_20_Pointer~0.base (store (select .cse2 c_~WrapperStruct00_var_1_20_Pointer~0.base) c_~WrapperStruct00_var_1_20_Pointer~0.offset v_ArrVal_281))))) (= ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse0 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset))) ((_ sign_extend 16) ((_ extract 15 0) (let ((.cse1 ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset))))) (bvadd .cse1 (bvneg .cse1)))))))) is different from false [2023-12-24 19:51:05,231 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_279 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_281 (_ BitVec 32))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (let ((.cse5 ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset))))) (bvadd .cse5 (bvneg .cse5))))))))) (store (store .cse3 c_~WrapperStruct00_var_1_18_Pointer~0.base v_ArrVal_279) c_~WrapperStruct00_var_1_19_Pointer~0.base (let ((.cse4 (store .cse3 c_~WrapperStruct00_var_1_18_Pointer~0.base (store (select .cse3 c_~WrapperStruct00_var_1_18_Pointer~0.base) c_~WrapperStruct00_var_1_18_Pointer~0.offset (_ bv4294967292 32))))) (store (select .cse4 c_~WrapperStruct00_var_1_19_Pointer~0.base) c_~WrapperStruct00_var_1_19_Pointer~0.offset ((_ sign_extend 16) ((_ zero_extend 8) ((_ extract 7 0) (select (select .cse4 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset)))))))))) (store .cse2 c_~WrapperStruct00_var_1_20_Pointer~0.base (store (select .cse2 c_~WrapperStruct00_var_1_20_Pointer~0.base) c_~WrapperStruct00_var_1_20_Pointer~0.offset v_ArrVal_281))))) (= ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse0 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset))) ((_ sign_extend 16) ((_ extract 15 0) (let ((.cse1 ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset))))) (bvadd (bvneg .cse1) .cse1))))))) is different from false [2023-12-24 19:51:05,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1146099007] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 19:51:05,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 19:51:05,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 27 [2023-12-24 19:51:05,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693720232] [2023-12-24 19:51:05,419 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 19:51:05,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-24 19:51:05,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 19:51:05,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-24 19:51:05,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=977, Unknown=6, NotChecked=268, Total=1406 [2023-12-24 19:51:05,421 INFO L87 Difference]: Start difference. First operand 96 states and 131 transitions. Second operand has 28 states, 28 states have (on average 4.178571428571429) internal successors, (117), 27 states have internal predecessors, (117), 13 states have call successors, (40), 13 states have call predecessors, (40), 13 states have return successors, (40), 13 states have call predecessors, (40), 13 states have call successors, (40) [2023-12-24 19:51:18,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 19:51:18,832 INFO L93 Difference]: Finished difference Result 391 states and 538 transitions. [2023-12-24 19:51:18,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-24 19:51:18,833 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.178571428571429) internal successors, (117), 27 states have internal predecessors, (117), 13 states have call successors, (40), 13 states have call predecessors, (40), 13 states have return successors, (40), 13 states have call predecessors, (40), 13 states have call successors, (40) Word has length 146 [2023-12-24 19:51:18,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 19:51:18,838 INFO L225 Difference]: With dead ends: 391 [2023-12-24 19:51:18,838 INFO L226 Difference]: Without dead ends: 296 [2023-12-24 19:51:18,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=480, Invalid=1600, Unknown=6, NotChecked=364, Total=2450 [2023-12-24 19:51:18,846 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 849 mSDsluCounter, 1189 mSDsCounter, 0 mSdLazyCounter, 1848 mSolverCounterSat, 490 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 1317 SdHoareTripleChecker+Invalid, 2338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 490 IncrementalHoareTripleChecker+Valid, 1848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2023-12-24 19:51:18,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 1317 Invalid, 2338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [490 Valid, 1848 Invalid, 0 Unknown, 0 Unchecked, 10.9s Time] [2023-12-24 19:51:18,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2023-12-24 19:51:18,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 181. [2023-12-24 19:51:18,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 138 states have (on average 1.2173913043478262) internal successors, (168), 138 states have internal predecessors, (168), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-24 19:51:18,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 248 transitions. [2023-12-24 19:51:18,877 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 248 transitions. Word has length 146 [2023-12-24 19:51:18,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 19:51:18,877 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 248 transitions. [2023-12-24 19:51:18,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.178571428571429) internal successors, (117), 27 states have internal predecessors, (117), 13 states have call successors, (40), 13 states have call predecessors, (40), 13 states have return successors, (40), 13 states have call predecessors, (40), 13 states have call successors, (40) [2023-12-24 19:51:18,877 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 248 transitions. [2023-12-24 19:51:18,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-24 19:51:18,878 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 19:51:18,878 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 19:51:18,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2023-12-24 19:51:19,095 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-24 19:51:19,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-24 19:51:19,285 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 19:51:19,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 19:51:19,286 INFO L85 PathProgramCache]: Analyzing trace with hash 239637162, now seen corresponding path program 1 times [2023-12-24 19:51:19,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 19:51:19,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [941340043] [2023-12-24 19:51:19,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 19:51:19,286 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-24 19:51:19,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 19:51:19,287 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-24 19:51:19,289 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-24 19:51:19,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 19:51:19,465 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 19:51:19,468 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 19:51:19,485 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 19:51:19,485 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 19:51:19,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 19:51:19,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [941340043] [2023-12-24 19:51:19,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [941340043] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 19:51:19,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 19:51:19,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 19:51:19,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057238384] [2023-12-24 19:51:19,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 19:51:19,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 19:51:19,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 19:51:19,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 19:51:19,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 19:51:19,486 INFO L87 Difference]: Start difference. First operand 181 states and 248 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 19:51:19,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 19:51:19,588 INFO L93 Difference]: Finished difference Result 397 states and 543 transitions. [2023-12-24 19:51:19,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 19:51:19,588 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 146 [2023-12-24 19:51:19,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 19:51:19,589 INFO L225 Difference]: With dead ends: 397 [2023-12-24 19:51:19,589 INFO L226 Difference]: Without dead ends: 217 [2023-12-24 19:51:19,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-24 19:51:19,590 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 54 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 19:51:19,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 445 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 19:51:19,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2023-12-24 19:51:19,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 187. [2023-12-24 19:51:19,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 144 states have (on average 1.2083333333333333) internal successors, (174), 144 states have internal predecessors, (174), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-24 19:51:19,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 254 transitions. [2023-12-24 19:51:19,619 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 254 transitions. Word has length 146 [2023-12-24 19:51:19,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 19:51:19,619 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 254 transitions. [2023-12-24 19:51:19,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 19:51:19,619 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 254 transitions. [2023-12-24 19:51:19,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-24 19:51:19,620 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 19:51:19,620 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 19:51:19,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-24 19:51:19,826 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-24 19:51:19,826 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 19:51:19,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 19:51:19,827 INFO L85 PathProgramCache]: Analyzing trace with hash 387671265, now seen corresponding path program 1 times [2023-12-24 19:51:19,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 19:51:19,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1032108213] [2023-12-24 19:51:19,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 19:51:19,827 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-24 19:51:19,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 19:51:19,828 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-24 19:51:19,829 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-24 19:51:20,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 19:51:20,147 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-24 19:51:20,152 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 19:51:23,193 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-24 19:51:23,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2023-12-24 19:51:23,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2023-12-24 19:51:23,511 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 19:51:23,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 93 treesize of output 49 [2023-12-24 19:51:23,556 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 19:51:23,556 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 19:51:23,556 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 19:51:23,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1032108213] [2023-12-24 19:51:23,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1032108213] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 19:51:23,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 19:51:23,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-24 19:51:23,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013820543] [2023-12-24 19:51:23,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 19:51:23,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-24 19:51:23,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 19:51:23,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-24 19:51:23,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-24 19:51:23,558 INFO L87 Difference]: Start difference. First operand 187 states and 254 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 19:51:24,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 19:51:24,958 INFO L93 Difference]: Finished difference Result 342 states and 462 transitions. [2023-12-24 19:51:24,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 19:51:24,959 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 147 [2023-12-24 19:51:24,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 19:51:24,961 INFO L225 Difference]: With dead ends: 342 [2023-12-24 19:51:24,961 INFO L226 Difference]: Without dead ends: 244 [2023-12-24 19:51:24,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2023-12-24 19:51:24,961 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 222 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-24 19:51:24,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 437 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-24 19:51:24,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2023-12-24 19:51:24,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 95. [2023-12-24 19:51:24,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 73 states have internal predecessors, (89), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 19:51:24,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 129 transitions. [2023-12-24 19:51:24,985 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 129 transitions. Word has length 147 [2023-12-24 19:51:24,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 19:51:24,985 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 129 transitions. [2023-12-24 19:51:24,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 19:51:24,986 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 129 transitions. [2023-12-24 19:51:24,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-24 19:51:24,986 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 19:51:24,986 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 19:51:25,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-12-24 19:51:25,194 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-24 19:51:25,194 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 19:51:25,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 19:51:25,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1149423324, now seen corresponding path program 1 times [2023-12-24 19:51:25,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 19:51:25,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [18546266] [2023-12-24 19:51:25,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 19:51:25,195 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-24 19:51:25,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 19:51:25,196 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-24 19:51:25,202 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-24 19:51:25,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 19:51:25,505 INFO L262 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 19:51:25,519 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 19:51:25,534 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 19:51:25,535 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 33 treesize of output 29 [2023-12-24 19:51:25,559 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 19:51:25,559 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 19:51:25,560 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 19:51:25,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [18546266] [2023-12-24 19:51:25,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [18546266] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 19:51:25,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 19:51:25,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 19:51:25,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475601892] [2023-12-24 19:51:25,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 19:51:25,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 19:51:25,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 19:51:25,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 19:51:25,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 19:51:25,561 INFO L87 Difference]: Start difference. First operand 95 states and 129 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 19:51:25,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 19:51:25,613 INFO L93 Difference]: Finished difference Result 189 states and 257 transitions. [2023-12-24 19:51:25,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 19:51:25,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 148 [2023-12-24 19:51:25,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 19:51:25,615 INFO L225 Difference]: With dead ends: 189 [2023-12-24 19:51:25,615 INFO L226 Difference]: Without dead ends: 95 [2023-12-24 19:51:25,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 146 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-24 19:51:25,616 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 32 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 195 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-24 19:51:25,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 195 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 19:51:25,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-12-24 19:51:25,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2023-12-24 19:51:25,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 73 states have (on average 1.2054794520547945) internal successors, (88), 73 states have internal predecessors, (88), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 19:51:25,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 128 transitions. [2023-12-24 19:51:25,636 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 128 transitions. Word has length 148 [2023-12-24 19:51:25,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 19:51:25,636 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 128 transitions. [2023-12-24 19:51:25,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 19:51:25,636 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 128 transitions. [2023-12-24 19:51:25,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-24 19:51:25,637 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 19:51:25,637 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 19:51:25,643 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-24 19:51:25,839 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-24 19:51:25,840 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 19:51:25,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 19:51:25,840 INFO L85 PathProgramCache]: Analyzing trace with hash 379741251, now seen corresponding path program 1 times [2023-12-24 19:51:25,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 19:51:25,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1175895885] [2023-12-24 19:51:25,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 19:51:25,840 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-24 19:51:25,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 19:51:25,842 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-24 19:51:25,847 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-24 19:51:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 19:51:26,158 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-24 19:51:26,163 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 19:51:27,101 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-24 19:51:27,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-24 19:51:28,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-24 19:51:28,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-24 19:51:29,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2023-12-24 19:51:30,454 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 0 case distinctions, treesize of input 30 treesize of output 32 [2023-12-24 19:51:31,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2023-12-24 19:51:32,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 43 [2023-12-24 19:51:32,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 65 treesize of output 52 [2023-12-24 19:51:32,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 19:51:32,369 INFO L349 Elim1Store]: treesize reduction 142, result has 9.6 percent of original size [2023-12-24 19:51:32,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 22 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 157 [2023-12-24 19:51:32,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 19:51:32,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 19:51:32,408 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 19:51:32,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 19:51:32,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 19:51:32,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 25 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 52 [2023-12-24 19:51:32,907 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 148 treesize of output 116 [2023-12-24 19:51:32,966 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 19:51:32,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 7 case distinctions, treesize of input 1316 treesize of output 1138 [2023-12-24 19:51:34,182 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 431 proven. 180 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2023-12-24 19:51:34,183 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 19:51:44,545 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 19:51:44,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1175895885] [2023-12-24 19:51:44,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1175895885] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 19:51:44,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1149479957] [2023-12-24 19:51:44,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 19:51:44,545 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 19:51:44,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 19:51:44,546 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 19:51:44,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2023-12-24 19:51:45,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 19:51:45,180 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-24 19:51:45,185 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 19:51:46,413 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 12 treesize of output 8 [2023-12-24 19:51:47,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-12-24 19:51:47,690 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 0 case distinctions, treesize of input 29 treesize of output 31 [2023-12-24 19:51:48,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2023-12-24 19:51:49,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 53 [2023-12-24 19:51:51,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 64 [2023-12-24 19:51:52,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 75 [2023-12-24 19:51:54,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 91 [2023-12-24 19:51:54,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 97 treesize of output 76 [2023-12-24 19:51:54,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 19:51:54,829 INFO L349 Elim1Store]: treesize reduction 174, result has 7.9 percent of original size [2023-12-24 19:51:54,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 9 select indices, 9 select index equivalence classes, 56 disjoint index pairs (out of 36 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 102 treesize of output 213 [2023-12-24 19:51:54,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 19:51:54,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 19:51:54,962 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 19:51:54,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 19:51:54,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 19:51:54,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 19:51:54,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 60 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 79 [2023-12-24 19:51:55,864 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 222 treesize of output 174 [2023-12-24 19:51:55,998 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 19:51:55,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 12 select indices, 12 select index equivalence classes, 55 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 11 case distinctions, treesize of input 450 treesize of output 444 [2023-12-24 19:52:30,793 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 548 proven. 144 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-24 19:52:30,794 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 19:52:31,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1149479957] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 19:52:31,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 19:52:31,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2023-12-24 19:52:31,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101158157] [2023-12-24 19:52:31,331 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 19:52:31,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-24 19:52:31,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 19:52:31,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-24 19:52:31,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=904, Unknown=3, NotChecked=0, Total=1056 [2023-12-24 19:52:31,332 INFO L87 Difference]: Start difference. First operand 95 states and 128 transitions. Second operand has 28 states, 27 states have (on average 4.7407407407407405) internal successors, (128), 27 states have internal predecessors, (128), 14 states have call successors, (40), 13 states have call predecessors, (40), 14 states have return successors, (40), 13 states have call predecessors, (40), 14 states have call successors, (40) [2023-12-24 19:52:38,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 19:52:42,738 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-24 19:52:44,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 19:52:47,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.96s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 19:52:49,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 19:52:52,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.09s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 19:53:04,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 19:53:04,685 INFO L93 Difference]: Finished difference Result 509 states and 649 transitions. [2023-12-24 19:53:04,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-12-24 19:53:04,686 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 4.7407407407407405) internal successors, (128), 27 states have internal predecessors, (128), 14 states have call successors, (40), 13 states have call predecessors, (40), 14 states have return successors, (40), 13 states have call predecessors, (40), 14 states have call successors, (40) Word has length 150 [2023-12-24 19:53:04,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 19:53:04,687 INFO L225 Difference]: With dead ends: 509 [2023-12-24 19:53:04,687 INFO L226 Difference]: Without dead ends: 415 [2023-12-24 19:53:04,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 325 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2209 ImplicationChecksByTransitivity, 21.3s TimeCoverageRelationStatistics Valid=1369, Invalid=6110, Unknown=3, NotChecked=0, Total=7482 [2023-12-24 19:53:04,689 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 735 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 1779 mSolverCounterSat, 414 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 2194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 1779 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.0s IncrementalHoareTripleChecker+Time [2023-12-24 19:53:04,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 688 Invalid, 2194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 1779 Invalid, 1 Unknown, 0 Unchecked, 25.0s Time] [2023-12-24 19:53:04,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2023-12-24 19:53:04,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 326. [2023-12-24 19:53:04,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 256 states have (on average 1.16796875) internal successors, (299), 259 states have internal predecessors, (299), 58 states have call successors, (58), 11 states have call predecessors, (58), 11 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2023-12-24 19:53:04,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 415 transitions. [2023-12-24 19:53:04,755 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 415 transitions. Word has length 150 [2023-12-24 19:53:04,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 19:53:04,756 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 415 transitions. [2023-12-24 19:53:04,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 4.7407407407407405) internal successors, (128), 27 states have internal predecessors, (128), 14 states have call successors, (40), 13 states have call predecessors, (40), 14 states have return successors, (40), 13 states have call predecessors, (40), 14 states have call successors, (40) [2023-12-24 19:53:04,756 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 415 transitions. [2023-12-24 19:53:04,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-24 19:53:04,757 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 19:53:04,757 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 19:53:04,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Forceful destruction successful, exit code 0 [2023-12-24 19:53:04,972 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-24 19:53:05,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-24 19:53:05,173 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 19:53:05,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 19:53:05,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1490673915, now seen corresponding path program 1 times [2023-12-24 19:53:05,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 19:53:05,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2050012959] [2023-12-24 19:53:05,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 19:53:05,174 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-24 19:53:05,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 19:53:05,175 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-24 19:53:05,176 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-24 19:53:05,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 19:53:05,649 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-24 19:53:05,653 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 19:53:07,794 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-24 19:53:08,250 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-24 19:53:08,886 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 12 treesize of output 8 [2023-12-24 19:53:09,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-12-24 19:53:10,410 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 0 case distinctions, treesize of input 29 treesize of output 31 [2023-12-24 19:53:11,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 43 [2023-12-24 19:53:11,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 61 [2023-12-24 19:53:11,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2023-12-24 19:53:11,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 19:53:11,682 INFO L349 Elim1Store]: treesize reduction 148, result has 9.2 percent of original size [2023-12-24 19:53:11,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 29 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 7 case distinctions, treesize of input 80 treesize of output 165 [2023-12-24 19:53:11,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 19:53:11,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 19:53:11,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 63 [2023-12-24 19:53:11,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 19:53:11,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 19:53:11,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 65 [2023-12-24 19:53:13,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 19:53:13,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 28 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 248 treesize of output 196 [2023-12-24 19:53:17,565 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 284 proven. 144 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2023-12-24 19:53:17,565 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 19:53:19,654 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 19:53:19,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2050012959] [2023-12-24 19:53:19,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2050012959] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 19:53:19,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1067587720] [2023-12-24 19:53:19,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 19:53:19,655 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 19:53:19,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 19:53:19,656 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 19:53:19,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2023-12-24 19:53:20,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 19:53:20,657 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-24 19:53:20,660 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 19:53:24,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 44 [2023-12-24 19:53:24,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 41 [2023-12-24 19:53:24,751 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 19:53:24,751 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 19:53:24,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1067587720] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 19:53:24,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 19:53:24,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2023-12-24 19:53:24,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436612695] [2023-12-24 19:53:24,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 19:53:24,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 19:53:24,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 19:53:24,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 19:53:24,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=191, Unknown=2, NotChecked=0, Total=240 [2023-12-24 19:53:24,752 INFO L87 Difference]: Start difference. First operand 326 states and 415 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 19:53:25,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 19:53:25,553 INFO L93 Difference]: Finished difference Result 341 states and 433 transitions. [2023-12-24 19:53:25,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 19:53:25,555 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2023-12-24 19:53:25,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 19:53:25,557 INFO L225 Difference]: With dead ends: 341 [2023-12-24 19:53:25,557 INFO L226 Difference]: Without dead ends: 339 [2023-12-24 19:53:25,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=73, Invalid=267, Unknown=2, NotChecked=0, Total=342 [2023-12-24 19:53:25,558 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 75 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-24 19:53:25,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 272 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-24 19:53:25,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2023-12-24 19:53:25,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 334. [2023-12-24 19:53:25,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 264 states have (on average 1.1628787878787878) internal successors, (307), 267 states have internal predecessors, (307), 58 states have call successors, (58), 11 states have call predecessors, (58), 11 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2023-12-24 19:53:25,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 423 transitions. [2023-12-24 19:53:25,641 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 423 transitions. Word has length 150 [2023-12-24 19:53:25,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 19:53:25,642 INFO L495 AbstractCegarLoop]: Abstraction has 334 states and 423 transitions. [2023-12-24 19:53:25,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 19:53:25,642 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 423 transitions. [2023-12-24 19:53:25,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-24 19:53:25,642 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 19:53:25,643 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 19:53:25,658 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-24 19:53:25,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Forceful destruction successful, exit code 0 [2023-12-24 19:53:26,058 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,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 19:53:26,059 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 19:53:26,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 19:53:26,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1490614333, now seen corresponding path program 1 times [2023-12-24 19:53:26,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 19:53:26,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1507730579] [2023-12-24 19:53:26,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 19:53:26,060 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-24 19:53:26,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 19:53:26,069 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-24 19:53:26,093 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-24 19:53:26,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 19:53:26,546 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-24 19:53:26,551 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 19:53:26,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-12-24 19:53:27,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-12-24 19:53:27,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-12-24 19:53:28,050 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 0 case distinctions, treesize of input 32 treesize of output 23 [2023-12-24 19:53:28,532 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 0 case distinctions, treesize of input 32 treesize of output 23 [2023-12-24 19:53:28,996 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 0 case distinctions, treesize of input 29 treesize of output 31 [2023-12-24 19:53:29,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2023-12-24 19:53:30,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 53 [2023-12-24 19:53:31,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 64 [2023-12-24 19:53:32,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 76 [2023-12-24 19:53:32,301 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 19:53:32,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 87 [2023-12-24 19:53:32,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2023-12-24 19:53:32,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 45 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 98 [2023-12-24 19:53:32,857 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 19:53:32,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 117 treesize of output 65 [2023-12-24 19:53:32,900 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 500 proven. 144 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2023-12-24 19:53:32,900 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 19:53:34,397 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 19:53:34,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1507730579] [2023-12-24 19:53:34,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1507730579] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 19:53:34,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1106909260] [2023-12-24 19:53:34,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 19:53:34,398 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 19:53:34,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 19:53:34,399 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 19:53:34,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2023-12-24 19:53:34,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 19:53:34,997 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-24 19:53:35,003 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 19:53:35,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-12-24 19:53:35,806 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 0 case distinctions, treesize of input 32 treesize of output 23 [2023-12-24 19:53:36,353 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 0 case distinctions, treesize of input 32 treesize of output 23 [2023-12-24 19:53:36,887 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 0 case distinctions, treesize of input 32 treesize of output 23 [2023-12-24 19:53:37,487 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 0 case distinctions, treesize of input 29 treesize of output 31 [2023-12-24 19:53:38,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2023-12-24 19:53:39,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 53 [2023-12-24 19:53:40,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 64 [2023-12-24 19:53:41,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 67 [2023-12-24 19:53:42,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 76 [2023-12-24 19:53:42,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 45 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 98 [2023-12-24 19:53:43,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 64 [2023-12-24 19:53:43,362 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 468 proven. 144 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2023-12-24 19:53:43,362 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 19:53:44,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1106909260] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 19:53:44,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 19:53:44,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2023-12-24 19:53:44,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568934287] [2023-12-24 19:53:44,087 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 19:53:44,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-24 19:53:44,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 19:53:44,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-24 19:53:44,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=438, Unknown=5, NotChecked=0, Total=552 [2023-12-24 19:53:44,088 INFO L87 Difference]: Start difference. First operand 334 states and 423 transitions. Second operand has 21 states, 21 states have (on average 6.238095238095238) internal successors, (131), 20 states have internal predecessors, (131), 12 states have call successors, (40), 12 states have call predecessors, (40), 12 states have return successors, (40), 12 states have call predecessors, (40), 12 states have call successors, (40) [2023-12-24 19:53:51,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 19:53:51,167 INFO L93 Difference]: Finished difference Result 827 states and 1054 transitions. [2023-12-24 19:53:51,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 19:53:51,169 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.238095238095238) internal successors, (131), 20 states have internal predecessors, (131), 12 states have call successors, (40), 12 states have call predecessors, (40), 12 states have return successors, (40), 12 states have call predecessors, (40), 12 states have call successors, (40) Word has length 150 [2023-12-24 19:53:51,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 19:53:51,172 INFO L225 Difference]: With dead ends: 827 [2023-12-24 19:53:51,172 INFO L226 Difference]: Without dead ends: 494 [2023-12-24 19:53:51,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 335 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=203, Invalid=548, Unknown=5, NotChecked=0, Total=756 [2023-12-24 19:53:51,175 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 505 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 456 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 456 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2023-12-24 19:53:51,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 869 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [456 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2023-12-24 19:53:51,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2023-12-24 19:53:51,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 423. [2023-12-24 19:53:51,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 330 states have (on average 1.1515151515151516) internal successors, (380), 333 states have internal predecessors, (380), 78 states have call successors, (78), 14 states have call predecessors, (78), 14 states have return successors, (78), 75 states have call predecessors, (78), 78 states have call successors, (78) [2023-12-24 19:53:51,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 536 transitions. [2023-12-24 19:53:51,294 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 536 transitions. Word has length 150 [2023-12-24 19:53:51,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 19:53:51,294 INFO L495 AbstractCegarLoop]: Abstraction has 423 states and 536 transitions. [2023-12-24 19:53:51,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.238095238095238) internal successors, (131), 20 states have internal predecessors, (131), 12 states have call successors, (40), 12 states have call predecessors, (40), 12 states have return successors, (40), 12 states have call predecessors, (40), 12 states have call successors, (40) [2023-12-24 19:53:51,294 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 536 transitions. [2023-12-24 19:53:51,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-24 19:53:51,295 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 19:53:51,295 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 19:53:51,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2023-12-24 19:53:51,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2023-12-24 19:53:51,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-24 19:53:51,702 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 19:53:51,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 19:53:51,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1433356031, now seen corresponding path program 1 times [2023-12-24 19:53:51,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 19:53:51,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [37562883] [2023-12-24 19:53:51,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 19:53:51,703 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-24 19:53:51,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 19:53:51,705 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 19:53:51,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-12-24 19:53:52,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 19:53:52,250 INFO L262 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-24 19:53:52,254 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 19:53:54,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 26 [2023-12-24 19:53:54,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 19:53:54,199 INFO L349 Elim1Store]: treesize reduction 110, result has 12.0 percent of original size [2023-12-24 19:53:54,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 100 [2023-12-24 19:53:54,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 19:53:54,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 26 [2023-12-24 19:53:54,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 19:53:54,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 19:53:54,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 1 [2023-12-24 19:53:54,619 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 19:53:54,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 69 [2023-12-24 19:53:54,670 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 19:53:54,670 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 19:53:54,670 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 19:53:54,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [37562883] [2023-12-24 19:53:54,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [37562883] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 19:53:54,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 19:53:54,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 19:53:54,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518495739] [2023-12-24 19:53:54,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 19:53:54,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 19:53:54,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 19:53:54,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 19:53:54,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-24 19:53:54,672 INFO L87 Difference]: Start difference. First operand 423 states and 536 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 19:53:55,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 19:53:55,483 INFO L93 Difference]: Finished difference Result 850 states and 1076 transitions. [2023-12-24 19:53:55,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 19:53:55,484 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2023-12-24 19:53:55,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 19:53:55,488 INFO L225 Difference]: With dead ends: 850 [2023-12-24 19:53:55,488 INFO L226 Difference]: Without dead ends: 428 [2023-12-24 19:53:55,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-24 19:53:55,490 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 83 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-24 19:53:55,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 274 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-24 19:53:55,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2023-12-24 19:53:55,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 423. [2023-12-24 19:53:55,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 330 states have (on average 1.1363636363636365) internal successors, (375), 333 states have internal predecessors, (375), 78 states have call successors, (78), 14 states have call predecessors, (78), 14 states have return successors, (78), 75 states have call predecessors, (78), 78 states have call successors, (78) [2023-12-24 19:53:55,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 531 transitions. [2023-12-24 19:53:55,602 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 531 transitions. Word has length 150 [2023-12-24 19:53:55,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 19:53:55,603 INFO L495 AbstractCegarLoop]: Abstraction has 423 states and 531 transitions. [2023-12-24 19:53:55,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 19:53:55,603 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 531 transitions. [2023-12-24 19:53:55,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-24 19:53:55,604 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 19:53:55,604 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 19:53:55,615 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 (21)] Forceful destruction successful, exit code 0 [2023-12-24 19:53:55,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 19:53:55,813 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 19:53:55,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 19:53:55,814 INFO L85 PathProgramCache]: Analyzing trace with hash 2052264639, now seen corresponding path program 1 times [2023-12-24 19:53:55,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 19:53:55,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [962964169] [2023-12-24 19:53:55,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 19:53:55,814 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-24 19:53:55,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 19:53:55,815 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 19:53:55,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-12-24 19:53:56,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 19:53:56,052 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 19:53:56,054 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 19:53:56,070 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 19:53:56,071 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 19:53:56,071 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 19:53:56,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [962964169] [2023-12-24 19:53:56,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [962964169] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 19:53:56,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 19:53:56,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 19:53:56,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220914320] [2023-12-24 19:53:56,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 19:53:56,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 19:53:56,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 19:53:56,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 19:53:56,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 19:53:56,073 INFO L87 Difference]: Start difference. First operand 423 states and 531 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 19:53:56,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 19:53:56,270 INFO L93 Difference]: Finished difference Result 889 states and 1114 transitions. [2023-12-24 19:53:56,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 19:53:56,270 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2023-12-24 19:53:56,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 19:53:56,272 INFO L225 Difference]: With dead ends: 889 [2023-12-24 19:53:56,272 INFO L226 Difference]: Without dead ends: 467 [2023-12-24 19:53:56,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-24 19:53:56,273 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 20 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 19:53:56,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 437 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 19:53:56,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2023-12-24 19:53:56,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 438. [2023-12-24 19:53:56,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 345 states have (on average 1.1304347826086956) internal successors, (390), 348 states have internal predecessors, (390), 78 states have call successors, (78), 14 states have call predecessors, (78), 14 states have return successors, (78), 75 states have call predecessors, (78), 78 states have call successors, (78) [2023-12-24 19:53:56,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 546 transitions. [2023-12-24 19:53:56,377 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 546 transitions. Word has length 150 [2023-12-24 19:53:56,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 19:53:56,377 INFO L495 AbstractCegarLoop]: Abstraction has 438 states and 546 transitions. [2023-12-24 19:53:56,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 19:53:56,377 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 546 transitions. [2023-12-24 19:53:56,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-24 19:53:56,378 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 19:53:56,378 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 19:53:56,386 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 (22)] Ended with exit code 0 [2023-12-24 19:53:56,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 19:53:56,586 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 19:53:56,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 19:53:56,586 INFO L85 PathProgramCache]: Analyzing trace with hash 2061803016, now seen corresponding path program 1 times [2023-12-24 19:53:56,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 19:53:56,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1945786752] [2023-12-24 19:53:56,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 19:53:56,586 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-24 19:53:56,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 19:53:56,588 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 19:53:56,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-12-24 19:53:57,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 19:53:57,043 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 40 conjunts are in the unsatisfiable core [2023-12-24 19:53:57,053 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 19:53:59,398 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-24 19:53:59,925 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 12 treesize of output 8 [2023-12-24 19:54:00,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-12-24 19:54:01,785 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 0 case distinctions, treesize of input 32 treesize of output 23 [2023-12-24 19:54:02,406 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 0 case distinctions, treesize of input 32 treesize of output 23 [2023-12-24 19:54:02,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 39 [2023-12-24 19:54:03,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 51 [2023-12-24 19:54:03,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 28 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 73 [2023-12-24 19:54:03,683 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 19:54:03,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 104 treesize of output 56 [2023-12-24 19:54:03,773 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 380 proven. 144 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2023-12-24 19:54:03,773 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 19:54:26,940 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 19:54:26,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1945786752] [2023-12-24 19:54:26,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1945786752] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 19:54:26,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [983843642] [2023-12-24 19:54:26,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 19:54:26,941 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 19:54:26,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 19:54:26,941 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 19:54:26,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2023-12-24 19:54:28,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 19:54:28,046 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 45 conjunts are in the unsatisfiable core [2023-12-24 19:54:28,050 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 19:54:36,808 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 12 treesize of output 8 [2023-12-24 19:54:39,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-12-24 19:54:43,470 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 0 case distinctions, treesize of input 29 treesize of output 31 [2023-12-24 19:54:47,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2023-12-24 19:54:51,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2023-12-24 19:54:54,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 54 [2023-12-24 19:54:56,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 67 [2023-12-24 19:54:56,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 36 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 99 [2023-12-24 19:54:58,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 72 [2023-12-24 19:54:58,856 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 444 proven. 144 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2023-12-24 19:54:58,856 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 19:55:23,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [983843642] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 19:55:23,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 19:55:23,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 20 [2023-12-24 19:55:23,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451612399] [2023-12-24 19:55:23,925 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 19:55:23,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-24 19:55:23,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 19:55:23,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-24 19:55:23,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=731, Unknown=14, NotChecked=0, Total=870 [2023-12-24 19:55:23,926 INFO L87 Difference]: Start difference. First operand 438 states and 546 transitions. Second operand has 21 states, 21 states have (on average 5.523809523809524) internal successors, (116), 20 states have internal predecessors, (116), 9 states have call successors, (40), 9 states have call predecessors, (40), 9 states have return successors, (40), 9 states have call predecessors, (40), 9 states have call successors, (40) [2023-12-24 19:55:57,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 19:55:57,111 INFO L93 Difference]: Finished difference Result 922 states and 1138 transitions. [2023-12-24 19:55:57,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-24 19:55:57,112 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.523809523809524) internal successors, (116), 20 states have internal predecessors, (116), 9 states have call successors, (40), 9 states have call predecessors, (40), 9 states have return successors, (40), 9 states have call predecessors, (40), 9 states have call successors, (40) Word has length 151 [2023-12-24 19:55:57,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 19:55:57,114 INFO L225 Difference]: With dead ends: 922 [2023-12-24 19:55:57,114 INFO L226 Difference]: Without dead ends: 577 [2023-12-24 19:55:57,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 62.2s TimeCoverageRelationStatistics Valid=567, Invalid=1675, Unknown=14, NotChecked=0, Total=2256 [2023-12-24 19:55:57,116 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 803 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 1538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.2s IncrementalHoareTripleChecker+Time [2023-12-24 19:55:57,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [803 Valid, 742 Invalid, 1538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 1227 Invalid, 0 Unknown, 0 Unchecked, 22.2s Time] [2023-12-24 19:55:57,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2023-12-24 19:55:57,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 468. [2023-12-24 19:55:57,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 365 states have (on average 1.1232876712328768) internal successors, (410), 368 states have internal predecessors, (410), 84 states have call successors, (84), 18 states have call predecessors, (84), 18 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2023-12-24 19:55:57,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 578 transitions. [2023-12-24 19:55:57,245 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 578 transitions. Word has length 151 [2023-12-24 19:55:57,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 19:55:57,246 INFO L495 AbstractCegarLoop]: Abstraction has 468 states and 578 transitions. [2023-12-24 19:55:57,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.523809523809524) internal successors, (116), 20 states have internal predecessors, (116), 9 states have call successors, (40), 9 states have call predecessors, (40), 9 states have return successors, (40), 9 states have call predecessors, (40), 9 states have call successors, (40) [2023-12-24 19:55:57,246 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 578 transitions. [2023-12-24 19:55:57,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-24 19:55:57,247 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 19:55:57,247 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 19:55:57,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Forceful destruction successful, exit code 0 [2023-12-24 19:55:57,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2023-12-24 19:55:57,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 19:55:57,664 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 19:55:57,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 19:55:57,664 INFO L85 PathProgramCache]: Analyzing trace with hash 191447432, now seen corresponding path program 1 times [2023-12-24 19:55:57,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 19:55:57,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [504963968] [2023-12-24 19:55:57,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 19:55:57,665 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-24 19:55:57,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 19:55:57,666 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 19:55:57,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-12-24 19:55:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 19:55:58,094 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-24 19:55:58,100 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 19:56:04,662 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-24 19:56:09,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2023-12-24 19:56:13,199 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 0 case distinctions, treesize of input 33 treesize of output 24 [2023-12-24 19:56:16,729 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 0 case distinctions, treesize of input 30 treesize of output 32 [2023-12-24 19:56:22,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 43 [2023-12-24 19:56:29,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2023-12-24 19:56:34,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 65 [2023-12-24 19:56:40,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 73 [2023-12-24 19:56:43,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 82 [2023-12-24 19:56:43,963 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 19:56:43,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 55 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 96 treesize of output 111 [2023-12-24 19:56:45,437 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 19:56:45,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 99 treesize of output 51 [2023-12-24 19:56:45,752 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 479 proven. 180 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2023-12-24 19:56:45,752 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 19:56:54,958 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 19:56:54,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [504963968] [2023-12-24 19:56:54,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [504963968] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 19:56:54,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1676443715] [2023-12-24 19:56:54,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 19:56:54,958 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 19:56:54,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 19:56:54,960 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 19:56:54,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2023-12-24 19:56:55,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 19:56:55,664 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 40 conjunts are in the unsatisfiable core [2023-12-24 19:56:55,669 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 19:57:03,298 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 12 treesize of output 8 [2023-12-24 19:57:07,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-12-24 19:57:10,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-12-24 19:57:14,755 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 0 case distinctions, treesize of input 32 treesize of output 23 [2023-12-24 19:57:20,129 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 0 case distinctions, treesize of input 29 treesize of output 31 [2023-12-24 19:57:26,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2023-12-24 19:57:30,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2023-12-24 19:57:36,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2023-12-24 19:57:38,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2023-12-24 19:57:39,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 28 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 72 [2023-12-24 19:57:40,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 33 [2023-12-24 19:57:41,050 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 484 proven. 144 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2023-12-24 19:57:41,050 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 19:57:44,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1676443715] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 19:57:44,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 19:57:44,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 26 [2023-12-24 19:57:44,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017908052] [2023-12-24 19:57:44,754 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 19:57:44,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-24 19:57:44,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 19:57:44,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-24 19:57:44,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=917, Unknown=1, NotChecked=0, Total=1056 [2023-12-24 19:57:44,755 INFO L87 Difference]: Start difference. First operand 468 states and 578 transitions. Second operand has 27 states, 26 states have (on average 4.769230769230769) internal successors, (124), 25 states have internal predecessors, (124), 12 states have call successors, (40), 11 states have call predecessors, (40), 12 states have return successors, (40), 12 states have call predecessors, (40), 12 states have call successors, (40) [2023-12-24 19:58:42,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 19:58:42,936 INFO L93 Difference]: Finished difference Result 942 states and 1132 transitions. [2023-12-24 19:58:42,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-12-24 19:58:42,937 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.769230769230769) internal successors, (124), 25 states have internal predecessors, (124), 12 states have call successors, (40), 11 states have call predecessors, (40), 12 states have return successors, (40), 12 states have call predecessors, (40), 12 states have call successors, (40) Word has length 151 [2023-12-24 19:58:42,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 19:58:42,939 INFO L225 Difference]: With dead ends: 942 [2023-12-24 19:58:42,939 INFO L226 Difference]: Without dead ends: 567 [2023-12-24 19:58:42,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 328 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1852 ImplicationChecksByTransitivity, 50.6s TimeCoverageRelationStatistics Valid=1117, Invalid=5044, Unknown=1, NotChecked=0, Total=6162 [2023-12-24 19:58:42,941 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 725 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 2070 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 2312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 2070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.3s IncrementalHoareTripleChecker+Time [2023-12-24 19:58:42,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 823 Invalid, 2312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 2070 Invalid, 0 Unknown, 0 Unchecked, 31.3s Time] [2023-12-24 19:58:42,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2023-12-24 19:58:43,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 476. [2023-12-24 19:58:43,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 376 states have (on average 1.1143617021276595) internal successors, (419), 379 states have internal predecessors, (419), 74 states have call successors, (74), 25 states have call predecessors, (74), 25 states have return successors, (74), 71 states have call predecessors, (74), 74 states have call successors, (74) [2023-12-24 19:58:43,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 567 transitions. [2023-12-24 19:58:43,081 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 567 transitions. Word has length 151 [2023-12-24 19:58:43,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 19:58:43,081 INFO L495 AbstractCegarLoop]: Abstraction has 476 states and 567 transitions. [2023-12-24 19:58:43,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.769230769230769) internal successors, (124), 25 states have internal predecessors, (124), 12 states have call successors, (40), 11 states have call predecessors, (40), 12 states have return successors, (40), 12 states have call predecessors, (40), 12 states have call successors, (40) [2023-12-24 19:58:43,082 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 567 transitions. [2023-12-24 19:58:43,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-24 19:58:43,082 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 19:58:43,082 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 19:58:43,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Forceful destruction successful, exit code 0 [2023-12-24 19:58:43,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2023-12-24 19:58:43,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 19:58:43,485 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 19:58:43,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 19:58:43,485 INFO L85 PathProgramCache]: Analyzing trace with hash -322513126, now seen corresponding path program 1 times [2023-12-24 19:58:43,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 19:58:43,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1649526740] [2023-12-24 19:58:43,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 19:58:43,485 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-24 19:58:43,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 19:58:43,487 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 19:58:43,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-12-24 19:58:43,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 19:58:43,985 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 48 conjunts are in the unsatisfiable core [2023-12-24 19:58:43,989 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 19:59:01,289 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-24 19:59:07,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2023-12-24 19:59:15,064 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 0 case distinctions, treesize of input 30 treesize of output 32 [2023-12-24 19:59:22,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2023-12-24 19:59:27,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 43 [2023-12-24 19:59:46,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 15 disjoint index pairs (out of 28 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 80 [2023-12-24 19:59:51,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 36 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 102 [2023-12-24 19:59:58,545 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 19:59:58,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 129 treesize of output 69 [2023-12-24 20:00:05,681 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 383 proven. 168 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2023-12-24 20:00:05,681 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:00:41,878 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-12-24 20:00:41,879 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:00:41,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1649526740] [2023-12-24 20:00:41,879 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-12-24 20:00:41,882 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 101 [2023-12-24 20:00:41,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2023-12-24 20:00:42,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:00:42,080 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:915) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:789) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:377) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:326) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:579) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 45 more [2023-12-24 20:00:42,084 INFO L158 Benchmark]: Toolchain (without parser) took 601815.79ms. Allocated memory was 201.3MB in the beginning and 669.0MB in the end (delta: 467.7MB). Free memory was 151.3MB in the beginning and 242.2MB in the end (delta: -90.9MB). Peak memory consumption was 377.5MB. Max. memory is 8.0GB. [2023-12-24 20:00:42,084 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 201.3MB. Free memory is still 154.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 20:00:42,084 INFO L158 Benchmark]: CACSL2BoogieTranslator took 274.34ms. Allocated memory is still 201.3MB. Free memory was 151.3MB in the beginning and 134.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-24 20:00:42,084 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.74ms. Allocated memory is still 201.3MB. Free memory was 134.5MB in the beginning and 131.1MB in the end (delta: 3.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-24 20:00:42,084 INFO L158 Benchmark]: Boogie Preprocessor took 47.40ms. Allocated memory is still 201.3MB. Free memory was 131.1MB in the beginning and 126.5MB in the end (delta: 4.6MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-24 20:00:42,084 INFO L158 Benchmark]: RCFGBuilder took 726.16ms. Allocated memory is still 201.3MB. Free memory was 126.5MB in the beginning and 148.5MB in the end (delta: -22.0MB). Peak memory consumption was 25.1MB. Max. memory is 8.0GB. [2023-12-24 20:00:42,084 INFO L158 Benchmark]: TraceAbstraction took 600704.19ms. Allocated memory was 201.3MB in the beginning and 669.0MB in the end (delta: 467.7MB). Free memory was 147.9MB in the beginning and 242.2MB in the end (delta: -94.3MB). Peak memory consumption was 373.4MB. Max. memory is 8.0GB. [2023-12-24 20:00:42,085 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.44ms. Allocated memory is still 201.3MB. Free memory is still 154.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 274.34ms. Allocated memory is still 201.3MB. Free memory was 151.3MB in the beginning and 134.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.74ms. Allocated memory is still 201.3MB. Free memory was 134.5MB in the beginning and 131.1MB in the end (delta: 3.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.40ms. Allocated memory is still 201.3MB. Free memory was 131.1MB in the beginning and 126.5MB in the end (delta: 4.6MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 726.16ms. Allocated memory is still 201.3MB. Free memory was 126.5MB in the beginning and 148.5MB in the end (delta: -22.0MB). Peak memory consumption was 25.1MB. Max. memory is 8.0GB. * TraceAbstraction took 600704.19ms. Allocated memory was 201.3MB in the beginning and 669.0MB in the end (delta: 467.7MB). Free memory was 147.9MB in the beginning and 242.2MB in the end (delta: -94.3MB). Peak memory consumption was 373.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...