/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/recursified_loop-simple/recursified_nested_2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 06:36:37,717 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 06:36:37,783 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-25 06:36:37,788 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 06:36:37,788 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 06:36:37,810 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 06:36:37,811 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 06:36:37,811 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 06:36:37,811 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 06:36:37,814 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 06:36:37,814 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 06:36:37,815 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 06:36:37,815 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 06:36:37,816 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 06:36:37,816 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 06:36:37,817 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 06:36:37,817 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 06:36:37,817 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 06:36:37,817 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 06:36:37,817 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 06:36:37,817 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 06:36:37,818 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 06:36:37,818 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 06:36:37,818 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 06:36:37,818 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 06:36:37,818 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 06:36:37,819 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 06:36:37,819 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 06:36:37,819 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 06:36:37,819 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 06:36:37,820 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 06:36:37,820 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 06:36:37,820 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 06:36:37,820 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 06:36:37,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 06:36:37,821 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 06:36:37,821 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 06:36:37,821 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 06:36:37,821 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 06:36:37,821 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 06:36:37,821 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 06:36:37,821 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 06:36:37,821 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 06:36:37,822 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 06:36:37,822 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 06:36:37,822 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 06:36:37,822 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-25 06:36:37,985 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 06:36:37,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 06:36:38,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 06:36:38,000 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 06:36:38,001 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 06:36:38,001 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursified_loop-simple/recursified_nested_2.c [2023-12-25 06:36:39,146 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 06:36:39,298 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 06:36:39,298 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursified_loop-simple/recursified_nested_2.c [2023-12-25 06:36:39,303 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c66006f2a/2b8d49ad4ee54fc5aa745b161e6ded2b/FLAGfbd3fb4ee [2023-12-25 06:36:39,313 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c66006f2a/2b8d49ad4ee54fc5aa745b161e6ded2b [2023-12-25 06:36:39,315 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 06:36:39,316 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 06:36:39,317 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 06:36:39,317 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 06:36:39,320 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 06:36:39,321 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 06:36:39" (1/1) ... [2023-12-25 06:36:39,321 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@143d9302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:36:39, skipping insertion in model container [2023-12-25 06:36:39,322 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 06:36:39" (1/1) ... [2023-12-25 06:36:39,336 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 06:36:39,445 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursified_loop-simple/recursified_nested_2.c[1611,1624] [2023-12-25 06:36:39,448 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 06:36:39,455 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 06:36:39,470 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursified_loop-simple/recursified_nested_2.c[1611,1624] [2023-12-25 06:36:39,471 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 06:36:39,485 INFO L206 MainTranslator]: Completed translation [2023-12-25 06:36:39,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:36:39 WrapperNode [2023-12-25 06:36:39,486 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 06:36:39,487 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 06:36:39,487 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 06:36:39,487 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 06:36:39,492 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:36:39" (1/1) ... [2023-12-25 06:36:39,496 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:36:39" (1/1) ... [2023-12-25 06:36:39,507 INFO L138 Inliner]: procedures = 16, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 38 [2023-12-25 06:36:39,507 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 06:36:39,508 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 06:36:39,508 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 06:36:39,508 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 06:36:39,514 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:36:39" (1/1) ... [2023-12-25 06:36:39,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:36:39" (1/1) ... [2023-12-25 06:36:39,516 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:36:39" (1/1) ... [2023-12-25 06:36:39,525 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 6, 6]. 43 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 1, 1]. The 4 writes are split as follows [0, 2, 2]. [2023-12-25 06:36:39,525 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:36:39" (1/1) ... [2023-12-25 06:36:39,525 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:36:39" (1/1) ... [2023-12-25 06:36:39,529 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:36:39" (1/1) ... [2023-12-25 06:36:39,530 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:36:39" (1/1) ... [2023-12-25 06:36:39,531 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:36:39" (1/1) ... [2023-12-25 06:36:39,532 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:36:39" (1/1) ... [2023-12-25 06:36:39,533 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 06:36:39,534 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 06:36:39,534 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 06:36:39,534 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 06:36:39,535 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:36:39" (1/1) ... [2023-12-25 06:36:39,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 06:36:39,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 06:36:39,562 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-25 06:36:39,577 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-25 06:36:39,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 06:36:39,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 06:36:39,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-25 06:36:39,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-25 06:36:39,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2023-12-25 06:36:39,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2023-12-25 06:36:39,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2023-12-25 06:36:39,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-25 06:36:39,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-25 06:36:39,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-25 06:36:39,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-25 06:36:39,583 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_20_to_21_0 [2023-12-25 06:36:39,583 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_20_to_21_0 [2023-12-25 06:36:39,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 06:36:39,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 06:36:39,584 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_21_to_21_0 [2023-12-25 06:36:39,584 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_21_to_21_0 [2023-12-25 06:36:39,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-25 06:36:39,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-25 06:36:39,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-25 06:36:39,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-25 06:36:39,658 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 06:36:39,659 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 06:36:39,813 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 06:36:39,834 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 06:36:39,834 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-25 06:36:39,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 06:36:39 BoogieIcfgContainer [2023-12-25 06:36:39,834 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 06:36:39,836 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 06:36:39,836 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 06:36:39,838 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 06:36:39,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 06:36:39" (1/3) ... [2023-12-25 06:36:39,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a02ba9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 06:36:39, skipping insertion in model container [2023-12-25 06:36:39,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:36:39" (2/3) ... [2023-12-25 06:36:39,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a02ba9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 06:36:39, skipping insertion in model container [2023-12-25 06:36:39,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 06:36:39" (3/3) ... [2023-12-25 06:36:39,840 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_nested_2.c [2023-12-25 06:36:39,853 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 06:36:39,854 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 06:36:39,891 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 06:36:39,896 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;@26b7458e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 06:36:39,896 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 06:36:39,900 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 16 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 06:36:39,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-25 06:36:39,907 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:36:39,908 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:36:39,908 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:36:39,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:36:39,913 INFO L85 PathProgramCache]: Analyzing trace with hash 855928239, now seen corresponding path program 1 times [2023-12-25 06:36:39,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:36:39,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1300340137] [2023-12-25 06:36:39,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:36:39,922 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-25 06:36:39,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:36:39,925 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-25 06:36:39,971 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-25 06:36:40,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:36:40,003 INFO L262 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 06:36:40,007 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:36:40,054 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 11 treesize of output 7 [2023-12-25 06:36:40,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 06:36:40,161 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 06:36:40,162 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:36:40,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1300340137] [2023-12-25 06:36:40,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1300340137] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 06:36:40,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 06:36:40,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 06:36:40,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578579543] [2023-12-25 06:36:40,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 06:36:40,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 06:36:40,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:36:40,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 06:36:40,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 06:36:40,194 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 16 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 06:36:40,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:36:40,293 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2023-12-25 06:36:40,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 06:36:40,295 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2023-12-25 06:36:40,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:36:40,300 INFO L225 Difference]: With dead ends: 30 [2023-12-25 06:36:40,300 INFO L226 Difference]: Without dead ends: 21 [2023-12-25 06:36:40,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 06:36:40,304 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:36:40,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 26 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:36:40,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-25 06:36:40,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-12-25 06:36:40,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 15 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-25 06:36:40,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2023-12-25 06:36:40,329 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 10 [2023-12-25 06:36:40,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:36:40,329 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-12-25 06:36:40,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 06:36:40,330 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2023-12-25 06:36:40,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-25 06:36:40,331 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:36:40,331 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:36:40,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-25 06:36:40,533 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-25 06:36:40,534 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:36:40,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:36:40,534 INFO L85 PathProgramCache]: Analyzing trace with hash 255373073, now seen corresponding path program 1 times [2023-12-25 06:36:40,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:36:40,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [84360798] [2023-12-25 06:36:40,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:36:40,535 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-25 06:36:40,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:36:40,538 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-25 06:36:40,547 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-25 06:36:40,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:36:40,605 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 06:36:40,608 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:36:40,616 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 11 treesize of output 7 [2023-12-25 06:36:40,678 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 06:36:40,679 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 06:36:40,679 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:36:40,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [84360798] [2023-12-25 06:36:40,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [84360798] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 06:36:40,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 06:36:40,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-25 06:36:40,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529532273] [2023-12-25 06:36:40,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 06:36:40,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 06:36:40,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:36:40,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 06:36:40,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 06:36:40,683 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-25 06:36:40,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:36:40,744 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2023-12-25 06:36:40,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 06:36:40,744 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) Word has length 21 [2023-12-25 06:36:40,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:36:40,745 INFO L225 Difference]: With dead ends: 42 [2023-12-25 06:36:40,745 INFO L226 Difference]: Without dead ends: 23 [2023-12-25 06:36:40,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 06:36:40,749 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 3 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 06:36:40,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 53 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 06:36:40,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-25 06:36:40,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-12-25 06:36:40,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-25 06:36:40,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2023-12-25 06:36:40,761 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 21 [2023-12-25 06:36:40,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:36:40,761 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2023-12-25 06:36:40,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-25 06:36:40,762 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2023-12-25 06:36:40,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-25 06:36:40,763 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:36:40,763 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:36:40,780 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-25 06:36:40,966 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-25 06:36:40,967 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:36:40,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:36:40,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1037516303, now seen corresponding path program 1 times [2023-12-25 06:36:40,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:36:40,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [672701190] [2023-12-25 06:36:40,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:36:40,968 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-25 06:36:40,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:36:40,970 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-25 06:36:41,014 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-25 06:36:41,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:36:41,050 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-25 06:36:41,052 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:36:41,056 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 11 treesize of output 7 [2023-12-25 06:36:41,074 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 11 treesize of output 7 [2023-12-25 06:36:41,256 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-25 06:36:41,256 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:36:41,856 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 06:36:41,857 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:36:41,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [672701190] [2023-12-25 06:36:41,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [672701190] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:36:41,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:36:41,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2023-12-25 06:36:41,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287459609] [2023-12-25 06:36:41,857 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:36:41,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-25 06:36:41,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:36:41,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-25 06:36:41,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2023-12-25 06:36:41,859 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 18 states, 13 states have (on average 2.076923076923077) internal successors, (27), 15 states have internal predecessors, (27), 7 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (8), 3 states have call predecessors, (8), 7 states have call successors, (8) [2023-12-25 06:36:42,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:36:42,117 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2023-12-25 06:36:42,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 06:36:42,119 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 13 states have (on average 2.076923076923077) internal successors, (27), 15 states have internal predecessors, (27), 7 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (8), 3 states have call predecessors, (8), 7 states have call successors, (8) Word has length 26 [2023-12-25 06:36:42,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:36:42,119 INFO L225 Difference]: With dead ends: 46 [2023-12-25 06:36:42,119 INFO L226 Difference]: Without dead ends: 25 [2023-12-25 06:36:42,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2023-12-25 06:36:42,121 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 14 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 06:36:42,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 113 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 06:36:42,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-25 06:36:42,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-12-25 06:36:42,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-25 06:36:42,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2023-12-25 06:36:42,125 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 26 [2023-12-25 06:36:42,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:36:42,125 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2023-12-25 06:36:42,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 13 states have (on average 2.076923076923077) internal successors, (27), 15 states have internal predecessors, (27), 7 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (8), 3 states have call predecessors, (8), 7 states have call successors, (8) [2023-12-25 06:36:42,126 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2023-12-25 06:36:42,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-25 06:36:42,126 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:36:42,126 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:36:42,139 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-25 06:36:42,330 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-25 06:36:42,331 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:36:42,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:36:42,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1404343263, now seen corresponding path program 2 times [2023-12-25 06:36:42,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:36:42,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [666326914] [2023-12-25 06:36:42,336 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:36:42,336 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-25 06:36:42,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:36:42,337 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-25 06:36:42,343 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-25 06:36:42,398 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 06:36:42,399 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:36:42,401 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-25 06:36:42,404 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:36:42,407 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 11 treesize of output 7 [2023-12-25 06:36:42,418 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 11 treesize of output 7 [2023-12-25 06:36:42,617 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-25 06:36:42,617 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:36:43,637 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 06:36:43,637 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:36:43,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [666326914] [2023-12-25 06:36:43,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [666326914] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:36:43,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:36:43,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 23 [2023-12-25 06:36:43,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062841267] [2023-12-25 06:36:43,638 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:36:43,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-25 06:36:43,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:36:43,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-25 06:36:43,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2023-12-25 06:36:43,639 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 23 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 19 states have internal predecessors, (31), 8 states have call successors, (9), 6 states have call predecessors, (9), 8 states have return successors, (10), 5 states have call predecessors, (10), 8 states have call successors, (10) [2023-12-25 06:36:43,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:36:43,939 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2023-12-25 06:36:43,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 06:36:43,940 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 19 states have internal predecessors, (31), 8 states have call successors, (9), 6 states have call predecessors, (9), 8 states have return successors, (10), 5 states have call predecessors, (10), 8 states have call successors, (10) Word has length 31 [2023-12-25 06:36:43,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:36:43,941 INFO L225 Difference]: With dead ends: 50 [2023-12-25 06:36:43,941 INFO L226 Difference]: Without dead ends: 27 [2023-12-25 06:36:43,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=124, Invalid=578, Unknown=0, NotChecked=0, Total=702 [2023-12-25 06:36:43,942 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 06:36:43,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 153 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 06:36:43,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-25 06:36:43,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-12-25 06:36:43,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-25 06:36:43,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2023-12-25 06:36:43,946 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 31 [2023-12-25 06:36:43,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:36:43,946 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2023-12-25 06:36:43,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 19 states have internal predecessors, (31), 8 states have call successors, (9), 6 states have call predecessors, (9), 8 states have return successors, (10), 5 states have call predecessors, (10), 8 states have call successors, (10) [2023-12-25 06:36:43,947 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2023-12-25 06:36:43,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-25 06:36:43,947 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:36:43,947 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:36:43,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-25 06:36:44,148 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-25 06:36:44,148 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:36:44,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:36:44,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1141738753, now seen corresponding path program 3 times [2023-12-25 06:36:44,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:36:44,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1655286550] [2023-12-25 06:36:44,149 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 06:36:44,149 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-25 06:36:44,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:36:44,156 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-25 06:36:44,157 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-25 06:36:44,211 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-25 06:36:44,211 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:36:44,212 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-25 06:36:44,214 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:36:44,220 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 11 treesize of output 7 [2023-12-25 06:36:44,294 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 19 treesize of output 11 [2023-12-25 06:36:44,314 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-25 06:36:44,314 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:36:44,441 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 7 treesize of output 3 [2023-12-25 06:36:44,590 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-25 06:36:44,591 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:36:44,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1655286550] [2023-12-25 06:36:44,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1655286550] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:36:44,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:36:44,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2023-12-25 06:36:44,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684356291] [2023-12-25 06:36:44,591 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:36:44,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 06:36:44,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:36:44,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 06:36:44,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-12-25 06:36:44,592 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 14 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 7 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-25 06:36:44,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:36:44,844 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2023-12-25 06:36:44,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-25 06:36:44,844 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 7 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 36 [2023-12-25 06:36:44,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:36:44,845 INFO L225 Difference]: With dead ends: 44 [2023-12-25 06:36:44,845 INFO L226 Difference]: Without dead ends: 39 [2023-12-25 06:36:44,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2023-12-25 06:36:44,846 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 25 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 06:36:44,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 65 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 06:36:44,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-25 06:36:44,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2023-12-25 06:36:44,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 4 states have call successors, (4), 3 states have call predecessors, (4), 7 states have return successors, (10), 8 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-25 06:36:44,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2023-12-25 06:36:44,851 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 36 [2023-12-25 06:36:44,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:36:44,851 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2023-12-25 06:36:44,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 7 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-25 06:36:44,851 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2023-12-25 06:36:44,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-25 06:36:44,855 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:36:44,855 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:36:44,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-25 06:36:45,058 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-25 06:36:45,058 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:36:45,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:36:45,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1141740675, now seen corresponding path program 1 times [2023-12-25 06:36:45,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:36:45,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [106057095] [2023-12-25 06:36:45,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:36:45,059 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-25 06:36:45,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:36:45,073 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-25 06:36:45,118 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-25 06:36:45,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:36:45,160 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-25 06:36:45,164 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:36:45,167 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 11 treesize of output 7 [2023-12-25 06:36:45,175 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 11 treesize of output 7 [2023-12-25 06:36:45,415 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-25 06:36:45,415 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:36:47,005 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 06:36:47,005 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:36:47,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [106057095] [2023-12-25 06:36:47,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [106057095] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:36:47,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:36:47,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18] total 28 [2023-12-25 06:36:47,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050639458] [2023-12-25 06:36:47,006 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:36:47,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-25 06:36:47,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:36:47,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-25 06:36:47,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=648, Unknown=0, NotChecked=0, Total=756 [2023-12-25 06:36:47,007 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 28 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 23 states have internal predecessors, (35), 9 states have call successors, (10), 7 states have call predecessors, (10), 10 states have return successors, (12), 7 states have call predecessors, (12), 9 states have call successors, (12) [2023-12-25 06:36:47,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:36:47,535 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2023-12-25 06:36:47,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-25 06:36:47,535 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 23 states have internal predecessors, (35), 9 states have call successors, (10), 7 states have call predecessors, (10), 10 states have return successors, (12), 7 states have call predecessors, (12), 9 states have call successors, (12) Word has length 36 [2023-12-25 06:36:47,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:36:47,536 INFO L225 Difference]: With dead ends: 64 [2023-12-25 06:36:47,536 INFO L226 Difference]: Without dead ends: 35 [2023-12-25 06:36:47,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=167, Invalid=889, Unknown=0, NotChecked=0, Total=1056 [2023-12-25 06:36:47,538 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 13 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 06:36:47,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 214 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 06:36:47,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-25 06:36:47,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-12-25 06:36:47,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 8 states have return successors, (11), 9 states have call predecessors, (11), 4 states have call successors, (11) [2023-12-25 06:36:47,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2023-12-25 06:36:47,543 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 36 [2023-12-25 06:36:47,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:36:47,543 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2023-12-25 06:36:47,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 23 states have internal predecessors, (35), 9 states have call successors, (10), 7 states have call predecessors, (10), 10 states have return successors, (12), 7 states have call predecessors, (12), 9 states have call successors, (12) [2023-12-25 06:36:47,543 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2023-12-25 06:36:47,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-25 06:36:47,544 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:36:47,544 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:36:47,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-12-25 06:36:47,749 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-25 06:36:47,750 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:36:47,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:36:47,750 INFO L85 PathProgramCache]: Analyzing trace with hash 821553331, now seen corresponding path program 2 times [2023-12-25 06:36:47,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:36:47,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1664546899] [2023-12-25 06:36:47,751 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:36:47,751 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-25 06:36:47,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:36:47,752 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-25 06:36:47,755 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-25 06:36:47,818 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 06:36:47,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:36:47,820 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 50 conjunts are in the unsatisfiable core [2023-12-25 06:36:47,823 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:36:47,829 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 11 treesize of output 7 [2023-12-25 06:36:47,836 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 11 treesize of output 7 [2023-12-25 06:36:48,112 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 06:36:48,112 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:36:50,454 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 06:36:50,454 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:36:50,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1664546899] [2023-12-25 06:36:50,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1664546899] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:36:50,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:36:50,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 22] total 33 [2023-12-25 06:36:50,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598602539] [2023-12-25 06:36:50,454 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:36:50,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-25 06:36:50,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:36:50,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-25 06:36:50,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=922, Unknown=0, NotChecked=0, Total=1056 [2023-12-25 06:36:50,456 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 33 states, 25 states have (on average 1.56) internal successors, (39), 27 states have internal predecessors, (39), 10 states have call successors, (11), 8 states have call predecessors, (11), 12 states have return successors, (14), 9 states have call predecessors, (14), 10 states have call successors, (14) [2023-12-25 06:36:51,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:36:51,212 INFO L93 Difference]: Finished difference Result 68 states and 81 transitions. [2023-12-25 06:36:51,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 06:36:51,214 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 25 states have (on average 1.56) internal successors, (39), 27 states have internal predecessors, (39), 10 states have call successors, (11), 8 states have call predecessors, (11), 12 states have return successors, (14), 9 states have call predecessors, (14), 10 states have call successors, (14) Word has length 41 [2023-12-25 06:36:51,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:36:51,216 INFO L225 Difference]: With dead ends: 68 [2023-12-25 06:36:51,217 INFO L226 Difference]: Without dead ends: 37 [2023-12-25 06:36:51,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=214, Invalid=1268, Unknown=0, NotChecked=0, Total=1482 [2023-12-25 06:36:51,228 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 23 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 06:36:51,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 224 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 06:36:51,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-12-25 06:36:51,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-12-25 06:36:51,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 9 states have return successors, (12), 10 states have call predecessors, (12), 4 states have call successors, (12) [2023-12-25 06:36:51,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2023-12-25 06:36:51,236 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 41 [2023-12-25 06:36:51,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:36:51,236 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2023-12-25 06:36:51,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 25 states have (on average 1.56) internal successors, (39), 27 states have internal predecessors, (39), 10 states have call successors, (11), 8 states have call predecessors, (11), 12 states have return successors, (14), 9 states have call predecessors, (14), 10 states have call successors, (14) [2023-12-25 06:36:51,236 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2023-12-25 06:36:51,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-25 06:36:51,237 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:36:51,237 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:36:51,241 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 (8)] Ended with exit code 0 [2023-12-25 06:36:51,441 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-25 06:36:51,442 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:36:51,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:36:51,442 INFO L85 PathProgramCache]: Analyzing trace with hash 911185811, now seen corresponding path program 3 times [2023-12-25 06:36:51,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:36:51,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [624100480] [2023-12-25 06:36:51,442 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 06:36:51,443 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:36:51,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:36:51,444 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-25 06:36:51,455 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-25 06:36:51,523 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-25 06:36:51,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:36:51,525 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-25 06:36:51,527 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:36:51,529 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 11 treesize of output 7 [2023-12-25 06:36:51,655 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2023-12-25 06:36:51,655 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:36:52,051 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-25 06:36:52,051 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:36:52,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [624100480] [2023-12-25 06:36:52,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [624100480] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:36:52,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:36:52,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2023-12-25 06:36:52,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666867956] [2023-12-25 06:36:52,051 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:36:52,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-25 06:36:52,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:36:52,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-25 06:36:52,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2023-12-25 06:36:52,053 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 17 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 14 states have internal predecessors, (24), 7 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-25 06:36:52,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:36:52,346 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2023-12-25 06:36:52,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 06:36:52,347 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 14 states have internal predecessors, (24), 7 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Word has length 46 [2023-12-25 06:36:52,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:36:52,348 INFO L225 Difference]: With dead ends: 40 [2023-12-25 06:36:52,348 INFO L226 Difference]: Without dead ends: 35 [2023-12-25 06:36:52,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2023-12-25 06:36:52,348 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 8 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 06:36:52,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 99 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 06:36:52,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-25 06:36:52,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-12-25 06:36:52,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 4 states have call successors, (4), 3 states have call predecessors, (4), 9 states have return successors, (11), 9 states have call predecessors, (11), 4 states have call successors, (11) [2023-12-25 06:36:52,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2023-12-25 06:36:52,353 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 46 [2023-12-25 06:36:52,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:36:52,353 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2023-12-25 06:36:52,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 14 states have internal predecessors, (24), 7 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-25 06:36:52,353 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2023-12-25 06:36:52,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-12-25 06:36:52,354 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:36:52,354 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:36:52,358 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-25 06:36:52,554 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-25 06:36:52,555 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:36:52,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:36:52,555 INFO L85 PathProgramCache]: Analyzing trace with hash -140748045, now seen corresponding path program 4 times [2023-12-25 06:36:52,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:36:52,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [165254165] [2023-12-25 06:36:52,555 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-25 06:36:52,556 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-25 06:36:52,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:36:52,557 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-25 06:36:52,561 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-25 06:36:52,656 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-25 06:36:52,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:36:52,660 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 58 conjunts are in the unsatisfiable core [2023-12-25 06:36:52,663 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:36:52,668 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 11 treesize of output 7 [2023-12-25 06:36:52,683 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 11 treesize of output 7 [2023-12-25 06:36:53,028 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 174 proven. 35 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2023-12-25 06:36:53,029 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:36:56,079 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 4 proven. 242 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2023-12-25 06:36:56,079 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:36:56,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [165254165] [2023-12-25 06:36:56,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [165254165] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:36:56,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:36:56,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 26] total 38 [2023-12-25 06:36:56,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153031065] [2023-12-25 06:36:56,079 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:36:56,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-25 06:36:56,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:36:56,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-25 06:36:56,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1245, Unknown=0, NotChecked=0, Total=1406 [2023-12-25 06:36:56,081 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 38 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 31 states have internal predecessors, (54), 11 states have call successors, (17), 9 states have call predecessors, (17), 14 states have return successors, (21), 12 states have call predecessors, (21), 11 states have call successors, (21) [2023-12-25 06:36:57,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:36:57,080 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2023-12-25 06:36:57,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-25 06:36:57,080 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 31 states have internal predecessors, (54), 11 states have call successors, (17), 9 states have call predecessors, (17), 14 states have return successors, (21), 12 states have call predecessors, (21), 11 states have call successors, (21) Word has length 82 [2023-12-25 06:36:57,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:36:57,081 INFO L225 Difference]: With dead ends: 68 [2023-12-25 06:36:57,081 INFO L226 Difference]: Without dead ends: 37 [2023-12-25 06:36:57,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=265, Invalid=1715, Unknown=0, NotChecked=0, Total=1980 [2023-12-25 06:36:57,082 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 48 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 06:36:57,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 289 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 06:36:57,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-12-25 06:36:57,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-12-25 06:36:57,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 10 states have return successors, (12), 10 states have call predecessors, (12), 4 states have call successors, (12) [2023-12-25 06:36:57,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2023-12-25 06:36:57,086 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 82 [2023-12-25 06:36:57,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:36:57,087 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2023-12-25 06:36:57,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 31 states have internal predecessors, (54), 11 states have call successors, (17), 9 states have call predecessors, (17), 14 states have return successors, (21), 12 states have call predecessors, (21), 11 states have call successors, (21) [2023-12-25 06:36:57,087 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2023-12-25 06:36:57,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-25 06:36:57,087 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:36:57,087 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 12, 12, 12, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:36:57,101 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 (10)] Ended with exit code 0 [2023-12-25 06:36:57,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:36:57,289 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:36:57,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:36:57,290 INFO L85 PathProgramCache]: Analyzing trace with hash -369711305, now seen corresponding path program 5 times [2023-12-25 06:36:57,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:36:57,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2039836198] [2023-12-25 06:36:57,290 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-25 06:36:57,290 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-25 06:36:57,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:36:57,293 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 06:36:57,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-25 06:36:57,447 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2023-12-25 06:36:57,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:36:57,452 INFO L262 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-25 06:36:57,455 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:36:57,457 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 11 treesize of output 7 [2023-12-25 06:36:57,484 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 11 treesize of output 7 [2023-12-25 06:36:57,756 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2023-12-25 06:36:57,756 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:36:58,886 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 430 trivial. 0 not checked. [2023-12-25 06:36:58,886 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:36:58,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2039836198] [2023-12-25 06:36:58,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2039836198] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:36:58,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:36:58,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2023-12-25 06:36:58,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55765964] [2023-12-25 06:36:58,886 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:36:58,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-25 06:36:58,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:36:58,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-25 06:36:58,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2023-12-25 06:36:58,890 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 26 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 21 states have internal predecessors, (32), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (12), 9 states have call predecessors, (12), 11 states have call successors, (12) [2023-12-25 06:36:59,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:36:59,434 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2023-12-25 06:36:59,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-25 06:36:59,435 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 21 states have internal predecessors, (32), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (12), 9 states have call predecessors, (12), 11 states have call successors, (12) Word has length 92 [2023-12-25 06:36:59,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:36:59,435 INFO L225 Difference]: With dead ends: 44 [2023-12-25 06:36:59,435 INFO L226 Difference]: Without dead ends: 39 [2023-12-25 06:36:59,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=182, Invalid=940, Unknown=0, NotChecked=0, Total=1122 [2023-12-25 06:36:59,436 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 29 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 06:36:59,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 100 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 06:36:59,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-25 06:36:59,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-12-25 06:36:59,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 11 states have return successors, (13), 11 states have call predecessors, (13), 4 states have call successors, (13) [2023-12-25 06:36:59,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2023-12-25 06:36:59,440 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 92 [2023-12-25 06:36:59,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:36:59,440 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2023-12-25 06:36:59,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 21 states have internal predecessors, (32), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (12), 9 states have call predecessors, (12), 11 states have call successors, (12) [2023-12-25 06:36:59,441 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2023-12-25 06:36:59,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-25 06:36:59,441 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:36:59,442 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 18, 18, 18, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:36:59,462 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 (11)] Ended with exit code 0 [2023-12-25 06:36:59,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:36:59,645 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:36:59,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:36:59,646 INFO L85 PathProgramCache]: Analyzing trace with hash -149039543, now seen corresponding path program 6 times [2023-12-25 06:36:59,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:36:59,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [660267622] [2023-12-25 06:36:59,646 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-25 06:36:59,646 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-25 06:36:59,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:36:59,647 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-25 06:36:59,682 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-25 06:36:59,825 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2023-12-25 06:36:59,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:36:59,830 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 35 conjunts are in the unsatisfiable core [2023-12-25 06:36:59,833 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:36:59,836 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 11 treesize of output 7 [2023-12-25 06:37:00,031 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 19 treesize of output 11 [2023-12-25 06:37:00,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1011 trivial. 0 not checked. [2023-12-25 06:37:00,069 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:37:00,581 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 7 treesize of output 3 [2023-12-25 06:37:00,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:37:00,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [660267622] [2023-12-25 06:37:00,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [660267622] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:37:00,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [937839209] [2023-12-25 06:37:00,971 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-25 06:37:00,971 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 06:37:00,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 06:37:01,001 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 06:37:01,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2023-12-25 06:37:01,177 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-25 06:37:01,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057632150] [2023-12-25 06:37:01,177 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-25 06:37:01,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-25 06:37:01,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 06:37:01,184 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-25 06:37:01,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-25 06:37:01,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Forceful destruction successful, exit code 1 [2023-12-25 06:37:01,693 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2023-12-25 06:37:01,693 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:37:01,698 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-25 06:37:01,702 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:37:01,708 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 11 treesize of output 7 [2023-12-25 06:37:01,872 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 19 treesize of output 11 [2023-12-25 06:37:01,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1009 trivial. 0 not checked. [2023-12-25 06:37:01,876 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:37:02,342 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 7 treesize of output 3 [2023-12-25 06:37:02,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057632150] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:37:02,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:37:02,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 12 [2023-12-25 06:37:02,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037211111] [2023-12-25 06:37:02,512 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:37:02,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-25 06:37:02,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:37:02,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-25 06:37:02,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2023-12-25 06:37:02,513 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 12 states, 9 states have (on average 2.111111111111111) internal successors, (19), 11 states have internal predecessors, (19), 5 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-25 06:37:02,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:37:02,742 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2023-12-25 06:37:02,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-25 06:37:02,742 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.111111111111111) internal successors, (19), 11 states have internal predecessors, (19), 5 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) Word has length 133 [2023-12-25 06:37:02,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:37:02,747 INFO L225 Difference]: With dead ends: 50 [2023-12-25 06:37:02,747 INFO L226 Difference]: Without dead ends: 47 [2023-12-25 06:37:02,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 269 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2023-12-25 06:37:02,748 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 14 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 06:37:02,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 76 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 06:37:02,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-25 06:37:02,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2023-12-25 06:37:02,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 12 states have return successors, (15), 13 states have call predecessors, (15), 4 states have call successors, (15) [2023-12-25 06:37:02,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2023-12-25 06:37:02,752 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 133 [2023-12-25 06:37:02,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:37:02,752 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2023-12-25 06:37:02,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.111111111111111) internal successors, (19), 11 states have internal predecessors, (19), 5 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-25 06:37:02,752 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2023-12-25 06:37:02,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-25 06:37:02,753 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:37:02,753 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 18, 18, 18, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:37:02,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-12-25 06:37:02,957 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-25 06:37:03,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,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-25 06:37:03,157 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:37:03,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:37:03,158 INFO L85 PathProgramCache]: Analyzing trace with hash -149037621, now seen corresponding path program 4 times [2023-12-25 06:37:03,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:37:03,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1533805955] [2023-12-25 06:37:03,158 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-25 06:37:03,158 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-25 06:37:03,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:37:03,159 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-25 06:37:03,160 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-25 06:37:03,379 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-25 06:37:03,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:37:03,394 INFO L262 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 58 conjunts are in the unsatisfiable core [2023-12-25 06:37:03,397 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:37:03,399 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 11 treesize of output 7 [2023-12-25 06:37:03,429 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 11 treesize of output 7 [2023-12-25 06:37:03,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 901 trivial. 0 not checked. [2023-12-25 06:37:03,818 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:37:05,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 993 trivial. 0 not checked. [2023-12-25 06:37:05,721 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:37:05,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1533805955] [2023-12-25 06:37:05,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1533805955] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:37:05,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:37:05,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 31 [2023-12-25 06:37:05,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216970450] [2023-12-25 06:37:05,722 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:37:05,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-12-25 06:37:05,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:37:05,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-12-25 06:37:05,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=806, Unknown=0, NotChecked=0, Total=930 [2023-12-25 06:37:05,723 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 31 states, 23 states have (on average 1.608695652173913) internal successors, (37), 25 states have internal predecessors, (37), 13 states have call successors, (14), 7 states have call predecessors, (14), 9 states have return successors, (15), 12 states have call predecessors, (15), 13 states have call successors, (15) [2023-12-25 06:37:06,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:37:06,727 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2023-12-25 06:37:06,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-25 06:37:06,727 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 23 states have (on average 1.608695652173913) internal successors, (37), 25 states have internal predecessors, (37), 13 states have call successors, (14), 7 states have call predecessors, (14), 9 states have return successors, (15), 12 states have call predecessors, (15), 13 states have call successors, (15) Word has length 133 [2023-12-25 06:37:06,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:37:06,728 INFO L225 Difference]: With dead ends: 46 [2023-12-25 06:37:06,728 INFO L226 Difference]: Without dead ends: 41 [2023-12-25 06:37:06,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=235, Invalid=1325, Unknown=0, NotChecked=0, Total=1560 [2023-12-25 06:37:06,729 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 29 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 06:37:06,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 161 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 06:37:06,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-12-25 06:37:06,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-12-25 06:37:06,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 12 states have return successors, (14), 12 states have call predecessors, (14), 4 states have call successors, (14) [2023-12-25 06:37:06,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2023-12-25 06:37:06,733 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 133 [2023-12-25 06:37:06,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:37:06,733 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2023-12-25 06:37:06,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 23 states have (on average 1.608695652173913) internal successors, (37), 25 states have internal predecessors, (37), 13 states have call successors, (14), 7 states have call predecessors, (14), 9 states have return successors, (15), 12 states have call predecessors, (15), 13 states have call successors, (15) [2023-12-25 06:37:06,734 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2023-12-25 06:37:06,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2023-12-25 06:37:06,735 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:37:06,735 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 24, 24, 24, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:37:06,743 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-25 06:37:06,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:37:06,935 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:37:06,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:37:06,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1739371329, now seen corresponding path program 7 times [2023-12-25 06:37:06,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:37:06,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [598249275] [2023-12-25 06:37:06,936 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-25 06:37:06,936 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-25 06:37:06,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:37:06,937 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 06:37:06,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-25 06:37:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:37:07,219 INFO L262 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 74 conjunts are in the unsatisfiable core [2023-12-25 06:37:07,224 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:37:07,225 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 11 treesize of output 7 [2023-12-25 06:37:07,253 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 11 treesize of output 7 [2023-12-25 06:37:07,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1846 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 1606 trivial. 0 not checked. [2023-12-25 06:37:07,692 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:37:10,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1846 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 1788 trivial. 0 not checked. [2023-12-25 06:37:10,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:37:10,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [598249275] [2023-12-25 06:37:10,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [598249275] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:37:10,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:37:10,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 22] total 36 [2023-12-25 06:37:10,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828018447] [2023-12-25 06:37:10,594 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:37:10,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-25 06:37:10,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:37:10,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-25 06:37:10,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1108, Unknown=0, NotChecked=0, Total=1260 [2023-12-25 06:37:10,597 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 36 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 29 states have internal predecessors, (42), 15 states have call successors, (16), 8 states have call predecessors, (16), 11 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2023-12-25 06:37:11,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:37:11,740 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2023-12-25 06:37:11,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-25 06:37:11,747 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 29 states have internal predecessors, (42), 15 states have call successors, (16), 8 states have call predecessors, (16), 11 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) Word has length 174 [2023-12-25 06:37:11,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:37:11,748 INFO L225 Difference]: With dead ends: 48 [2023-12-25 06:37:11,748 INFO L226 Difference]: Without dead ends: 43 [2023-12-25 06:37:11,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=292, Invalid=1778, Unknown=0, NotChecked=0, Total=2070 [2023-12-25 06:37:11,749 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 63 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 06:37:11,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 183 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 06:37:11,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-25 06:37:11,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-12-25 06:37:11,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 4 states have call successors, (4), 3 states have call predecessors, (4), 13 states have return successors, (15), 13 states have call predecessors, (15), 4 states have call successors, (15) [2023-12-25 06:37:11,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2023-12-25 06:37:11,760 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 174 [2023-12-25 06:37:11,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:37:11,761 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2023-12-25 06:37:11,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 29 states have internal predecessors, (42), 15 states have call successors, (16), 8 states have call predecessors, (16), 11 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2023-12-25 06:37:11,761 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2023-12-25 06:37:11,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2023-12-25 06:37:11,762 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:37:11,762 INFO L195 NwaCegarLoop]: trace histogram [35, 35, 30, 30, 30, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:37:11,769 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 (16)] Ended with exit code 0 [2023-12-25 06:37:11,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:37:11,979 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:37:11,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:37:11,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1394731601, now seen corresponding path program 8 times [2023-12-25 06:37:11,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:37:11,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1184663450] [2023-12-25 06:37:11,980 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:37:11,980 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-25 06:37:11,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:37:11,981 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-25 06:37:11,982 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-25 06:37:12,400 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 06:37:12,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:37:12,414 INFO L262 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 137 conjunts are in the unsatisfiable core [2023-12-25 06:37:12,420 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:37:12,423 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 11 treesize of output 7 [2023-12-25 06:37:12,445 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 11 treesize of output 7 [2023-12-25 06:37:12,562 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 7 treesize of output 3 [2023-12-25 06:37:12,617 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 11 treesize of output 7 [2023-12-25 06:37:12,954 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 19 treesize of output 11 [2023-12-25 06:37:13,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2905 backedges. 836 proven. 404 refuted. 0 times theorem prover too weak. 1665 trivial. 0 not checked. [2023-12-25 06:37:13,062 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:37:14,888 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 25 treesize of output 21 [2023-12-25 06:37:15,451 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 25 treesize of output 21 [2023-12-25 06:37:15,997 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 25 treesize of output 21 [2023-12-25 06:37:16,500 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 25 treesize of output 21 [2023-12-25 06:37:17,762 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:37:17,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1184663450] [2023-12-25 06:37:17,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1184663450] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:37:17,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [655277023] [2023-12-25 06:37:17,763 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:37:17,763 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 06:37:17,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 06:37:17,764 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-25 06:37:17,765 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-25 06:37:18,247 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-25 06:37:18,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800547643] [2023-12-25 06:37:18,247 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:37:18,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-25 06:37:18,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 06:37:18,254 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-25 06:37:18,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Ended with exit code 1 [2023-12-25 06:37:18,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-12-25 06:37:18,527 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 06:37:18,527 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:37:18,537 INFO L262 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 47 conjunts are in the unsatisfiable core [2023-12-25 06:37:18,542 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:37:18,544 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 11 treesize of output 7 [2023-12-25 06:37:19,323 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 19 treesize of output 11 [2023-12-25 06:37:19,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2905 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 2866 trivial. 0 not checked. [2023-12-25 06:37:19,425 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:37:20,357 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 7 treesize of output 3 [2023-12-25 06:37:21,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800547643] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:37:21,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:37:21,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 27 [2023-12-25 06:37:21,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860617279] [2023-12-25 06:37:21,234 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:37:21,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-25 06:37:21,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:37:21,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-25 06:37:21,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1243, Unknown=0, NotChecked=0, Total=1332 [2023-12-25 06:37:21,236 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 27 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 26 states have internal predecessors, (44), 9 states have call successors, (12), 3 states have call predecessors, (12), 15 states have return successors, (21), 17 states have call predecessors, (21), 9 states have call successors, (21) [2023-12-25 06:37:24,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:37:24,840 INFO L93 Difference]: Finished difference Result 85 states and 105 transitions. [2023-12-25 06:37:24,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-12-25 06:37:24,840 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 26 states have internal predecessors, (44), 9 states have call successors, (12), 3 states have call predecessors, (12), 15 states have return successors, (21), 17 states have call predecessors, (21), 9 states have call successors, (21) Word has length 215 [2023-12-25 06:37:24,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:37:24,841 INFO L225 Difference]: With dead ends: 85 [2023-12-25 06:37:24,841 INFO L226 Difference]: Without dead ends: 81 [2023-12-25 06:37:24,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 433 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=284, Invalid=4272, Unknown=0, NotChecked=0, Total=4556 [2023-12-25 06:37:24,843 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 45 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-25 06:37:24,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 302 Invalid, 1248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1221 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-25 06:37:24,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-12-25 06:37:24,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 65. [2023-12-25 06:37:24,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 5 states have call successors, (5), 4 states have call predecessors, (5), 21 states have return successors, (37), 22 states have call predecessors, (37), 5 states have call successors, (37) [2023-12-25 06:37:24,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 84 transitions. [2023-12-25 06:37:24,851 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 84 transitions. Word has length 215 [2023-12-25 06:37:24,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:37:24,852 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 84 transitions. [2023-12-25 06:37:24,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 26 states have internal predecessors, (44), 9 states have call successors, (12), 3 states have call predecessors, (12), 15 states have return successors, (21), 17 states have call predecessors, (21), 9 states have call successors, (21) [2023-12-25 06:37:24,852 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2023-12-25 06:37:24,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2023-12-25 06:37:24,853 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:37:24,853 INFO L195 NwaCegarLoop]: trace histogram [35, 35, 30, 30, 30, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:37:24,863 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-25 06:37:25,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-12-25 06:37:25,254 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,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-25 06:37:25,254 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:37:25,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:37:25,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1394733523, now seen corresponding path program 5 times [2023-12-25 06:37:25,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:37:25,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [637631092] [2023-12-25 06:37:25,255 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-25 06:37:25,255 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-25 06:37:25,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:37:25,256 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 06:37:25,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-12-25 06:37:25,972 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2023-12-25 06:37:25,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:37:25,985 INFO L262 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 90 conjunts are in the unsatisfiable core [2023-12-25 06:37:25,990 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:37:25,992 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 11 treesize of output 7 [2023-12-25 06:37:26,059 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 11 treesize of output 7 [2023-12-25 06:37:26,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2905 backedges. 81 proven. 310 refuted. 0 times theorem prover too weak. 2514 trivial. 0 not checked. [2023-12-25 06:37:26,551 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:37:30,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2905 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 2815 trivial. 0 not checked. [2023-12-25 06:37:30,882 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:37:30,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [637631092] [2023-12-25 06:37:30,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [637631092] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:37:30,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:37:30,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 26] total 41 [2023-12-25 06:37:30,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688952093] [2023-12-25 06:37:30,883 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:37:30,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-12-25 06:37:30,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:37:30,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-12-25 06:37:30,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1459, Unknown=0, NotChecked=0, Total=1640 [2023-12-25 06:37:30,884 INFO L87 Difference]: Start difference. First operand 65 states and 84 transitions. Second operand has 41 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 33 states have internal predecessors, (47), 17 states have call successors, (18), 9 states have call predecessors, (18), 13 states have return successors, (21), 18 states have call predecessors, (21), 17 states have call successors, (21) [2023-12-25 06:37:32,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:37:32,471 INFO L93 Difference]: Finished difference Result 72 states and 92 transitions. [2023-12-25 06:37:32,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-25 06:37:32,472 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 33 states have internal predecessors, (47), 17 states have call successors, (18), 9 states have call predecessors, (18), 13 states have return successors, (21), 18 states have call predecessors, (21), 17 states have call successors, (21) Word has length 215 [2023-12-25 06:37:32,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:37:32,472 INFO L225 Difference]: With dead ends: 72 [2023-12-25 06:37:32,472 INFO L226 Difference]: Without dead ends: 67 [2023-12-25 06:37:32,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=353, Invalid=2299, Unknown=0, NotChecked=0, Total=2652 [2023-12-25 06:37:32,473 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 68 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-25 06:37:32,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 272 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-25 06:37:32,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-12-25 06:37:32,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2023-12-25 06:37:32,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 5 states have call successors, (5), 4 states have call predecessors, (5), 22 states have return successors, (38), 23 states have call predecessors, (38), 5 states have call successors, (38) [2023-12-25 06:37:32,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 86 transitions. [2023-12-25 06:37:32,479 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 86 transitions. Word has length 215 [2023-12-25 06:37:32,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:37:32,482 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 86 transitions. [2023-12-25 06:37:32,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 33 states have internal predecessors, (47), 17 states have call successors, (18), 9 states have call predecessors, (18), 13 states have return successors, (21), 18 states have call predecessors, (21), 17 states have call successors, (21) [2023-12-25 06:37:32,482 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2023-12-25 06:37:32,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2023-12-25 06:37:32,484 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:37:32,484 INFO L195 NwaCegarLoop]: trace histogram [45, 45, 39, 39, 39, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:37:32,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2023-12-25 06:37:32,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:37:32,691 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:37:32,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:37:32,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1066297459, now seen corresponding path program 6 times [2023-12-25 06:37:32,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:37:32,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [966556551] [2023-12-25 06:37:32,692 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-25 06:37:32,692 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-25 06:37:32,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:37:32,693 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-25 06:37:32,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 (21)] Waiting until timeout for monitored process [2023-12-25 06:37:33,188 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2023-12-25 06:37:33,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:37:33,198 INFO L262 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 124 conjunts are in the unsatisfiable core [2023-12-25 06:37:33,204 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:37:33,210 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 11 treesize of output 7 [2023-12-25 06:37:33,218 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 11 treesize of output 7 [2023-12-25 06:37:33,508 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 2532 proven. 68 refuted. 0 times theorem prover too weak. 2230 trivial. 0 not checked. [2023-12-25 06:37:33,508 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:37:42,576 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 310 proven. 1118 refuted. 0 times theorem prover too weak. 3402 trivial. 0 not checked. [2023-12-25 06:37:42,576 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:37:42,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [966556551] [2023-12-25 06:37:42,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [966556551] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:37:42,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:37:42,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 30] total 36 [2023-12-25 06:37:42,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582514578] [2023-12-25 06:37:42,577 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:37:42,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-25 06:37:42,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:37:42,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-25 06:37:42,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1142, Unknown=0, NotChecked=0, Total=1260 [2023-12-25 06:37:42,578 INFO L87 Difference]: Start difference. First operand 67 states and 86 transitions. Second operand has 36 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 28 states have internal predecessors, (51), 13 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (25), 9 states have call predecessors, (25), 13 states have call successors, (25) [2023-12-25 06:37:45,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:37:45,467 INFO L93 Difference]: Finished difference Result 127 states and 207 transitions. [2023-12-25 06:37:45,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-25 06:37:45,467 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 28 states have internal predecessors, (51), 13 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (25), 9 states have call predecessors, (25), 13 states have call successors, (25) Word has length 271 [2023-12-25 06:37:45,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:37:45,468 INFO L225 Difference]: With dead ends: 127 [2023-12-25 06:37:45,468 INFO L226 Difference]: Without dead ends: 62 [2023-12-25 06:37:45,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 506 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=852, Invalid=3054, Unknown=0, NotChecked=0, Total=3906 [2023-12-25 06:37:45,469 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 109 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-25 06:37:45,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 313 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-25 06:37:45,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-12-25 06:37:45,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-12-25 06:37:45,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 9 states have call successors, (9), 9 states have call predecessors, (9), 14 states have return successors, (15), 14 states have call predecessors, (15), 9 states have call successors, (15) [2023-12-25 06:37:45,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2023-12-25 06:37:45,475 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 271 [2023-12-25 06:37:45,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:37:45,475 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2023-12-25 06:37:45,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 28 states have internal predecessors, (51), 13 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (25), 9 states have call predecessors, (25), 13 states have call successors, (25) [2023-12-25 06:37:45,475 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2023-12-25 06:37:45,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2023-12-25 06:37:45,477 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:37:45,477 INFO L195 NwaCegarLoop]: trace histogram [42, 42, 36, 36, 36, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:37:45,503 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-25 06:37:45,677 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-25 06:37:45,678 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:37:45,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:37:45,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1043831351, now seen corresponding path program 7 times [2023-12-25 06:37:45,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:37:45,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [733225924] [2023-12-25 06:37:45,678 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-25 06:37:45,678 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-25 06:37:45,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:37:45,679 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-25 06:37:45,681 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-25 06:37:46,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:37:46,309 INFO L262 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 103 conjunts are in the unsatisfiable core [2023-12-25 06:37:46,315 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:37:46,317 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 11 treesize of output 7 [2023-12-25 06:37:46,347 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 11 treesize of output 7 [2023-12-25 06:37:46,922 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 19 treesize of output 11 [2023-12-25 06:37:46,968 INFO L134 CoverageAnalysis]: Checked inductivity of 4203 backedges. 0 proven. 583 refuted. 0 times theorem prover too weak. 3620 trivial. 0 not checked. [2023-12-25 06:37:46,968 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:37:48,302 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 8 treesize of output 4 [2023-12-25 06:37:48,893 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:37:48,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [733225924] [2023-12-25 06:37:48,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [733225924] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:37:48,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2062413878] [2023-12-25 06:37:48,893 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-25 06:37:48,893 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 06:37:48,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 06:37:48,894 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 06:37:48,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2023-12-25 06:37:49,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:37:49,590 INFO L262 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 78 conjunts are in the unsatisfiable core [2023-12-25 06:37:49,595 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:37:49,601 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 19 treesize of output 11 [2023-12-25 06:37:49,713 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 11 treesize of output 7 [2023-12-25 06:37:49,796 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 7 treesize of output 3 [2023-12-25 06:37:49,993 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 19 treesize of output 11 [2023-12-25 06:37:50,037 INFO L134 CoverageAnalysis]: Checked inductivity of 4203 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 4023 trivial. 0 not checked. [2023-12-25 06:37:50,037 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:37:51,155 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 8 treesize of output 4 [2023-12-25 06:37:51,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2062413878] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:37:51,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:37:51,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 22 [2023-12-25 06:37:51,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319373386] [2023-12-25 06:37:51,598 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:37:51,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-25 06:37:51,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:37:51,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-25 06:37:51,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2023-12-25 06:37:51,599 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand has 22 states, 16 states have (on average 1.8125) internal successors, (29), 19 states have internal predecessors, (29), 9 states have call successors, (10), 3 states have call predecessors, (10), 8 states have return successors, (13), 10 states have call predecessors, (13), 9 states have call successors, (13) [2023-12-25 06:37:52,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:37:52,373 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2023-12-25 06:37:52,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-25 06:37:52,373 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 16 states have (on average 1.8125) internal successors, (29), 19 states have internal predecessors, (29), 9 states have call successors, (10), 3 states have call predecessors, (10), 8 states have return successors, (13), 10 states have call predecessors, (13), 9 states have call successors, (13) Word has length 256 [2023-12-25 06:37:52,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:37:52,374 INFO L225 Difference]: With dead ends: 69 [2023-12-25 06:37:52,374 INFO L226 Difference]: Without dead ends: 64 [2023-12-25 06:37:52,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 508 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=92, Invalid=838, Unknown=0, NotChecked=0, Total=930 [2023-12-25 06:37:52,374 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 17 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-25 06:37:52,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 186 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-25 06:37:52,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-12-25 06:37:52,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-12-25 06:37:52,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 39 states have internal predecessors, (41), 9 states have call successors, (9), 9 states have call predecessors, (9), 15 states have return successors, (16), 15 states have call predecessors, (16), 9 states have call successors, (16) [2023-12-25 06:37:52,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2023-12-25 06:37:52,379 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 256 [2023-12-25 06:37:52,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:37:52,379 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2023-12-25 06:37:52,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 16 states have (on average 1.8125) internal successors, (29), 19 states have internal predecessors, (29), 9 states have call successors, (10), 3 states have call predecessors, (10), 8 states have return successors, (13), 10 states have call predecessors, (13), 9 states have call successors, (13) [2023-12-25 06:37:52,379 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2023-12-25 06:37:52,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2023-12-25 06:37:52,380 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:37:52,380 INFO L195 NwaCegarLoop]: trace histogram [49, 49, 42, 42, 42, 8, 8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:37:52,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2023-12-25 06:37:52,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2023-12-25 06:37:52,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-25 06:37:52,781 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:37:52,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:37:52,781 INFO L85 PathProgramCache]: Analyzing trace with hash 2129940955, now seen corresponding path program 8 times [2023-12-25 06:37:52,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:37:52,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [249567204] [2023-12-25 06:37:52,782 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:37:52,782 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-25 06:37:52,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:37:52,783 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 06:37:52,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-12-25 06:37:53,413 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 06:37:53,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:37:53,429 INFO L262 TraceCheckSpWp]: Trace formula consists of 822 conjuncts, 106 conjunts are in the unsatisfiable core [2023-12-25 06:37:53,441 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:37:53,443 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 11 treesize of output 7 [2023-12-25 06:37:53,481 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 11 treesize of output 7 [2023-12-25 06:37:54,011 INFO L134 CoverageAnalysis]: Checked inductivity of 5740 backedges. 14 proven. 710 refuted. 0 times theorem prover too weak. 5016 trivial. 0 not checked. [2023-12-25 06:37:54,012 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:37:58,310 INFO L134 CoverageAnalysis]: Checked inductivity of 5740 backedges. 14 proven. 161 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2023-12-25 06:37:58,310 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:37:58,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [249567204] [2023-12-25 06:37:58,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [249567204] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:37:58,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:37:58,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 30] total 39 [2023-12-25 06:37:58,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292022646] [2023-12-25 06:37:58,311 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:37:58,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-12-25 06:37:58,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:37:58,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-12-25 06:37:58,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1342, Unknown=0, NotChecked=0, Total=1482 [2023-12-25 06:37:58,313 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand has 39 states, 28 states have (on average 1.75) internal successors, (49), 30 states have internal predecessors, (49), 20 states have call successors, (22), 10 states have call predecessors, (22), 8 states have return successors, (26), 16 states have call predecessors, (26), 20 states have call successors, (26) [2023-12-25 06:38:09,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:38:09,501 INFO L93 Difference]: Finished difference Result 101 states and 147 transitions. [2023-12-25 06:38:09,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-12-25 06:38:09,502 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 28 states have (on average 1.75) internal successors, (49), 30 states have internal predecessors, (49), 20 states have call successors, (22), 10 states have call predecessors, (22), 8 states have return successors, (26), 16 states have call predecessors, (26), 20 states have call successors, (26) Word has length 297 [2023-12-25 06:38:09,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:38:09,503 INFO L225 Difference]: With dead ends: 101 [2023-12-25 06:38:09,503 INFO L226 Difference]: Without dead ends: 0 [2023-12-25 06:38:09,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 640 GetRequests, 562 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1181 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=1297, Invalid=5022, Unknown=1, NotChecked=0, Total=6320 [2023-12-25 06:38:09,505 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 196 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 317 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 317 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-25 06:38:09,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 101 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [317 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-25 06:38:09,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-25 06:38:09,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-25 06:38:09,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 06:38:09,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-25 06:38:09,506 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 297 [2023-12-25 06:38:09,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:38:09,506 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-25 06:38:09,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 28 states have (on average 1.75) internal successors, (49), 30 states have internal predecessors, (49), 20 states have call successors, (22), 10 states have call predecessors, (22), 8 states have return successors, (26), 16 states have call predecessors, (26), 20 states have call successors, (26) [2023-12-25 06:38:09,506 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-25 06:38:09,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-25 06:38:09,508 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 06:38:09,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2023-12-25 06:38:09,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:38:09,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-25 06:38:12,298 INFO L895 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (or (let ((.cse0 (select (select |old(#memory_int#1)| |func_to_recursive_line_21_to_21_0_#in~b.base|) |func_to_recursive_line_21_to_21_0_#in~b.offset|)) (.cse1 (select (select |#memory_int#1| |func_to_recursive_line_21_to_21_0_#in~b.base|) |func_to_recursive_line_21_to_21_0_#in~b.offset|))) (and (= |func_to_recursive_line_20_to_21_0_#in~a.offset| func_to_recursive_line_20_to_21_0_~a.offset) (or (not (bvslt (bvadd (_ bv3 32) .cse0) (_ bv6 32))) (bvslt (bvadd (_ bv3 32) .cse1) (_ bv6 32))) (= func_to_recursive_line_20_to_21_0_~b.offset |func_to_recursive_line_20_to_21_0_#in~b.offset|) (or (bvslt (bvadd (_ bv4 32) .cse1) (_ bv6 32)) (not (bvslt (bvadd (_ bv4 32) .cse0) (_ bv6 32)))) (or (bvslt (bvadd (_ bv2 32) .cse1) (_ bv6 32)) (not (bvslt (bvadd (_ bv2 32) .cse0) (_ bv6 32)))) (bvslt (select (select |old(#memory_int#2)| |func_to_recursive_line_20_to_21_0_#in~a.base|) |func_to_recursive_line_20_to_21_0_#in~a.offset|) (_ bv6 32)) (or (not (bvslt (bvadd (_ bv5 32) .cse0) (_ bv6 32))) (bvslt (bvadd .cse1 (_ bv5 32)) (_ bv6 32))) (or (bvslt (bvadd .cse1 (_ bv1 32)) (_ bv6 32)) (not (bvslt (bvadd (_ bv1 32) .cse0) (_ bv6 32)))) (= |old(#memory_int#2)| |#memory_int#2|) (or (bvslt (bvadd (_ bv6 32) .cse0) (_ bv6 32)) (not (bvslt (bvadd (_ bv6 32) .cse1) (_ bv6 32)))) (= (select (select |#memory_int#1| func_to_recursive_line_20_to_21_0_~b.base) func_to_recursive_line_20_to_21_0_~b.offset) (_ bv0 32)) (or (not (bvslt .cse0 (_ bv6 32))) (bvslt .cse1 (_ bv6 32))) (= |func_to_recursive_line_20_to_21_0_#in~a.base| func_to_recursive_line_20_to_21_0_~a.base) (= |func_to_recursive_line_20_to_21_0_#in~b.base| func_to_recursive_line_20_to_21_0_~b.base))) (not (= (_ bv6 32) (select (select |old(#memory_int#1)| |func_to_recursive_line_20_to_21_0_#in~b.base|) |func_to_recursive_line_20_to_21_0_#in~b.offset|)))) [2023-12-25 06:38:12,298 INFO L899 garLoopResultBuilder]: For program point L47-1(line 47) no Hoare annotation was computed. [2023-12-25 06:38:12,298 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 39 57) the Hoare annotation is: (or (not (= (_ bv6 32) (select (select |old(#memory_int#1)| |func_to_recursive_line_20_to_21_0_#in~b.base|) |func_to_recursive_line_20_to_21_0_#in~b.offset|))) (and (= |old(#memory_int#1)| |#memory_int#1|) (= |old(#memory_int#2)| |#memory_int#2|))) [2023-12-25 06:38:12,298 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 56) no Hoare annotation was computed. [2023-12-25 06:38:12,298 INFO L899 garLoopResultBuilder]: For program point L41-1(lines 39 57) no Hoare annotation was computed. [2023-12-25 06:38:12,298 INFO L895 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (or (let ((.cse1 (select |old(#memory_int#2)| |func_to_recursive_line_20_to_21_0_#in~a.base|))) (let ((.cse0 (select .cse1 |func_to_recursive_line_20_to_21_0_#in~a.offset|))) (and (= func_to_recursive_line_20_to_21_0_~b.offset |func_to_recursive_line_20_to_21_0_#in~b.offset|) (bvslt .cse0 (_ bv6 32)) (= (_ bv6 32) (select (select |#memory_int#1| |func_to_recursive_line_20_to_21_0_#in~b.base|) |func_to_recursive_line_20_to_21_0_#in~b.offset|)) (= |#memory_int#2| (store |old(#memory_int#2)| |func_to_recursive_line_20_to_21_0_#in~a.base| (store .cse1 |func_to_recursive_line_20_to_21_0_#in~a.offset| (bvadd .cse0 (_ bv1 32))))) (= |#memory_int#2| (store |old(#memory_int#2)| func_to_recursive_line_20_to_21_0_~a.base (let ((.cse2 (select |old(#memory_int#2)| func_to_recursive_line_20_to_21_0_~a.base))) (store .cse2 func_to_recursive_line_20_to_21_0_~a.offset (bvadd (select .cse2 func_to_recursive_line_20_to_21_0_~a.offset) (_ bv1 32)))))) (= |func_to_recursive_line_20_to_21_0_#in~b.base| func_to_recursive_line_20_to_21_0_~b.base)))) (not (= (_ bv6 32) (select (select |old(#memory_int#1)| |func_to_recursive_line_20_to_21_0_#in~b.base|) |func_to_recursive_line_20_to_21_0_#in~b.offset|)))) [2023-12-25 06:38:12,299 INFO L899 garLoopResultBuilder]: For program point func_to_recursive_line_20_to_21_0EXIT(lines 39 57) no Hoare annotation was computed. [2023-12-25 06:38:12,299 INFO L895 garLoopResultBuilder]: At program point L65(line 65) the Hoare annotation is: (and (= |ULTIMATE.start_main_~#b~0#1.offset| (_ bv0 32)) (= (_ bv6 32) (select (select |#memory_int#1| |ULTIMATE.start_main_~#b~0#1.base|) (_ bv0 32))) (= (select (select |#memory_int#2| |ULTIMATE.start_main_~#a~0#1.base|) (_ bv0 32)) (_ bv0 32)) (= |ULTIMATE.start_main_~#a~0#1.offset| (_ bv0 32))) [2023-12-25 06:38:12,299 INFO L899 garLoopResultBuilder]: For program point L67-2(lines 67 73) no Hoare annotation was computed. [2023-12-25 06:38:12,299 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-25 06:38:12,299 INFO L899 garLoopResultBuilder]: For program point L65-1(line 65) no Hoare annotation was computed. [2023-12-25 06:38:12,299 INFO L899 garLoopResultBuilder]: For program point L67-4(lines 67 73) no Hoare annotation was computed. [2023-12-25 06:38:12,299 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 69) no Hoare annotation was computed. [2023-12-25 06:38:12,299 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-25 06:38:12,299 INFO L899 garLoopResultBuilder]: For program point L69(line 69) no Hoare annotation was computed. [2023-12-25 06:38:12,299 INFO L899 garLoopResultBuilder]: For program point L67(line 67) no Hoare annotation was computed. [2023-12-25 06:38:12,299 INFO L895 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: (and (= |#memory_int#1| (store |old(#memory_int#1)| func_to_recursive_line_21_to_21_0_~b.base (let ((.cse0 (select |old(#memory_int#1)| func_to_recursive_line_21_to_21_0_~b.base))) (store .cse0 func_to_recursive_line_21_to_21_0_~b.offset (bvadd (select .cse0 func_to_recursive_line_21_to_21_0_~b.offset) (_ bv1 32)))))) (= |func_to_recursive_line_21_to_21_0_#in~b.base| func_to_recursive_line_21_to_21_0_~b.base) (= func_to_recursive_line_21_to_21_0_~b.offset |func_to_recursive_line_21_to_21_0_#in~b.offset|) (bvslt (select (select |old(#memory_int#1)| |func_to_recursive_line_21_to_21_0_#in~b.base|) |func_to_recursive_line_21_to_21_0_#in~b.offset|) (_ bv6 32))) [2023-12-25 06:38:12,299 INFO L899 garLoopResultBuilder]: For program point func_to_recursive_line_21_to_21_0EXIT(lines 23 37) no Hoare annotation was computed. [2023-12-25 06:38:12,299 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 23 37) the Hoare annotation is: (= |old(#memory_int#1)| |#memory_int#1|) [2023-12-25 06:38:12,299 INFO L899 garLoopResultBuilder]: For program point L25(lines 25 36) no Hoare annotation was computed. [2023-12-25 06:38:12,299 INFO L899 garLoopResultBuilder]: For program point L25-1(lines 23 37) no Hoare annotation was computed. [2023-12-25 06:38:12,302 INFO L445 BasicCegarLoop]: Path program histogram: [8, 8, 1, 1] [2023-12-25 06:38:12,303 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 06:38:12,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 06:38:12 BoogieIcfgContainer [2023-12-25 06:38:12,306 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 06:38:12,306 INFO L158 Benchmark]: Toolchain (without parser) took 92990.37ms. Allocated memory was 197.1MB in the beginning and 293.6MB in the end (delta: 96.5MB). Free memory was 141.8MB in the beginning and 172.4MB in the end (delta: -30.7MB). Peak memory consumption was 163.3MB. Max. memory is 8.0GB. [2023-12-25 06:38:12,306 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 197.1MB. Free memory is still 144.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 06:38:12,307 INFO L158 Benchmark]: CACSL2BoogieTranslator took 169.45ms. Allocated memory is still 197.1MB. Free memory was 141.5MB in the beginning and 130.5MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 06:38:12,307 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.47ms. Allocated memory is still 197.1MB. Free memory was 130.5MB in the beginning and 128.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 06:38:12,307 INFO L158 Benchmark]: Boogie Preprocessor took 25.69ms. Allocated memory is still 197.1MB. Free memory was 128.9MB in the beginning and 127.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 06:38:12,307 INFO L158 Benchmark]: RCFGBuilder took 300.25ms. Allocated memory is still 197.1MB. Free memory was 126.8MB in the beginning and 162.6MB in the end (delta: -35.7MB). Peak memory consumption was 14.8MB. Max. memory is 8.0GB. [2023-12-25 06:38:12,307 INFO L158 Benchmark]: TraceAbstraction took 92470.09ms. Allocated memory was 197.1MB in the beginning and 293.6MB in the end (delta: 96.5MB). Free memory was 161.5MB in the beginning and 172.4MB in the end (delta: -10.9MB). Peak memory consumption was 182.0MB. Max. memory is 8.0GB. [2023-12-25 06:38:12,308 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.13ms. Allocated memory is still 197.1MB. Free memory is still 144.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 169.45ms. Allocated memory is still 197.1MB. Free memory was 141.5MB in the beginning and 130.5MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.47ms. Allocated memory is still 197.1MB. Free memory was 130.5MB in the beginning and 128.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.69ms. Allocated memory is still 197.1MB. Free memory was 128.9MB in the beginning and 127.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 300.25ms. Allocated memory is still 197.1MB. Free memory was 126.8MB in the beginning and 162.6MB in the end (delta: -35.7MB). Peak memory consumption was 14.8MB. Max. memory is 8.0GB. * TraceAbstraction took 92470.09ms. Allocated memory was 197.1MB in the beginning and 293.6MB in the end (delta: 96.5MB). Free memory was 161.5MB in the beginning and 172.4MB in the end (delta: -10.9MB). Peak memory consumption was 182.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 69]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 92.4s, OverallIterations: 18, TraceHistogramMax: 49, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 26.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 726 SdHoareTripleChecker+Valid, 8.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 721 mSDsluCounter, 2930 SdHoareTripleChecker+Invalid, 7.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2651 mSDsCounter, 795 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5571 IncrementalHoareTripleChecker+Invalid, 6366 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 795 mSolverCounterUnsat, 279 mSDtfsCounter, 5571 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4437 GetRequests, 3822 SyntacticMatches, 2 SemanticMatches, 613 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5139 ImplicationChecksByTransitivity, 32.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=15, InterpolantAutomatonStates: 293, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 26 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 98 PreInvPairs, 105 NumberOfFragments, 310 HoareAnnotationTreeSize, 98 FormulaSimplifications, 1147 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FormulaSimplificationsInter, 3376 FormulaSimplificationTreeSizeReductionInter, 2.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 3.5s SatisfiabilityAnalysisTime, 52.1s InterpolantComputationTime, 2719 NumberOfCodeBlocks, 2500 NumberOfCodeBlocksAsserted, 92 NumberOfCheckSat, 4165 ConstructedInterpolants, 4 QuantifiedInterpolants, 16668 SizeOfPredicates, 361 NumberOfNonLiveVariables, 7252 ConjunctsInSsa, 1190 ConjunctsInUnsatCore, 34 InterpolantComputations, 2 PerfectInterpolantSequences, 46283/50926 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-12-25 06:38:12,521 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-25 06:38:12,533 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 137 Received shutdown request...