/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_mannadiv.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 07:01:36,242 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 07:01:36,295 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:01:36,302 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 07:01:36,303 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 07:01:36,333 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 07:01:36,333 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 07:01:36,333 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 07:01:36,334 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 07:01:36,334 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 07:01:36,335 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 07:01:36,335 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 07:01:36,336 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 07:01:36,336 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 07:01:36,336 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 07:01:36,337 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 07:01:36,337 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 07:01:36,337 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 07:01:36,337 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 07:01:36,338 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 07:01:36,338 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 07:01:36,341 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 07:01:36,341 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 07:01:36,341 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 07:01:36,342 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 07:01:36,342 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 07:01:36,342 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 07:01:36,342 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 07:01:36,342 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 07:01:36,343 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 07:01:36,343 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 07:01:36,343 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 07:01:36,343 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 07:01:36,343 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 07:01:36,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 07:01:36,344 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 07:01:36,344 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 07:01:36,344 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 07:01:36,344 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 07:01:36,344 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 07:01:36,345 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 07:01:36,345 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 07:01:36,345 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 07:01:36,345 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 07:01:36,345 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 07:01:36,345 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 07:01:36,346 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:01:36,550 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 07:01:36,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 07:01:36,571 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 07:01:36,573 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 07:01:36,573 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 07:01:36,574 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursified_nla-digbench/recursified_mannadiv.c [2023-12-25 07:01:37,679 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 07:01:37,800 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 07:01:37,800 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursified_nla-digbench/recursified_mannadiv.c [2023-12-25 07:01:37,805 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6d981e09/9113870c5f5241328dccb9898a3b0455/FLAG41df535e2 [2023-12-25 07:01:37,814 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6d981e09/9113870c5f5241328dccb9898a3b0455 [2023-12-25 07:01:37,816 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 07:01:37,817 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 07:01:37,818 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 07:01:37,818 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 07:01:37,821 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 07:01:37,822 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 07:01:37" (1/1) ... [2023-12-25 07:01:37,823 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17f63b42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:01:37, skipping insertion in model container [2023-12-25 07:01:37,823 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 07:01:37" (1/1) ... [2023-12-25 07:01:37,837 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 07:01:37,955 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_mannadiv.c[1105,1118] [2023-12-25 07:01:37,975 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 07:01:37,988 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 07:01:37,996 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_mannadiv.c[1105,1118] [2023-12-25 07:01:38,002 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 07:01:38,012 INFO L206 MainTranslator]: Completed translation [2023-12-25 07:01:38,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:01:38 WrapperNode [2023-12-25 07:01:38,013 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 07:01:38,014 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 07:01:38,014 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 07:01:38,014 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 07:01:38,019 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:01:38" (1/1) ... [2023-12-25 07:01:38,026 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:01:38" (1/1) ... [2023-12-25 07:01:38,041 INFO L138 Inliner]: procedures = 18, calls = 57, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 63 [2023-12-25 07:01:38,042 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 07:01:38,042 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 07:01:38,042 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 07:01:38,042 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 07:01:38,049 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:01:38" (1/1) ... [2023-12-25 07:01:38,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:01:38" (1/1) ... [2023-12-25 07:01:38,051 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:01:38" (1/1) ... [2023-12-25 07:01:38,061 INFO L175 MemorySlicer]: Split 31 memory accesses to 6 slices as follows [2, 5, 7, 5, 5, 7]. 23 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0]. The 10 writes are split as follows [0, 1, 3, 2, 1, 3]. [2023-12-25 07:01:38,061 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:01:38" (1/1) ... [2023-12-25 07:01:38,061 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:01:38" (1/1) ... [2023-12-25 07:01:38,069 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:01:38" (1/1) ... [2023-12-25 07:01:38,071 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:01:38" (1/1) ... [2023-12-25 07:01:38,072 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:01:38" (1/1) ... [2023-12-25 07:01:38,073 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:01:38" (1/1) ... [2023-12-25 07:01:38,075 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 07:01:38,079 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 07:01:38,079 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 07:01:38,079 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 07:01:38,080 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:01:38" (1/1) ... [2023-12-25 07:01:38,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 07:01:38,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 07:01:38,110 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:01:38,119 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:01:38,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 07:01:38,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 07:01:38,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-25 07:01:38,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-25 07:01:38,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-25 07:01:38,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-12-25 07:01:38,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2023-12-25 07:01:38,148 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 07:01:38,148 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 07:01:38,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-25 07:01:38,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-25 07:01:38,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-25 07:01:38,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-25 07:01:38,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-12-25 07:01:38,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2023-12-25 07:01:38,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2023-12-25 07:01:38,149 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_31_to_42_0 [2023-12-25 07:01:38,149 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_31_to_42_0 [2023-12-25 07:01:38,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 07:01:38,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 07:01:38,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 07:01:38,150 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 07:01:38,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-25 07:01:38,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-25 07:01:38,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-25 07:01:38,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-25 07:01:38,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-12-25 07:01:38,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-12-25 07:01:38,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2023-12-25 07:01:38,251 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 07:01:38,253 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 07:01:38,453 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 07:01:38,476 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 07:01:38,476 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 07:01:38,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 07:01:38 BoogieIcfgContainer [2023-12-25 07:01:38,477 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 07:01:38,478 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 07:01:38,478 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 07:01:38,481 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 07:01:38,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 07:01:37" (1/3) ... [2023-12-25 07:01:38,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b5d80b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 07:01:38, skipping insertion in model container [2023-12-25 07:01:38,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:01:38" (2/3) ... [2023-12-25 07:01:38,482 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b5d80b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 07:01:38, skipping insertion in model container [2023-12-25 07:01:38,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 07:01:38" (3/3) ... [2023-12-25 07:01:38,483 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_mannadiv.c [2023-12-25 07:01:38,497 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 07:01:38,497 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 07:01:38,539 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 07:01:38,544 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;@1974dbf6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 07:01:38,544 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 07:01:38,548 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 20 states have internal predecessors, (24), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 07:01:38,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-25 07:01:38,553 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:01:38,553 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:01:38,554 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:01:38,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:01:38,560 INFO L85 PathProgramCache]: Analyzing trace with hash 432807151, now seen corresponding path program 1 times [2023-12-25 07:01:38,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:01:38,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [122476974] [2023-12-25 07:01:38,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:01:38,571 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:01:38,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:01:38,573 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:01:38,576 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:01:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:01:38,673 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 07:01:38,677 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:01:38,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 07:01:38,693 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:01:38,693 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:01:38,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [122476974] [2023-12-25 07:01:38,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [122476974] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:01:38,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:01:38,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 07:01:38,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459103841] [2023-12-25 07:01:38,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:01:38,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 07:01:38,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:01:38,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 07:01:38,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 07:01:38,740 INFO L87 Difference]: Start difference. First operand has 29 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 20 states have internal predecessors, (24), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 07:01:38,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:01:38,789 INFO L93 Difference]: Finished difference Result 56 states and 75 transitions. [2023-12-25 07:01:38,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 07:01:38,791 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2023-12-25 07:01:38,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:01:38,795 INFO L225 Difference]: With dead ends: 56 [2023-12-25 07:01:38,795 INFO L226 Difference]: Without dead ends: 27 [2023-12-25 07:01:38,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 07:01:38,801 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:01:38,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:01:38,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-25 07:01:38,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-12-25 07:01:38,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-25 07:01:38,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2023-12-25 07:01:38,830 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 20 [2023-12-25 07:01:38,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:01:38,830 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2023-12-25 07:01:38,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 07:01:38,831 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2023-12-25 07:01:38,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-25 07:01:38,836 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:01:38,836 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:01:38,839 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:01:39,037 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:01:39,037 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:01:39,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:01:39,038 INFO L85 PathProgramCache]: Analyzing trace with hash -454476173, now seen corresponding path program 1 times [2023-12-25 07:01:39,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:01:39,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1966424203] [2023-12-25 07:01:39,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:01:39,039 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:01:39,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:01:39,040 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:01:39,041 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:01:39,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:01:39,159 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 40 conjunts are in the unsatisfiable core [2023-12-25 07:01:39,164 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:01:39,335 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:01:39,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 11 treesize of output 7 [2023-12-25 07:01:39,360 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:01:39,561 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:39,566 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 22 treesize of output 10 [2023-12-25 07:01:39,636 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:01:39,636 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:01:40,936 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 07:01:40,937 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:01:40,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1966424203] [2023-12-25 07:01:40,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1966424203] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 07:01:40,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 07:01:40,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 19 [2023-12-25 07:01:40,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469381687] [2023-12-25 07:01:40,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:01:40,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 07:01:40,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:01:40,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 07:01:40,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2023-12-25 07:01:40,943 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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:01:45,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-25 07:01:50,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-25 07:01:50,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:01:50,663 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2023-12-25 07:01:50,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 07:01:50,668 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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 20 [2023-12-25 07:01:50,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:01:50,671 INFO L225 Difference]: With dead ends: 46 [2023-12-25 07:01:50,671 INFO L226 Difference]: Without dead ends: 44 [2023-12-25 07:01:50,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2023-12-25 07:01:50,673 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 19 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:01:50,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 125 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 9.0s Time] [2023-12-25 07:01:50,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-25 07:01:50,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2023-12-25 07:01:50,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2023-12-25 07:01:50,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2023-12-25 07:01:50,684 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 20 [2023-12-25 07:01:50,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:01:50,684 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2023-12-25 07:01:50,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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:01:50,684 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2023-12-25 07:01:50,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-25 07:01:50,685 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:01:50,685 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:01:50,706 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:01:50,886 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:01:50,886 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:01:50,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:01:50,887 INFO L85 PathProgramCache]: Analyzing trace with hash 443267008, now seen corresponding path program 1 times [2023-12-25 07:01:50,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:01:50,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [816106195] [2023-12-25 07:01:50,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:01:50,887 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:01:50,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:01:50,891 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:01:50,894 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:01:50,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:01:51,002 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-25 07:01:51,007 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:01:51,132 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:01:51,144 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:01:51,162 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:01:51,231 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:51,661 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:01:51,661 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:01:52,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:01:52,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [816106195] [2023-12-25 07:01:52,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [816106195] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 07:01:52,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2132553730] [2023-12-25 07:01:52,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:01:52,892 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 07:01:52,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 07:01:52,965 INFO L229 MonitoredProcess]: Starting monitored process 5 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:01:52,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2023-12-25 07:01:53,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:01:53,105 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-25 07:01:53,107 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:01:53,214 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:01:53,222 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:01:53,232 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:01:53,316 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:53,894 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 07:01:53,894 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:01:53,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2132553730] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:01:53,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 07:01:53,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [16] total 23 [2023-12-25 07:01:53,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824649227] [2023-12-25 07:01:53,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:01:53,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-25 07:01:53,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:01:53,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-25 07:01:53,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=666, Unknown=0, NotChecked=0, Total=756 [2023-12-25 07:01:53,901 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand has 12 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-25 07:01:55,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:01:55,419 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2023-12-25 07:01:55,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 07:01:55,421 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2023-12-25 07:01:55,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:01:55,422 INFO L225 Difference]: With dead ends: 52 [2023-12-25 07:01:55,422 INFO L226 Difference]: Without dead ends: 44 [2023-12-25 07:01:55,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=138, Invalid=984, Unknown=0, NotChecked=0, Total=1122 [2023-12-25 07:01:55,423 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 20 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:01:55,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 64 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-25 07:01:55,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-25 07:01:55,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-12-25 07:01:55,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 31 states have internal predecessors, (33), 8 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2023-12-25 07:01:55,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2023-12-25 07:01:55,430 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 30 [2023-12-25 07:01:55,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:01:55,431 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2023-12-25 07:01:55,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-25 07:01:55,431 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2023-12-25 07:01:55,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-25 07:01:55,432 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:01:55,432 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:01:55,438 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:01:55,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2023-12-25 07:01:55,838 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,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-25 07:01:55,838 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:01:55,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:01:55,839 INFO L85 PathProgramCache]: Analyzing trace with hash -746539634, now seen corresponding path program 1 times [2023-12-25 07:01:55,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:01:55,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [248725551] [2023-12-25 07:01:55,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:01:55,839 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:01:55,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:01:55,840 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:01:55,843 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:01:55,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:01:55,945 WARN L260 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 83 conjunts are in the unsatisfiable core [2023-12-25 07:01:55,950 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:01:56,034 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:01:56,041 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:01:56,050 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:01:56,549 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:01:56,557 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:01:56,567 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 37 treesize of output 21 [2023-12-25 07:01:56,804 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 31 treesize of output 19 [2023-12-25 07:01:56,809 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 32 treesize of output 16 [2023-12-25 07:01:56,919 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:01:56,919 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:01:58,819 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 45 treesize of output 33 [2023-12-25 07:02:01,963 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 07:02:01,963 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:02:01,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [248725551] [2023-12-25 07:02:01,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [248725551] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:02:01,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:02:01,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12] total 28 [2023-12-25 07:02:01,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682604604] [2023-12-25 07:02:01,964 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:02:01,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-25 07:02:01,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:02:01,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-25 07:02:01,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2023-12-25 07:02:01,965 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 28 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 22 states have internal predecessors, (40), 11 states have call successors, (12), 9 states have call predecessors, (12), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-25 07:02:06,550 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:15,398 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:47,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.95s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 07:02:50,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 07:02:58,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 07:03:00,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 07:03:01,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:03:01,284 INFO L93 Difference]: Finished difference Result 101 states and 124 transitions. [2023-12-25 07:03:01,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-12-25 07:03:01,286 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 22 states have internal predecessors, (40), 11 states have call successors, (12), 9 states have call predecessors, (12), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 31 [2023-12-25 07:03:01,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:03:01,287 INFO L225 Difference]: With dead ends: 101 [2023-12-25 07:03:01,288 INFO L226 Difference]: Without dead ends: 95 [2023-12-25 07:03:01,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 696 ImplicationChecksByTransitivity, 39.8s TimeCoverageRelationStatistics Valid=428, Invalid=2652, Unknown=0, NotChecked=0, Total=3080 [2023-12-25 07:03:01,289 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 145 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 57 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.4s IncrementalHoareTripleChecker+Time [2023-12-25 07:03:01,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 224 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 491 Invalid, 2 Unknown, 0 Unchecked, 24.4s Time] [2023-12-25 07:03:01,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-12-25 07:03:01,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 91. [2023-12-25 07:03:01,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 60 states have (on average 1.15) internal successors, (69), 64 states have internal predecessors, (69), 15 states have call successors, (15), 12 states have call predecessors, (15), 15 states have return successors, (28), 14 states have call predecessors, (28), 14 states have call successors, (28) [2023-12-25 07:03:01,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 112 transitions. [2023-12-25 07:03:01,318 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 112 transitions. Word has length 31 [2023-12-25 07:03:01,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:03:01,318 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 112 transitions. [2023-12-25 07:03:01,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 22 states have internal predecessors, (40), 11 states have call successors, (12), 9 states have call predecessors, (12), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-25 07:03:01,318 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 112 transitions. [2023-12-25 07:03:01,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-25 07:03:01,319 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:03:01,319 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-12-25 07:03:01,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-25 07:03:01,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:03:01,520 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:03:01,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:03:01,521 INFO L85 PathProgramCache]: Analyzing trace with hash 230239702, now seen corresponding path program 1 times [2023-12-25 07:03:01,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:03:01,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [518526634] [2023-12-25 07:03:01,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:03:01,521 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:01,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:03:01,523 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:03:01,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-25 07:03:01,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:03:01,645 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 90 conjunts are in the unsatisfiable core [2023-12-25 07:03:01,649 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:03:01,731 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:01,737 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:01,744 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,781 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:03,006 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 13 treesize of output 9 [2023-12-25 07:03:07,563 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:03:07,587 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-25 07:03:07,587 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 3 [2023-12-25 07:03:08,151 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-25 07:03:08,151 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:04:55,529 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:04:55,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [518526634] [2023-12-25 07:04:55,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [518526634] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 07:04:55,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [850790122] [2023-12-25 07:04:55,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:04:55,530 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 07:04:55,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 07:04:55,531 INFO L229 MonitoredProcess]: Starting monitored process 8 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:04:55,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2023-12-25 07:04:55,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:04:55,703 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 64 conjunts are in the unsatisfiable core [2023-12-25 07:04:55,708 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:04:55,720 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:04:56,851 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:04:56,881 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:04:56,929 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:04:57,951 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:05:07,163 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 13 treesize of output 9 [2023-12-25 07:05:17,887 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:05:17,914 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:05:19,185 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-25 07:05:19,186 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:05:54,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [850790122] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 07:05:54,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:05:54,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 16] total 34 [2023-12-25 07:05:54,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252762120] [2023-12-25 07:05:54,576 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:05:54,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-25 07:05:54,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:05:54,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-25 07:05:54,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1967, Unknown=23, NotChecked=0, Total=2162 [2023-12-25 07:05:54,577 INFO L87 Difference]: Start difference. First operand 91 states and 112 transitions. Second operand has 34 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 28 states have internal predecessors, (50), 12 states have call successors, (13), 5 states have call predecessors, (13), 8 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2023-12-25 07:05:59,923 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:06:47,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:06:47,915 INFO L93 Difference]: Finished difference Result 102 states and 127 transitions. [2023-12-25 07:06:47,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-25 07:06:47,922 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 28 states have internal predecessors, (50), 12 states have call successors, (13), 5 states have call predecessors, (13), 8 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) Word has length 43 [2023-12-25 07:06:47,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:06:47,923 INFO L225 Difference]: With dead ends: 102 [2023-12-25 07:06:47,923 INFO L226 Difference]: Without dead ends: 92 [2023-12-25 07:06:47,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1053 ImplicationChecksByTransitivity, 192.2s TimeCoverageRelationStatistics Valid=363, Invalid=4032, Unknown=27, NotChecked=0, Total=4422 [2023-12-25 07:06:47,925 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 46 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.4s IncrementalHoareTripleChecker+Time [2023-12-25 07:06:47,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 81 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 715 Invalid, 1 Unknown, 0 Unchecked, 14.4s Time] [2023-12-25 07:06:47,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-12-25 07:06:47,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2023-12-25 07:06:47,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 60 states have (on average 1.1333333333333333) internal successors, (68), 64 states have internal predecessors, (68), 16 states have call successors, (16), 12 states have call predecessors, (16), 15 states have return successors, (33), 15 states have call predecessors, (33), 15 states have call successors, (33) [2023-12-25 07:06:47,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 117 transitions. [2023-12-25 07:06:47,941 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 117 transitions. Word has length 43 [2023-12-25 07:06:47,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:06:47,941 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 117 transitions. [2023-12-25 07:06:47,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 28 states have internal predecessors, (50), 12 states have call successors, (13), 5 states have call predecessors, (13), 8 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2023-12-25 07:06:47,941 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 117 transitions. [2023-12-25 07:06:47,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-25 07:06:47,942 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:06:47,942 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-12-25 07:06:47,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-25 07:06:48,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2023-12-25 07:06:48,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-25 07:06:48,347 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:06:48,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:06:48,349 INFO L85 PathProgramCache]: Analyzing trace with hash -587408748, now seen corresponding path program 1 times [2023-12-25 07:06:48,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:06:48,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1402030403] [2023-12-25 07:06:48,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:06:48,349 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:06:48,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:06:48,350 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:06:48,351 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:06:48,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:06:48,460 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 74 conjunts are in the unsatisfiable core [2023-12-25 07:06:48,463 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:06:48,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 11 treesize of output 7 [2023-12-25 07:06:48,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 11 treesize of output 7 [2023-12-25 07:06:48,867 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:06:49,030 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:06:56,329 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-25 07:06:56,330 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 3 [2023-12-25 07:06:57,565 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-25 07:06:57,565 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:07:09,969 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:07:09,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1402030403] [2023-12-25 07:07:09,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1402030403] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 07:07:09,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [273581734] [2023-12-25 07:07:09,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:07:09,970 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 07:07:09,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 07:07:09,973 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:07:09,974 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:07:10,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:07:10,182 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 52 conjunts are in the unsatisfiable core [2023-12-25 07:07:10,184 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:07:10,209 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:07:10,774 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:07:10,826 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:07:10,852 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:07:11,339 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:07:23,828 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:07:24,421 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-25 07:07:24,421 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:07:27,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [273581734] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 07:07:27,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:07:27,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 15] total 32 [2023-12-25 07:07:27,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257570986] [2023-12-25 07:07:27,301 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:07:27,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-25 07:07:27,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:07:27,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-25 07:07:27,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1274, Unknown=2, NotChecked=0, Total=1406 [2023-12-25 07:07:27,302 INFO L87 Difference]: Start difference. First operand 92 states and 117 transitions. Second operand has 32 states, 25 states have (on average 2.0) internal successors, (50), 26 states have internal predecessors, (50), 12 states have call successors, (13), 5 states have call predecessors, (13), 8 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2023-12-25 07:07:32,258 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:07:59,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:07:59,111 INFO L93 Difference]: Finished difference Result 98 states and 122 transitions. [2023-12-25 07:07:59,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-25 07:07:59,112 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 25 states have (on average 2.0) internal successors, (50), 26 states have internal predecessors, (50), 12 states have call successors, (13), 5 states have call predecessors, (13), 8 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) Word has length 43 [2023-12-25 07:07:59,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:07:59,113 INFO L225 Difference]: With dead ends: 98 [2023-12-25 07:07:59,113 INFO L226 Difference]: Without dead ends: 88 [2023-12-25 07:07:59,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 44.5s TimeCoverageRelationStatistics Valid=306, Invalid=2998, Unknown=2, NotChecked=0, Total=3306 [2023-12-25 07:07:59,114 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 42 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 19 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2023-12-25 07:07:59,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 101 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 645 Invalid, 1 Unknown, 0 Unchecked, 11.3s Time] [2023-12-25 07:07:59,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-12-25 07:07:59,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-12-25 07:07:59,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 61 states have internal predecessors, (65), 16 states have call successors, (16), 12 states have call predecessors, (16), 13 states have return successors, (31), 14 states have call predecessors, (31), 15 states have call successors, (31) [2023-12-25 07:07:59,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 112 transitions. [2023-12-25 07:07:59,135 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 112 transitions. Word has length 43 [2023-12-25 07:07:59,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:07:59,135 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 112 transitions. [2023-12-25 07:07:59,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 25 states have (on average 2.0) internal successors, (50), 26 states have internal predecessors, (50), 12 states have call successors, (13), 5 states have call predecessors, (13), 8 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2023-12-25 07:07:59,135 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 112 transitions. [2023-12-25 07:07:59,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-25 07:07:59,137 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:07:59,137 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:07:59,145 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:07:59,349 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:07:59,543 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:07:59,543 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:07:59,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:07:59,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1603601130, now seen corresponding path program 2 times [2023-12-25 07:07:59,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:07:59,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1086603151] [2023-12-25 07:07:59,544 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 07:07:59,544 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:07:59,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:07:59,545 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:07:59,546 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:07:59,743 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 07:07:59,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 07:07:59,753 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 97 conjunts are in the unsatisfiable core [2023-12-25 07:07:59,758 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:07:59,781 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:08:00,154 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:08:00,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-25 07:08:02,281 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 13 treesize of output 9 [2023-12-25 07:08:03,594 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:08:06,320 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 36 treesize of output 28 [2023-12-25 07:08:11,997 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:08:12,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-25 07:08:13,379 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 28 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-25 07:08:13,380 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:08:33,722 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 86 treesize of output 82 [2023-12-25 07:11:15,645 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:11:15,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1086603151] [2023-12-25 07:11:15,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1086603151] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 07:11:15,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [969075125] [2023-12-25 07:11:15,646 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 07:11:15,646 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 07:11:15,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 07:11:15,648 INFO L229 MonitoredProcess]: Starting monitored process 12 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:11:15,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2023-12-25 07:11:15,979 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 07:11:15,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 07:11:15,984 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 93 conjunts are in the unsatisfiable core [2023-12-25 07:11:15,995 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:11:16,020 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:11:21,197 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:11:21,240 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:11:21,284 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:11:26,362 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:11:51,971 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 13 treesize of output 9 [2023-12-25 07:12:02,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-25 07:12:46,930 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:12:46,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-25 07:12:52,319 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-25 07:12:52,319 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:13:24,085 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 86 treesize of output 82 [2023-12-25 07:13:24,355 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 86 treesize of output 82 [2023-12-25 07:13:24,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 86 treesize of output 82 [2023-12-25 07:13:40,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [969075125] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 07:13:40,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:13:40,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 20] total 42 [2023-12-25 07:13:40,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287776120] [2023-12-25 07:13:40,632 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:13:40,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-12-25 07:13:40,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:13:40,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-12-25 07:13:40,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2525, Unknown=59, NotChecked=0, Total=2756 [2023-12-25 07:13:40,635 INFO L87 Difference]: Start difference. First operand 88 states and 112 transitions. Second operand has 42 states, 33 states have (on average 1.878787878787879) internal successors, (62), 34 states have internal predecessors, (62), 16 states have call successors, (17), 7 states have call predecessors, (17), 10 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2023-12-25 07:13:46,714 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:15:05,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:15:05,357 INFO L93 Difference]: Finished difference Result 104 states and 157 transitions. [2023-12-25 07:15:05,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-25 07:15:05,358 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 33 states have (on average 1.878787878787879) internal successors, (62), 34 states have internal predecessors, (62), 16 states have call successors, (17), 7 states have call predecessors, (17), 10 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) Word has length 56 [2023-12-25 07:15:05,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:15:05,359 INFO L225 Difference]: With dead ends: 104 [2023-12-25 07:15:05,359 INFO L226 Difference]: Without dead ends: 94 [2023-12-25 07:15:05,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 76 SyntacticMatches, 6 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1352 ImplicationChecksByTransitivity, 366.0s TimeCoverageRelationStatistics Valid=450, Invalid=5489, Unknown=67, NotChecked=0, Total=6006 [2023-12-25 07:15:05,362 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 58 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 1163 mSolverCounterSat, 39 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1163 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.8s IncrementalHoareTripleChecker+Time [2023-12-25 07:15:05,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 132 Invalid, 1203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1163 Invalid, 1 Unknown, 0 Unchecked, 20.8s Time] [2023-12-25 07:15:05,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-12-25 07:15:05,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 88. [2023-12-25 07:15:05,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.103448275862069) internal successors, (64), 60 states have internal predecessors, (64), 16 states have call successors, (16), 12 states have call predecessors, (16), 13 states have return successors, (41), 15 states have call predecessors, (41), 15 states have call successors, (41) [2023-12-25 07:15:05,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 121 transitions. [2023-12-25 07:15:05,378 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 121 transitions. Word has length 56 [2023-12-25 07:15:05,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:15:05,379 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 121 transitions. [2023-12-25 07:15:05,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 33 states have (on average 1.878787878787879) internal successors, (62), 34 states have internal predecessors, (62), 16 states have call successors, (17), 7 states have call predecessors, (17), 10 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2023-12-25 07:15:05,379 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 121 transitions. [2023-12-25 07:15:05,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-25 07:15:05,380 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:15:05,380 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:15:05,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-25 07:15:05,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2023-12-25 07:15:05,787 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,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-25 07:15:05,787 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:15:05,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:15:05,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1384746412, now seen corresponding path program 1 times [2023-12-25 07:15:05,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:15:05,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1417276265] [2023-12-25 07:15:05,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:15:05,788 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:15:05,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:15:05,789 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:15:05,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-25 07:15:05,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:15:05,932 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-25 07:15:05,934 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:15:05,944 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:15:06,669 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 13 treesize of output 9 [2023-12-25 07:15:07,060 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 14 treesize of output 10 [2023-12-25 07:15:07,244 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-12-25 07:15:07,245 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:15:08,411 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 22 treesize of output 14 [2023-12-25 07:15:10,059 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 22 treesize of output 14 [2023-12-25 07:15:10,420 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-25 07:15:10,421 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:15:10,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1417276265] [2023-12-25 07:15:10,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1417276265] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:15:10,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:15:10,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 18 [2023-12-25 07:15:10,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674753570] [2023-12-25 07:15:10,421 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:15:10,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-25 07:15:10,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:15:10,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-25 07:15:10,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2023-12-25 07:15:10,422 INFO L87 Difference]: Start difference. First operand 88 states and 121 transitions. Second operand has 18 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 9 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2023-12-25 07:15:14,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:15:14,448 INFO L93 Difference]: Finished difference Result 108 states and 174 transitions. [2023-12-25 07:15:14,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 07:15:14,450 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 9 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) Word has length 56 [2023-12-25 07:15:14,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:15:14,451 INFO L225 Difference]: With dead ends: 108 [2023-12-25 07:15:14,451 INFO L226 Difference]: Without dead ends: 100 [2023-12-25 07:15:14,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2023-12-25 07:15:14,451 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 22 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-12-25 07:15:14,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 90 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2023-12-25 07:15:14,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-12-25 07:15:14,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 90. [2023-12-25 07:15:14,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 59 states have (on average 1.1016949152542372) internal successors, (65), 61 states have internal predecessors, (65), 16 states have call successors, (16), 12 states have call predecessors, (16), 14 states have return successors, (41), 16 states have call predecessors, (41), 15 states have call successors, (41) [2023-12-25 07:15:14,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 122 transitions. [2023-12-25 07:15:14,469 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 122 transitions. Word has length 56 [2023-12-25 07:15:14,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:15:14,470 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 122 transitions. [2023-12-25 07:15:14,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 9 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2023-12-25 07:15:14,470 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 122 transitions. [2023-12-25 07:15:14,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-25 07:15:14,471 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:15:14,471 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:15:14,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-25 07:15:14,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:15:14,677 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:15:14,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:15:14,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1675987688, now seen corresponding path program 2 times [2023-12-25 07:15:14,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:15:14,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1900962855] [2023-12-25 07:15:14,677 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 07:15:14,677 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:15:14,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:15:14,678 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:15:14,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-25 07:15:14,904 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 07:15:14,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 07:15:14,915 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 98 conjunts are in the unsatisfiable core [2023-12-25 07:15:14,921 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:15:14,956 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:15:15,392 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:15:15,425 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:15:19,392 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 13 treesize of output 9 [2023-12-25 07:15:21,981 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 36 treesize of output 28 [2023-12-25 07:15:28,899 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:15:28,960 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:15:30,725 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-25 07:15:30,725 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:16:08,398 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_31_to_42_0_#in~y1.base|))) (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_31_to_42_0_#in~y2.base|)) (.cse2 (forall ((|v_func_to_recursive_line_31_to_42_0_#in~y1.base_BEFORE_CALL_25| (_ BitVec 32)) (|v_func_to_recursive_line_31_to_42_0_#in~x1.base_BEFORE_CALL_19| (_ BitVec 32)) (|v_func_to_recursive_line_31_to_42_0_#in~x1.offset_BEFORE_CALL_19| (_ BitVec 32)) (|v_func_to_recursive_line_31_to_42_0_#in~x2.offset_BEFORE_CALL_26| (_ BitVec 32)) (|v_func_to_recursive_line_31_to_42_0_#in~y2.offset_BEFORE_CALL_35| (_ BitVec 32)) (|v_func_to_recursive_line_31_to_42_0_#in~y1.offset_BEFORE_CALL_25| (_ BitVec 32)) (|v_func_to_recursive_line_31_to_42_0_#in~x2.base_BEFORE_CALL_26| (_ BitVec 32)) (|v_func_to_recursive_line_31_to_42_0_#in~y2.base_BEFORE_CALL_35| (_ BitVec 32))) (= (bvadd (select (select |c_#memory_int#2| |v_func_to_recursive_line_31_to_42_0_#in~y2.base_BEFORE_CALL_35|) |v_func_to_recursive_line_31_to_42_0_#in~y2.offset_BEFORE_CALL_35|) (bvmul (select (select |c_#memory_int#4| |v_func_to_recursive_line_31_to_42_0_#in~x2.base_BEFORE_CALL_26|) |v_func_to_recursive_line_31_to_42_0_#in~x2.offset_BEFORE_CALL_26|) (select (select |c_#memory_int#3| |v_func_to_recursive_line_31_to_42_0_#in~y1.base_BEFORE_CALL_25|) |v_func_to_recursive_line_31_to_42_0_#in~y1.offset_BEFORE_CALL_25|))) (select (select |c_#memory_int#1| |v_func_to_recursive_line_31_to_42_0_#in~x1.base_BEFORE_CALL_19|) |v_func_to_recursive_line_31_to_42_0_#in~x1.offset_BEFORE_CALL_19|)))) (.cse6 (select .cse5 |c_func_to_recursive_line_31_to_42_0_#in~y1.offset|)) (.cse1 (select (select |c_#memory_int#4| |c_func_to_recursive_line_31_to_42_0_#in~x2.base|) |c_func_to_recursive_line_31_to_42_0_#in~x2.offset|))) (and (or (= (bvadd (select .cse0 |c_func_to_recursive_line_31_to_42_0_#in~y2.offset|) (_ bv1 32)) .cse1) .cse2) (forall ((|v_func_to_recursive_line_31_to_42_0_#in~y1.base_BEFORE_CALL_25| (_ BitVec 32)) (|v_func_to_recursive_line_31_to_42_0_#in~x1.base_BEFORE_CALL_19| (_ BitVec 32)) (|v_func_to_recursive_line_31_to_42_0_#in~x1.offset_BEFORE_CALL_19| (_ BitVec 32)) (|v_func_to_recursive_line_31_to_42_0_#in~x2.offset_BEFORE_CALL_26| (_ BitVec 32)) (|v_func_to_recursive_line_31_to_42_0_#in~y2.offset_BEFORE_CALL_35| (_ BitVec 32)) (|v_func_to_recursive_line_31_to_42_0_#in~y1.offset_BEFORE_CALL_25| (_ BitVec 32)) (|v_func_to_recursive_line_31_to_42_0_#in~x2.base_BEFORE_CALL_26| (_ BitVec 32)) (|v_func_to_recursive_line_31_to_42_0_#in~y2.base_BEFORE_CALL_35| (_ BitVec 32))) (let ((.cse3 (select (select |c_#memory_int#4| |v_func_to_recursive_line_31_to_42_0_#in~x2.base_BEFORE_CALL_26|) |v_func_to_recursive_line_31_to_42_0_#in~x2.offset_BEFORE_CALL_26|)) (.cse4 (select (select |c_#memory_int#1| |v_func_to_recursive_line_31_to_42_0_#in~x1.base_BEFORE_CALL_19|) |v_func_to_recursive_line_31_to_42_0_#in~x1.offset_BEFORE_CALL_19|))) (or (= (bvadd (select (select |c_#memory_int#2| |v_func_to_recursive_line_31_to_42_0_#in~y2.base_BEFORE_CALL_35|) |v_func_to_recursive_line_31_to_42_0_#in~y2.offset_BEFORE_CALL_35|) (bvmul .cse3 (select (select |c_#memory_int#3| |v_func_to_recursive_line_31_to_42_0_#in~y1.base_BEFORE_CALL_25|) |v_func_to_recursive_line_31_to_42_0_#in~y1.offset_BEFORE_CALL_25|))) .cse4) (not (= (bvadd (bvmul (select (select (store |c_old(#memory_int#3)| |c_func_to_recursive_line_31_to_42_0_#in~y1.base| (store .cse5 |c_func_to_recursive_line_31_to_42_0_#in~y1.offset| (bvadd .cse6 (_ bv1 32)))) |v_func_to_recursive_line_31_to_42_0_#in~y1.base_BEFORE_CALL_25|) |v_func_to_recursive_line_31_to_42_0_#in~y1.offset_BEFORE_CALL_25|) .cse3) (select (select (store |c_old(#memory_int#2)| |c_func_to_recursive_line_31_to_42_0_#in~y2.base| (store .cse0 |c_func_to_recursive_line_31_to_42_0_#in~y2.offset| (_ bv0 32))) |v_func_to_recursive_line_31_to_42_0_#in~y2.base_BEFORE_CALL_35|) |v_func_to_recursive_line_31_to_42_0_#in~y2.offset_BEFORE_CALL_35|)) .cse4))))) (or .cse2 (= (select (select |c_#memory_int#1| |c_func_to_recursive_line_31_to_42_0_#in~x1.base|) |c_func_to_recursive_line_31_to_42_0_#in~x1.offset|) (bvadd .cse1 (bvmul .cse6 .cse1))))))) is different from false Received shutdown request... [2023-12-25 07:16:16,903 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:16:16,926 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:16:17,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-25 07:16:18,104 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-25 07:16:18,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2023-12-25 07:16:18,130 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 07:16:18,130 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 57 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while executing Executor. [2023-12-25 07:16:18,135 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2023-12-25 07:16:18,137 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 07:16:18,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 07:16:18 BoogieIcfgContainer [2023-12-25 07:16:18,139 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 07:16:18,139 INFO L158 Benchmark]: Toolchain (without parser) took 880322.25ms. Allocated memory is still 330.3MB. Free memory was 278.3MB in the beginning and 141.0MB in the end (delta: 137.3MB). Peak memory consumption was 138.9MB. Max. memory is 8.0GB. [2023-12-25 07:16:18,140 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 208.7MB. Free memory is still 154.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 07:16:18,140 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.06ms. Allocated memory is still 330.3MB. Free memory was 277.8MB in the beginning and 266.2MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 07:16:18,140 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.78ms. Allocated memory is still 330.3MB. Free memory was 266.2MB in the beginning and 264.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 07:16:18,140 INFO L158 Benchmark]: Boogie Preprocessor took 32.66ms. Allocated memory is still 330.3MB. Free memory was 264.7MB in the beginning and 262.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-25 07:16:18,141 INFO L158 Benchmark]: RCFGBuilder took 397.67ms. Allocated memory is still 330.3MB. Free memory was 262.1MB in the beginning and 243.8MB in the end (delta: 18.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-25 07:16:18,141 INFO L158 Benchmark]: TraceAbstraction took 879661.08ms. Allocated memory is still 330.3MB. Free memory was 243.2MB in the beginning and 141.0MB in the end (delta: 102.2MB). Peak memory consumption was 103.2MB. Max. memory is 8.0GB. [2023-12-25 07:16:18,142 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 208.7MB. Free memory is still 154.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 195.06ms. Allocated memory is still 330.3MB. Free memory was 277.8MB in the beginning and 266.2MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.78ms. Allocated memory is still 330.3MB. Free memory was 266.2MB in the beginning and 264.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.66ms. Allocated memory is still 330.3MB. Free memory was 264.7MB in the beginning and 262.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 397.67ms. Allocated memory is still 330.3MB. Free memory was 262.1MB in the beginning and 243.8MB in the end (delta: 18.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 879661.08ms. Allocated memory is still 330.3MB. Free memory was 243.2MB in the beginning and 141.0MB in the end (delta: 102.2MB). Peak memory consumption was 103.2MB. 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: 42]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 42). Cancelled while NwaCegarLoop was analyzing trace of length 57 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 879.6s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 244.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 355 SdHoareTripleChecker+Valid, 84.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 352 mSDsluCounter, 848 SdHoareTripleChecker+Invalid, 80.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 714 mSDsCounter, 168 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3734 IncrementalHoareTripleChecker+Invalid, 3907 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 168 mSolverCounterUnsat, 134 mSDtfsCounter, 3734 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 738 GetRequests, 396 SyntacticMatches, 20 SemanticMatches, 322 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 4230 ImplicationChecksByTransitivity, 648.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=5, InterpolantAutomatonStates: 160, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 22 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 567.0s InterpolantComputationTime, 471 NumberOfCodeBlocks, 471 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 563 ConstructedInterpolants, 132 QuantifiedInterpolants, 8321 SizeOfPredicates, 331 NumberOfNonLiveVariables, 2062 ConjunctsInSsa, 679 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 161/298 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