/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_nla-digbench/recursified_hard-u.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 07:00:26,254 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 07:00:26,323 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 07:00:26,327 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 07:00:26,328 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 07:00:26,348 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 07:00:26,349 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 07:00:26,349 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 07:00:26,349 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 07:00:26,352 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 07:00:26,352 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 07:00:26,353 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 07:00:26,353 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 07:00:26,354 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 07:00:26,354 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 07:00:26,355 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 07:00:26,355 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 07:00:26,355 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 07:00:26,355 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 07:00:26,355 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 07:00:26,355 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 07:00:26,356 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 07:00:26,356 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 07:00:26,356 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 07:00:26,356 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 07:00:26,356 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 07:00:26,357 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 07:00:26,357 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 07:00:26,357 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 07:00:26,357 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 07:00:26,358 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 07:00:26,358 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 07:00:26,358 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 07:00:26,358 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 07:00:26,358 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 07:00:26,359 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 07:00:26,359 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 07:00:26,359 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 07:00:26,359 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 07:00:26,359 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 07:00:26,359 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 07:00:26,359 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 07:00:26,359 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 07:00:26,360 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 07:00:26,360 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 07:00:26,360 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 07:00:26,360 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 07:00:26,580 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 07:00:26,607 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 07:00:26,609 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 07:00:26,617 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 07:00:26,617 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 07:00:26,618 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursified_nla-digbench/recursified_hard-u.c [2023-12-25 07:00:27,683 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 07:00:27,932 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 07:00:27,932 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursified_nla-digbench/recursified_hard-u.c [2023-12-25 07:00:27,943 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16abb696b/92d43fe7b88943d09bcd425856e9bac9/FLAGd7d95c5d0 [2023-12-25 07:00:27,969 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16abb696b/92d43fe7b88943d09bcd425856e9bac9 [2023-12-25 07:00:27,971 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 07:00:27,972 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 07:00:27,973 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 07:00:27,973 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 07:00:27,976 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 07:00:27,976 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 07:00:27" (1/1) ... [2023-12-25 07:00:27,977 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3da768f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:00:27, skipping insertion in model container [2023-12-25 07:00:27,977 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 07:00:27" (1/1) ... [2023-12-25 07:00:27,992 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 07:00:28,091 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_nla-digbench/recursified_hard-u.c[1080,1093] [2023-12-25 07:00:28,105 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 07:00:28,115 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 07:00:28,129 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_nla-digbench/recursified_hard-u.c[1080,1093] [2023-12-25 07:00:28,149 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 07:00:28,164 INFO L206 MainTranslator]: Completed translation [2023-12-25 07:00:28,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:00:28 WrapperNode [2023-12-25 07:00:28,164 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 07:00:28,165 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 07:00:28,165 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 07:00:28,165 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 07:00:28,170 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:00:28" (1/1) ... [2023-12-25 07:00:28,178 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:00:28" (1/1) ... [2023-12-25 07:00:28,190 INFO L138 Inliner]: procedures = 19, calls = 84, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 77 [2023-12-25 07:00:28,190 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 07:00:28,191 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 07:00:28,191 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 07:00:28,191 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 07:00:28,197 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:00:28" (1/1) ... [2023-12-25 07:00:28,197 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:00:28" (1/1) ... [2023-12-25 07:00:28,200 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:00:28" (1/1) ... [2023-12-25 07:00:28,212 INFO L175 MemorySlicer]: Split 49 memory accesses to 7 slices as follows [12, 2, 7, 8, 5, 6, 9]. 24 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0, 0, 0, 0, 0]. The 12 writes are split as follows [3, 0, 1, 2, 1, 2, 3]. [2023-12-25 07:00:28,213 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:00:28" (1/1) ... [2023-12-25 07:00:28,213 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:00:28" (1/1) ... [2023-12-25 07:00:28,219 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:00:28" (1/1) ... [2023-12-25 07:00:28,221 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:00:28" (1/1) ... [2023-12-25 07:00:28,222 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:00:28" (1/1) ... [2023-12-25 07:00:28,223 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:00:28" (1/1) ... [2023-12-25 07:00:28,226 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 07:00:28,227 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 07:00:28,227 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 07:00:28,227 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 07:00:28,227 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:00:28" (1/1) ... [2023-12-25 07:00:28,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 07:00:28,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 07:00:28,251 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 07:00:28,257 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 07:00:28,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 07:00:28,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 07:00:28,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-25 07:00:28,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-25 07:00:28,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-25 07:00:28,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-12-25 07:00:28,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2023-12-25 07:00:28,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2023-12-25 07:00:28,280 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_41_to_51_0 [2023-12-25 07:00:28,280 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_41_to_51_0 [2023-12-25 07:00:28,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-25 07:00:28,280 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_31_to_38_0 [2023-12-25 07:00:28,280 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_31_to_38_0 [2023-12-25 07:00:28,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-25 07:00:28,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-25 07:00:28,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-25 07:00:28,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-12-25 07:00:28,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2023-12-25 07:00:28,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2023-12-25 07:00:28,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2023-12-25 07:00:28,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 07:00:28,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 07:00:28,281 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 07:00:28,281 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 07:00:28,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-25 07:00:28,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-25 07:00:28,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-25 07:00:28,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-25 07:00:28,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-12-25 07:00:28,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-12-25 07:00:28,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2023-12-25 07:00:28,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2023-12-25 07:00:28,390 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 07:00:28,392 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 07:00:28,643 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 07:00:28,666 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 07:00:28,667 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-25 07:00:28,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 07:00:28 BoogieIcfgContainer [2023-12-25 07:00:28,667 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 07:00:28,669 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 07:00:28,669 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 07:00:28,671 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 07:00:28,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 07:00:27" (1/3) ... [2023-12-25 07:00:28,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7109aa0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 07:00:28, skipping insertion in model container [2023-12-25 07:00:28,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:00:28" (2/3) ... [2023-12-25 07:00:28,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7109aa0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 07:00:28, skipping insertion in model container [2023-12-25 07:00:28,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 07:00:28" (3/3) ... [2023-12-25 07:00:28,673 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_hard-u.c [2023-12-25 07:00:28,685 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 07:00:28,686 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 07:00:28,730 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 07:00:28,736 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;@72ac1c18, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 07:00:28,736 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 07:00:28,741 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 27 states have internal predecessors, (32), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-25 07:00:28,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-25 07:00:28,747 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:00:28,747 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:00:28,748 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:00:28,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:00:28,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1915466635, now seen corresponding path program 1 times [2023-12-25 07:00:28,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:00:28,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1548954422] [2023-12-25 07:00:28,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:00:28,768 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 07:00:28,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:00:28,785 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 07:00:28,836 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 07:00:28,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:00:28,952 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-25 07:00:28,959 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:00:29,029 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 07:00:29,108 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 07:00:29,109 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:00:29,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:00:29,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1548954422] [2023-12-25 07:00:29,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1548954422] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:00:29,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:00:29,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-25 07:00:29,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247956797] [2023-12-25 07:00:29,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:00:29,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 07:00:29,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:00:29,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 07:00:29,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-25 07:00:29,139 INFO L87 Difference]: Start difference. First operand has 40 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 27 states have internal predecessors, (32), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 8 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:00:29,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:00:29,820 INFO L93 Difference]: Finished difference Result 82 states and 120 transitions. [2023-12-25 07:00:29,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 07:00:29,823 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-25 07:00:29,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:00:29,828 INFO L225 Difference]: With dead ends: 82 [2023-12-25 07:00:29,828 INFO L226 Difference]: Without dead ends: 42 [2023-12-25 07:00:29,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-12-25 07:00:29,835 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 20 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-25 07:00:29,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 227 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-25 07:00:29,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-25 07:00:29,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-12-25 07:00:29,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 29 states have internal predecessors, (30), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-25 07:00:29,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2023-12-25 07:00:29,909 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 10 [2023-12-25 07:00:29,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:00:29,910 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2023-12-25 07:00:29,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:00:29,910 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2023-12-25 07:00:29,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-25 07:00:29,911 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:00:29,911 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:00:29,917 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 07:00:30,115 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 07:00:30,115 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:00:30,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:00:30,116 INFO L85 PathProgramCache]: Analyzing trace with hash 880062118, now seen corresponding path program 1 times [2023-12-25 07:00:30,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:00:30,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1366319563] [2023-12-25 07:00:30,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:00:30,118 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 07:00:30,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:00:30,119 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 07:00:30,122 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 07:00:30,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:00:30,196 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-25 07:00:30,199 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:00:30,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-25 07:00:34,298 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_func_to_recursive_line_31_to_38_0_~r.base_BEFORE_CALL_1 (_ BitVec 32)) (v_func_to_recursive_line_31_to_38_0_~A.offset_BEFORE_CALL_1 (_ BitVec 32)) (v_func_to_recursive_line_31_to_38_0_~r.offset_BEFORE_CALL_1 (_ BitVec 32)) (v_func_to_recursive_line_31_to_38_0_~A.base_BEFORE_CALL_1 (_ BitVec 32))) (= (select (select |c_#memory_int#4| v_func_to_recursive_line_31_to_38_0_~A.base_BEFORE_CALL_1) v_func_to_recursive_line_31_to_38_0_~A.offset_BEFORE_CALL_1) (select (select |c_#memory_int#3| v_func_to_recursive_line_31_to_38_0_~r.base_BEFORE_CALL_1) v_func_to_recursive_line_31_to_38_0_~r.offset_BEFORE_CALL_1))) is different from true [2023-12-25 07:00:34,427 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 19 treesize of output 11 [2023-12-25 07:00:34,438 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 15 treesize of output 7 [2023-12-25 07:00:34,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-25 07:00:34,620 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:00:34,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:00:34,822 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:00:34,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1366319563] [2023-12-25 07:00:34,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1366319563] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 07:00:34,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 07:00:34,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 11 [2023-12-25 07:00:34,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043319645] [2023-12-25 07:00:34,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:00:34,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 07:00:34,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:00:34,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 07:00:34,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=72, Unknown=1, NotChecked=16, Total=110 [2023-12-25 07:00:34,824 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand has 8 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 07:00:36,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:00:36,010 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2023-12-25 07:00:36,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 07:00:36,011 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-12-25 07:00:36,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:00:36,012 INFO L225 Difference]: With dead ends: 48 [2023-12-25 07:00:36,012 INFO L226 Difference]: Without dead ends: 46 [2023-12-25 07:00:36,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=35, Invalid=124, Unknown=1, NotChecked=22, Total=182 [2023-12-25 07:00:36,013 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 18 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:00:36,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 224 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-25 07:00:36,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-25 07:00:36,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-12-25 07:00:36,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 32 states have internal predecessors, (33), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-25 07:00:36,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2023-12-25 07:00:36,019 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 16 [2023-12-25 07:00:36,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:00:36,019 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2023-12-25 07:00:36,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 07:00:36,020 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2023-12-25 07:00:36,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-25 07:00:36,020 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:00:36,020 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:00:36,039 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 07:00:36,223 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 07:00:36,223 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:00:36,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:00:36,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1956934271, now seen corresponding path program 1 times [2023-12-25 07:00:36,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:00:36,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1980457790] [2023-12-25 07:00:36,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:00:36,225 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 07:00:36,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:00:36,226 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 07:00:36,256 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 07:00:36,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:00:36,312 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-25 07:00:36,315 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:00:36,326 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 07:00:36,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-25 07:00:37,080 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 19 treesize of output 11 [2023-12-25 07:00:37,091 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 15 treesize of output 7 [2023-12-25 07:00:37,416 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 07:00:37,416 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:00:39,562 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 07:00:39,562 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:00:39,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1980457790] [2023-12-25 07:00:39,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1980457790] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 07:00:39,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 07:00:39,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2023-12-25 07:00:39,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484194796] [2023-12-25 07:00:39,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:00:39,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 07:00:39,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:00:39,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 07:00:39,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2023-12-25 07:00:39,564 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 07:00:47,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 07:00:48,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:00:48,591 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2023-12-25 07:00:48,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 07:00:48,598 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2023-12-25 07:00:48,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:00:48,599 INFO L225 Difference]: With dead ends: 64 [2023-12-25 07:00:48,599 INFO L226 Difference]: Without dead ends: 62 [2023-12-25 07:00:48,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2023-12-25 07:00:48,600 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 15 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2023-12-25 07:00:48,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 238 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 109 Invalid, 1 Unknown, 0 Unchecked, 7.3s Time] [2023-12-25 07:00:48,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-12-25 07:00:48,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2023-12-25 07:00:48,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 42 states have internal predecessors, (44), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2023-12-25 07:00:48,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2023-12-25 07:00:48,609 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 22 [2023-12-25 07:00:48,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:00:48,609 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2023-12-25 07:00:48,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 07:00:48,609 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2023-12-25 07:00:48,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-25 07:00:48,610 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:00:48,610 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:00:48,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-25 07:00:48,816 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 07:00:48,817 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:00:48,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:00:48,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1106443508, now seen corresponding path program 1 times [2023-12-25 07:00:48,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:00:48,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1231305458] [2023-12-25 07:00:48,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:00:48,818 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 07:00:48,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:00:48,819 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 07:00:48,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-25 07:00:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:00:48,948 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-25 07:00:48,952 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:00:48,967 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 07:00:48,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-25 07:00:49,856 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 19 treesize of output 11 [2023-12-25 07:00:49,868 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 15 treesize of output 7 [2023-12-25 07:00:50,058 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 07:00:50,059 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:00:50,836 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 07:00:50,836 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:00:50,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1231305458] [2023-12-25 07:00:50,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1231305458] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 07:00:50,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 07:00:50,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 11 [2023-12-25 07:00:50,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737333373] [2023-12-25 07:00:50,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:00:50,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 07:00:50,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:00:50,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 07:00:50,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-12-25 07:00:50,838 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand has 8 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-25 07:00:52,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:00:52,441 INFO L93 Difference]: Finished difference Result 84 states and 102 transitions. [2023-12-25 07:00:52,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 07:00:52,442 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2023-12-25 07:00:52,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:00:52,444 INFO L225 Difference]: With dead ends: 84 [2023-12-25 07:00:52,444 INFO L226 Difference]: Without dead ends: 82 [2023-12-25 07:00:52,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2023-12-25 07:00:52,445 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 22 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-25 07:00:52,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 234 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-25 07:00:52,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-12-25 07:00:52,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2023-12-25 07:00:52,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 50 states have (on average 1.14) internal successors, (57), 54 states have internal predecessors, (57), 17 states have call successors, (17), 9 states have call predecessors, (17), 10 states have return successors, (21), 16 states have call predecessors, (21), 16 states have call successors, (21) [2023-12-25 07:00:52,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 95 transitions. [2023-12-25 07:00:52,460 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 95 transitions. Word has length 34 [2023-12-25 07:00:52,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:00:52,460 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 95 transitions. [2023-12-25 07:00:52,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-25 07:00:52,460 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2023-12-25 07:00:52,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-25 07:00:52,461 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:00:52,461 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:00:52,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-25 07:00:52,669 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 07:00:52,671 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:00:52,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:00:52,674 INFO L85 PathProgramCache]: Analyzing trace with hash -60903716, now seen corresponding path program 1 times [2023-12-25 07:00:52,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:00:52,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1576730131] [2023-12-25 07:00:52,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:00:52,679 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 07:00:52,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:00:52,680 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 07:00:52,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 (6)] Waiting until timeout for monitored process [2023-12-25 07:00:52,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:00:52,802 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 40 conjunts are in the unsatisfiable core [2023-12-25 07:00:52,808 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:00:52,823 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 07:00:52,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-25 07:00:52,912 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 11 treesize of output 7 [2023-12-25 07:00:53,699 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 19 treesize of output 11 [2023-12-25 07:00:53,709 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 15 treesize of output 7 [2023-12-25 07:00:53,973 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 07:00:53,973 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:00:57,877 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:00:57,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1576730131] [2023-12-25 07:00:57,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1576730131] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 07:00:57,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [936934411] [2023-12-25 07:00:57,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:00:57,878 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 07:00:57,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 07:00:57,918 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 07:00:57,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2023-12-25 07:00:58,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:00:58,139 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 55 conjunts are in the unsatisfiable core [2023-12-25 07:00:58,143 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:00:58,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-25 07:00:58,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-25 07:00:58,502 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 07:00:58,801 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 11 treesize of output 7 [2023-12-25 07:01:02,842 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 19 treesize of output 11 [2023-12-25 07:01:02,852 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 15 treesize of output 7 [2023-12-25 07:01:02,882 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 07:01:02,882 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:01:12,229 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-25 07:01:12,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [936934411] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:01:12,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-25 07:01:12,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 16, 13] total 30 [2023-12-25 07:01:12,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406414532] [2023-12-25 07:01:12,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-25 07:01:12,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-25 07:01:12,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:01:12,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-25 07:01:12,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=828, Unknown=0, NotChecked=0, Total=930 [2023-12-25 07:01:12,231 INFO L87 Difference]: Start difference. First operand 78 states and 95 transitions. Second operand has 30 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 25 states have internal predecessors, (57), 14 states have call successors, (20), 9 states have call predecessors, (20), 8 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2023-12-25 07:01:27,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 07:01:31,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 07:01:35,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 07:01:48,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 07:01:53,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 07:02:05,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:02:05,042 INFO L93 Difference]: Finished difference Result 140 states and 165 transitions. [2023-12-25 07:02:05,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-25 07:02:05,046 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 25 states have internal predecessors, (57), 14 states have call successors, (20), 9 states have call predecessors, (20), 8 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) Word has length 40 [2023-12-25 07:02:05,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:02:05,047 INFO L225 Difference]: With dead ends: 140 [2023-12-25 07:02:05,048 INFO L226 Difference]: Without dead ends: 138 [2023-12-25 07:02:05,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 109 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 27.6s TimeCoverageRelationStatistics Valid=356, Invalid=2495, Unknown=11, NotChecked=0, Total=2862 [2023-12-25 07:02:05,049 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 97 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 68 mSolverCounterUnsat, 20 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 20 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 37.3s IncrementalHoareTripleChecker+Time [2023-12-25 07:02:05,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 237 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 761 Invalid, 20 Unknown, 0 Unchecked, 37.3s Time] [2023-12-25 07:02:05,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-12-25 07:02:05,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 132. [2023-12-25 07:02:05,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 85 states have (on average 1.1176470588235294) internal successors, (95), 89 states have internal predecessors, (95), 25 states have call successors, (25), 17 states have call predecessors, (25), 21 states have return successors, (36), 25 states have call predecessors, (36), 23 states have call successors, (36) [2023-12-25 07:02:05,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 156 transitions. [2023-12-25 07:02:05,065 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 156 transitions. Word has length 40 [2023-12-25 07:02:05,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:02:05,066 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 156 transitions. [2023-12-25 07:02:05,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 25 states have internal predecessors, (57), 14 states have call successors, (20), 9 states have call predecessors, (20), 8 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2023-12-25 07:02:05,066 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 156 transitions. [2023-12-25 07:02:05,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-25 07:02:05,067 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:02:05,067 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:02:05,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2023-12-25 07:02:05,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-25 07:02:05,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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 07:02:05,476 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:02:05,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:02:05,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1144583588, now seen corresponding path program 1 times [2023-12-25 07:02:05,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:02:05,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [799403860] [2023-12-25 07:02:05,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:02:05,477 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 07:02:05,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:02:05,478 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 07:02:05,479 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 07:02:05,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:02:05,638 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 48 conjunts are in the unsatisfiable core [2023-12-25 07:02:05,645 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:02:05,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-25 07:02:05,679 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 07:02:06,560 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 29 treesize of output 17 [2023-12-25 07:02:06,583 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 07:02:07,408 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 21 treesize of output 13 [2023-12-25 07:02:07,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-25 07:02:07,741 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-25 07:02:07,742 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:02:12,394 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-25 07:02:12,395 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:02:12,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [799403860] [2023-12-25 07:02:12,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [799403860] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:02:12,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:02:12,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2023-12-25 07:02:12,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141305603] [2023-12-25 07:02:12,395 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:02:12,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-25 07:02:12,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:02:12,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-25 07:02:12,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2023-12-25 07:02:12,397 INFO L87 Difference]: Start difference. First operand 132 states and 156 transitions. Second operand has 20 states, 16 states have (on average 2.375) internal successors, (38), 14 states have internal predecessors, (38), 8 states have call successors, (16), 9 states have call predecessors, (16), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-25 07:02:20,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 07:02:31,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:02:31,373 INFO L93 Difference]: Finished difference Result 180 states and 204 transitions. [2023-12-25 07:02:31,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-25 07:02:31,374 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 2.375) internal successors, (38), 14 states have internal predecessors, (38), 8 states have call successors, (16), 9 states have call predecessors, (16), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 44 [2023-12-25 07:02:31,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:02:31,375 INFO L225 Difference]: With dead ends: 180 [2023-12-25 07:02:31,375 INFO L226 Difference]: Without dead ends: 178 [2023-12-25 07:02:31,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 60 SyntacticMatches, 8 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=161, Invalid=895, Unknown=0, NotChecked=0, Total=1056 [2023-12-25 07:02:31,376 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 118 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 35 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:02:31,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 483 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 569 Invalid, 1 Unknown, 0 Unchecked, 14.1s Time] [2023-12-25 07:02:31,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-12-25 07:02:31,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 146. [2023-12-25 07:02:31,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 95 states have (on average 1.105263157894737) internal successors, (105), 100 states have internal predecessors, (105), 26 states have call successors, (26), 20 states have call predecessors, (26), 24 states have return successors, (36), 26 states have call predecessors, (36), 24 states have call successors, (36) [2023-12-25 07:02:31,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 167 transitions. [2023-12-25 07:02:31,397 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 167 transitions. Word has length 44 [2023-12-25 07:02:31,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:02:31,397 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 167 transitions. [2023-12-25 07:02:31,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 2.375) internal successors, (38), 14 states have internal predecessors, (38), 8 states have call successors, (16), 9 states have call predecessors, (16), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-25 07:02:31,397 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 167 transitions. [2023-12-25 07:02:31,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-25 07:02:31,398 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:02:31,398 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:02:31,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-25 07:02:31,604 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 07:02:31,605 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:02:31,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:02:31,605 INFO L85 PathProgramCache]: Analyzing trace with hash -556833084, now seen corresponding path program 1 times [2023-12-25 07:02:31,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:02:31,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1202917293] [2023-12-25 07:02:31,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:02:31,606 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 07:02:31,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:02:31,607 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 07:02:31,608 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 07:02:31,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:02:31,762 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-25 07:02:31,764 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:02:31,784 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 07:02:31,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-25 07:02:32,501 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 11 treesize of output 7 [2023-12-25 07:02:32,763 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 19 treesize of output 11 [2023-12-25 07:02:32,772 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 15 treesize of output 7 [2023-12-25 07:02:32,948 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-25 07:02:32,949 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:02:34,659 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:02:34,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1202917293] [2023-12-25 07:02:34,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1202917293] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 07:02:34,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [307974985] [2023-12-25 07:02:34,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:02:34,660 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 07:02:34,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 07:02:34,665 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 07:02:34,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2023-12-25 07:02:34,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:02:34,920 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-25 07:02:34,923 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:02:34,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-25 07:02:35,073 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 07:02:35,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-25 07:02:35,983 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 11 treesize of output 7 [2023-12-25 07:02:36,206 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 19 treesize of output 11 [2023-12-25 07:02:36,216 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 15 treesize of output 7 [2023-12-25 07:02:36,244 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-25 07:02:36,244 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:02:41,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [307974985] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 07:02:41,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:02:41,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 11 [2023-12-25 07:02:41,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281363798] [2023-12-25 07:02:41,359 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:02:41,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-25 07:02:41,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:02:41,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-25 07:02:41,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-12-25 07:02:41,361 INFO L87 Difference]: Start difference. First operand 146 states and 167 transitions. Second operand has 11 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 6 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2023-12-25 07:02:48,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 07:02:52,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 07:02:53,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:02:53,102 INFO L93 Difference]: Finished difference Result 171 states and 196 transitions. [2023-12-25 07:02:53,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 07:02:53,102 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 6 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 50 [2023-12-25 07:02:53,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:02:53,104 INFO L225 Difference]: With dead ends: 171 [2023-12-25 07:02:53,104 INFO L226 Difference]: Without dead ends: 167 [2023-12-25 07:02:53,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 104 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2023-12-25 07:02:53,105 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 40 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 35 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2023-12-25 07:02:53,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 109 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 309 Invalid, 9 Unknown, 0 Unchecked, 11.3s Time] [2023-12-25 07:02:53,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-12-25 07:02:53,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 161. [2023-12-25 07:02:53,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 105 states have (on average 1.0952380952380953) internal successors, (115), 110 states have internal predecessors, (115), 29 states have call successors, (29), 23 states have call predecessors, (29), 26 states have return successors, (39), 29 states have call predecessors, (39), 26 states have call successors, (39) [2023-12-25 07:02:53,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 183 transitions. [2023-12-25 07:02:53,126 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 183 transitions. Word has length 50 [2023-12-25 07:02:53,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:02:53,126 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 183 transitions. [2023-12-25 07:02:53,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 6 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2023-12-25 07:02:53,127 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 183 transitions. [2023-12-25 07:02:53,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-25 07:02:53,128 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:02:53,128 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:02:53,137 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 07:02:53,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2023-12-25 07:02:53,531 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,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-25 07:02:53,531 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:02:53,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:02:53,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1068410477, now seen corresponding path program 1 times [2023-12-25 07:02:53,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:02:53,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1628896699] [2023-12-25 07:02:53,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:02:53,532 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 07:02:53,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:02:53,533 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 07:02:53,564 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 07:02:53,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:02:53,687 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-25 07:02:53,689 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:02:53,699 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 07:02:54,284 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-25 07:02:54,285 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:02:54,285 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:02:54,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1628896699] [2023-12-25 07:02:54,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1628896699] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:02:54,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:02:54,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-25 07:02:54,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459716829] [2023-12-25 07:02:54,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:02:54,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 07:02:54,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:02:54,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 07:02:54,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-25 07:02:54,287 INFO L87 Difference]: Start difference. First operand 161 states and 183 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-25 07:02:56,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:02:56,176 INFO L93 Difference]: Finished difference Result 248 states and 283 transitions. [2023-12-25 07:02:56,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 07:02:56,177 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 51 [2023-12-25 07:02:56,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:02:56,178 INFO L225 Difference]: With dead ends: 248 [2023-12-25 07:02:56,178 INFO L226 Difference]: Without dead ends: 195 [2023-12-25 07:02:56,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-12-25 07:02:56,179 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 42 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-25 07:02:56,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 117 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-25 07:02:56,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2023-12-25 07:02:56,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 181. [2023-12-25 07:02:56,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 118 states have (on average 1.0847457627118644) internal successors, (128), 123 states have internal predecessors, (128), 32 states have call successors, (32), 26 states have call predecessors, (32), 30 states have return successors, (43), 32 states have call predecessors, (43), 29 states have call successors, (43) [2023-12-25 07:02:56,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 203 transitions. [2023-12-25 07:02:56,201 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 203 transitions. Word has length 51 [2023-12-25 07:02:56,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:02:56,201 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 203 transitions. [2023-12-25 07:02:56,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-25 07:02:56,202 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 203 transitions. [2023-12-25 07:02:56,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-25 07:02:56,202 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:02:56,202 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:02:56,208 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 07:02:56,408 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 07:02:56,408 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:02:56,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:02:56,409 INFO L85 PathProgramCache]: Analyzing trace with hash 865304867, now seen corresponding path program 1 times [2023-12-25 07:02:56,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:02:56,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [886271910] [2023-12-25 07:02:56,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:02:56,409 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 07:02:56,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:02:56,410 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 07:02:56,412 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 07:02:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:02:56,540 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-25 07:02:56,542 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:02:56,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-25 07:02:56,600 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 11 treesize of output 7 [2023-12-25 07:02:56,761 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 11 treesize of output 7 [2023-12-25 07:03:00,924 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#d~0#1.offset_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#B~0#1.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#B~0#1.offset_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#d~0#1.base_BEFORE_CALL_11| (_ BitVec 32))) (= (select (select |c_#memory_int#2| |v_ULTIMATE.start_main_~#B~0#1.base_BEFORE_CALL_11|) |v_ULTIMATE.start_main_~#B~0#1.offset_BEFORE_CALL_11|) (select (select |c_#memory_int#0| |v_ULTIMATE.start_main_~#d~0#1.base_BEFORE_CALL_11|) |v_ULTIMATE.start_main_~#d~0#1.offset_BEFORE_CALL_11|))) is different from true [2023-12-25 07:03:00,993 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 19 treesize of output 11 [2023-12-25 07:03:01,001 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 15 treesize of output 7 [2023-12-25 07:03:01,141 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 2 not checked. [2023-12-25 07:03:01,141 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:03:01,524 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:03:01,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [886271910] [2023-12-25 07:03:01,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [886271910] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 07:03:01,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [793029007] [2023-12-25 07:03:01,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:03:01,524 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 07:03:01,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 07:03:01,525 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 07:03:01,526 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 07:03:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:03:01,654 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-25 07:03:01,656 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:03:01,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-25 07:03:01,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-25 07:03:01,901 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 11 treesize of output 7 [2023-12-25 07:03:02,026 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 11 treesize of output 7 [2023-12-25 07:03:06,202 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#B~0#1.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#B~0#1.offset_BEFORE_CALL_16| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#d~0#1.base_BEFORE_CALL_16| (_ BitVec 32))) (= (select (select |c_#memory_int#0| |v_ULTIMATE.start_main_~#d~0#1.base_BEFORE_CALL_16|) (_ bv0 32)) (select (select |c_#memory_int#2| |v_ULTIMATE.start_main_~#B~0#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_main_~#B~0#1.offset_BEFORE_CALL_16|))) is different from true [2023-12-25 07:03:06,344 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 19 treesize of output 11 [2023-12-25 07:03:06,353 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 15 treesize of output 7 [2023-12-25 07:03:06,378 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 2 not checked. [2023-12-25 07:03:06,379 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:03:06,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [793029007] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 07:03:06,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:03:06,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 11 [2023-12-25 07:03:06,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269479991] [2023-12-25 07:03:06,680 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:03:06,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-25 07:03:06,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:03:06,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-25 07:03:06,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=108, Unknown=2, NotChecked=42, Total=182 [2023-12-25 07:03:06,683 INFO L87 Difference]: Start difference. First operand 181 states and 203 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-25 07:03:20,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:03:20,484 INFO L93 Difference]: Finished difference Result 195 states and 217 transitions. [2023-12-25 07:03:20,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 07:03:20,485 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 56 [2023-12-25 07:03:20,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:03:20,486 INFO L225 Difference]: With dead ends: 195 [2023-12-25 07:03:20,486 INFO L226 Difference]: Without dead ends: 163 [2023-12-25 07:03:20,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 130 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 21.0s TimeCoverageRelationStatistics Valid=55, Invalid=188, Unknown=5, NotChecked=58, Total=306 [2023-12-25 07:03:20,487 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 11 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-25 07:03:20,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 139 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 178 Invalid, 0 Unknown, 122 Unchecked, 1.5s Time] [2023-12-25 07:03:20,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-12-25 07:03:20,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2023-12-25 07:03:20,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 105 states have (on average 1.0857142857142856) internal successors, (114), 109 states have internal predecessors, (114), 29 states have call successors, (29), 23 states have call predecessors, (29), 26 states have return successors, (39), 29 states have call predecessors, (39), 26 states have call successors, (39) [2023-12-25 07:03:20,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 182 transitions. [2023-12-25 07:03:20,505 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 182 transitions. Word has length 56 [2023-12-25 07:03:20,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:03:20,505 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 182 transitions. [2023-12-25 07:03:20,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-25 07:03:20,506 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 182 transitions. [2023-12-25 07:03:20,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-25 07:03:20,506 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:03:20,506 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:03:20,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Ended with exit code 0 [2023-12-25 07:03:20,716 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 07:03:20,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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 07:03:20,913 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:03:20,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:03:20,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1190574005, now seen corresponding path program 1 times [2023-12-25 07:03:20,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:03:20,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [178863271] [2023-12-25 07:03:20,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:03:20,914 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 07:03:20,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:03:20,916 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:03:20,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-25 07:03:21,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:03:21,434 INFO L262 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 146 conjunts are in the unsatisfiable core [2023-12-25 07:03:21,439 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:03:21,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 15 treesize of output 11 [2023-12-25 07:03:21,479 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 07:03:21,502 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 07:03:21,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-25 07:03:21,637 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 11 treesize of output 7 [2023-12-25 07:03:24,179 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 11 treesize of output 7 [2023-12-25 07:03:26,325 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 40 treesize of output 24 [2023-12-25 07:03:26,425 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 07:04:01,453 INFO L349 Elim1Store]: treesize reduction 29, result has 34.1 percent of original size [2023-12-25 07:04:01,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 29 [2023-12-25 07:04:01,798 INFO L349 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2023-12-25 07:04:01,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 71 [2023-12-25 07:04:04,772 INFO L349 Elim1Store]: treesize reduction 164, result has 39.9 percent of original size [2023-12-25 07:04:04,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 242 treesize of output 286 [2023-12-25 07:04:05,057 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 07:04:05,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 170 treesize of output 186 [2023-12-25 07:04:11,970 INFO L349 Elim1Store]: treesize reduction 68, result has 31.3 percent of original size [2023-12-25 07:04:11,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 47 [2023-12-25 07:04:31,800 WARN L293 SmtUtils]: Spent 13.98s on a formula simplification that was a NOOP. DAG size: 589 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-25 07:04:31,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 07:04:31,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 680 treesize of output 1632 [2023-12-25 07:04:50,947 WARN L293 SmtUtils]: Spent 19.02s on a formula simplification that was a NOOP. DAG size: 589 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-25 07:04:50,948 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 07:04:50,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 514 treesize of output 1450 [2023-12-25 07:05:29,603 WARN L293 SmtUtils]: Spent 38.28s on a formula simplification that was a NOOP. DAG size: 973 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-25 07:05:29,603 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 07:05:29,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 18 select indices, 18 select index equivalence classes, 0 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 153 case distinctions, treesize of input 417 treesize of output 2125 Received shutdown request... [2023-12-25 07:15:05,195 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 07:15:05,202 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 07:15:05,202 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 07:15:05,202 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 (14)] Ended with exit code 0 [2023-12-25 07:15:05,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:15:05,402 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 76 with TraceHistMax 9,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-346-13-5-1 context. [2023-12-25 07:15:05,406 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:15:05,408 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 07:15:05,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 07:15:05 BoogieIcfgContainer [2023-12-25 07:15:05,409 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 07:15:05,409 INFO L158 Benchmark]: Toolchain (without parser) took 877437.57ms. Allocated memory was 232.8MB in the beginning and 280.0MB in the end (delta: 47.2MB). Free memory was 193.3MB in the beginning and 170.6MB in the end (delta: 22.7MB). Peak memory consumption was 171.3MB. Max. memory is 8.0GB. [2023-12-25 07:15:05,409 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 194.0MB. Free memory was 162.2MB in the beginning and 162.1MB in the end (delta: 25.1kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 07:15:05,409 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.14ms. Allocated memory is still 232.8MB. Free memory was 192.7MB in the beginning and 180.7MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 07:15:05,410 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.03ms. Allocated memory is still 232.8MB. Free memory was 180.7MB in the beginning and 179.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 07:15:05,410 INFO L158 Benchmark]: Boogie Preprocessor took 35.29ms. Allocated memory is still 232.8MB. Free memory was 179.1MB in the beginning and 176.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-25 07:15:05,410 INFO L158 Benchmark]: RCFGBuilder took 440.74ms. Allocated memory is still 232.8MB. Free memory was 176.0MB in the beginning and 153.4MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2023-12-25 07:15:05,410 INFO L158 Benchmark]: TraceAbstraction took 876740.27ms. Allocated memory was 232.8MB in the beginning and 280.0MB in the end (delta: 47.2MB). Free memory was 152.9MB in the beginning and 170.6MB in the end (delta: -17.7MB). Peak memory consumption was 130.4MB. Max. memory is 8.0GB. [2023-12-25 07:15:05,411 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 194.0MB. Free memory was 162.2MB in the beginning and 162.1MB in the end (delta: 25.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 192.14ms. Allocated memory is still 232.8MB. Free memory was 192.7MB in the beginning and 180.7MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.03ms. Allocated memory is still 232.8MB. Free memory was 180.7MB in the beginning and 179.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.29ms. Allocated memory is still 232.8MB. Free memory was 179.1MB in the beginning and 176.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 440.74ms. Allocated memory is still 232.8MB. Free memory was 176.0MB in the beginning and 153.4MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 876740.27ms. Allocated memory was 232.8MB in the beginning and 280.0MB in the end (delta: 47.2MB). Free memory was 152.9MB in the beginning and 170.6MB in the end (delta: -17.7MB). Peak memory consumption was 130.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 41). Cancelled while NwaCegarLoop was analyzing trace of length 76 with TraceHistMax 9,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-346-13-5-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 876.7s, OverallIterations: 10, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 111.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 31 mSolverCounterUnknown, 405 SdHoareTripleChecker+Valid, 76.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 383 mSDsluCounter, 2008 SdHoareTripleChecker+Invalid, 72.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 122 IncrementalHoareTripleChecker+Unchecked, 1696 mSDsCounter, 220 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2397 IncrementalHoareTripleChecker+Invalid, 2770 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 220 mSolverCounterUnsat, 312 mSDtfsCounter, 2397 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 750 GetRequests, 549 SyntacticMatches, 27 SemanticMatches, 174 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 75.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=181occurred in iteration=8, InterpolantAutomatonStates: 118, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 65 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 55.8s InterpolantComputationTime, 469 NumberOfCodeBlocks, 469 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 608 ConstructedInterpolants, 128 QuantifiedInterpolants, 5730 SizeOfPredicates, 188 NumberOfNonLiveVariables, 2139 ConjunctsInSsa, 338 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 433/563 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown