/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_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/forester-heap/sll-sorted-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 04:40:02,142 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 04:40:02,231 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-16 04:40:02,239 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 04:40:02,240 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 04:40:02,276 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 04:40:02,285 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 04:40:02,285 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 04:40:02,286 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 04:40:02,289 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 04:40:02,289 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 04:40:02,289 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 04:40:02,290 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 04:40:02,291 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 04:40:02,291 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 04:40:02,291 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 04:40:02,291 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 04:40:02,292 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 04:40:02,292 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 04:40:02,292 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 04:40:02,292 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 04:40:02,292 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 04:40:02,293 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 04:40:02,293 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 04:40:02,293 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 04:40:02,293 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 04:40:02,293 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 04:40:02,293 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 04:40:02,294 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 04:40:02,294 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 04:40:02,295 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 04:40:02,295 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 04:40:02,295 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:40:02,295 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 04:40:02,295 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 04:40:02,295 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 04:40:02,296 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 04:40:02,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 04:40:02,296 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 04:40:02,296 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 04:40:02,296 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 04:40:02,296 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 04:40:02,296 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 04:40:02,297 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-16 04:40:02,613 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 04:40:02,644 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 04:40:02,646 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 04:40:02,647 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 04:40:02,647 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 04:40:02,648 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-sorted-1.i [2023-12-16 04:40:04,206 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 04:40:04,594 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 04:40:04,595 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-sorted-1.i [2023-12-16 04:40:04,608 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e97ecea62/86f7a867e2d8445db9a8f0efff268c1d/FLAG8524ca9da [2023-12-16 04:40:04,636 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e97ecea62/86f7a867e2d8445db9a8f0efff268c1d [2023-12-16 04:40:04,638 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 04:40:04,640 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 04:40:04,642 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 04:40:04,642 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 04:40:04,645 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 04:40:04,645 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:40:04" (1/1) ... [2023-12-16 04:40:04,646 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12ae0052 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:40:04, skipping insertion in model container [2023-12-16 04:40:04,646 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:40:04" (1/1) ... [2023-12-16 04:40:04,706 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 04:40:04,979 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-sorted-1.i[22317,22330] [2023-12-16 04:40:04,985 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-sorted-1.i[22547,22560] [2023-12-16 04:40:04,989 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-sorted-1.i[22877,22890] [2023-12-16 04:40:04,990 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-sorted-1.i[22941,22954] [2023-12-16 04:40:04,992 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-sorted-1.i[23072,23085] [2023-12-16 04:40:04,993 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-sorted-1.i[23136,23149] [2023-12-16 04:40:04,998 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:40:05,005 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 04:40:05,034 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-sorted-1.i[22317,22330] [2023-12-16 04:40:05,039 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-sorted-1.i[22547,22560] [2023-12-16 04:40:05,041 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-sorted-1.i[22877,22890] [2023-12-16 04:40:05,041 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-sorted-1.i[22941,22954] [2023-12-16 04:40:05,042 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-sorted-1.i[23072,23085] [2023-12-16 04:40:05,042 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-sorted-1.i[23136,23149] [2023-12-16 04:40:05,046 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:40:05,067 INFO L206 MainTranslator]: Completed translation [2023-12-16 04:40:05,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:40:05 WrapperNode [2023-12-16 04:40:05,068 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 04:40:05,069 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 04:40:05,070 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 04:40:05,070 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 04:40:05,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:40:05" (1/1) ... [2023-12-16 04:40:05,093 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:40:05" (1/1) ... [2023-12-16 04:40:05,117 INFO L138 Inliner]: procedures = 119, calls = 39, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 188 [2023-12-16 04:40:05,117 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 04:40:05,118 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 04:40:05,118 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 04:40:05,118 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 04:40:05,125 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:40:05" (1/1) ... [2023-12-16 04:40:05,126 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:40:05" (1/1) ... [2023-12-16 04:40:05,135 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:40:05" (1/1) ... [2023-12-16 04:40:05,162 INFO L175 MemorySlicer]: Split 31 memory accesses to 2 slices as follows [2, 29]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 11 writes are split as follows [0, 11]. [2023-12-16 04:40:05,162 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:40:05" (1/1) ... [2023-12-16 04:40:05,163 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:40:05" (1/1) ... [2023-12-16 04:40:05,179 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:40:05" (1/1) ... [2023-12-16 04:40:05,182 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:40:05" (1/1) ... [2023-12-16 04:40:05,183 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:40:05" (1/1) ... [2023-12-16 04:40:05,184 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:40:05" (1/1) ... [2023-12-16 04:40:05,204 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 04:40:05,205 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 04:40:05,205 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 04:40:05,205 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 04:40:05,205 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:40:05" (1/1) ... [2023-12-16 04:40:05,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:40:05,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:40:05,229 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-16 04:40:05,230 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-16 04:40:05,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-16 04:40:05,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-16 04:40:05,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-16 04:40:05,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-16 04:40:05,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-16 04:40:05,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 04:40:05,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-16 04:40:05,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-16 04:40:05,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-16 04:40:05,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-16 04:40:05,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-16 04:40:05,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 04:40:05,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-16 04:40:05,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 04:40:05,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 04:40:05,436 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 04:40:05,438 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 04:40:05,719 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 04:40:05,741 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 04:40:05,741 INFO L309 CfgBuilder]: Removed 18 assume(true) statements. [2023-12-16 04:40:05,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:40:05 BoogieIcfgContainer [2023-12-16 04:40:05,741 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 04:40:05,743 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 04:40:05,743 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 04:40:05,791 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 04:40:05,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:40:04" (1/3) ... [2023-12-16 04:40:05,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e5d4ad6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:40:05, skipping insertion in model container [2023-12-16 04:40:05,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:40:05" (2/3) ... [2023-12-16 04:40:05,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e5d4ad6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:40:05, skipping insertion in model container [2023-12-16 04:40:05,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:40:05" (3/3) ... [2023-12-16 04:40:05,794 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-sorted-1.i [2023-12-16 04:40:05,828 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 04:40:05,828 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-12-16 04:40:05,870 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 04:40:05,874 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;@24ec33c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 04:40:05,875 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-12-16 04:40:05,894 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 46 states have (on average 1.9130434782608696) internal successors, (88), 52 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:40:05,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-16 04:40:05,898 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:40:05,898 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-16 04:40:05,899 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-12-16 04:40:05,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:40:05,904 INFO L85 PathProgramCache]: Analyzing trace with hash 246459149, now seen corresponding path program 1 times [2023-12-16 04:40:05,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:40:05,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598062777] [2023-12-16 04:40:05,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:40:05,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:40:06,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:40:06,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:40:06,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:40:06,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598062777] [2023-12-16 04:40:06,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598062777] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:40:06,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:40:06,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 04:40:06,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554314530] [2023-12-16 04:40:06,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:40:06,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 04:40:06,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:40:06,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 04:40:06,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 04:40:06,109 INFO L87 Difference]: Start difference. First operand has 53 states, 46 states have (on average 1.9130434782608696) internal successors, (88), 52 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:40:06,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:40:06,137 INFO L93 Difference]: Finished difference Result 101 states and 167 transitions. [2023-12-16 04:40:06,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 04:40:06,139 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-12-16 04:40:06,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:40:06,144 INFO L225 Difference]: With dead ends: 101 [2023-12-16 04:40:06,145 INFO L226 Difference]: Without dead ends: 49 [2023-12-16 04:40:06,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-16 04:40:06,150 INFO L413 NwaCegarLoop]: 62 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, 62 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-16 04:40:06,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:40:06,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-16 04:40:06,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-12-16 04:40:06,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 43 states have (on average 1.372093023255814) internal successors, (59), 48 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:40:06,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2023-12-16 04:40:06,176 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 5 [2023-12-16 04:40:06,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:40:06,176 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2023-12-16 04:40:06,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:40:06,177 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2023-12-16 04:40:06,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-16 04:40:06,177 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:40:06,177 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-16 04:40:06,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 04:40:06,178 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-12-16 04:40:06,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:40:06,179 INFO L85 PathProgramCache]: Analyzing trace with hash -967789872, now seen corresponding path program 1 times [2023-12-16 04:40:06,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:40:06,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389250253] [2023-12-16 04:40:06,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:40:06,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:40:06,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:40:06,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:40:06,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:40:06,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389250253] [2023-12-16 04:40:06,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389250253] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:40:06,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:40:06,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 04:40:06,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284984053] [2023-12-16 04:40:06,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:40:06,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 04:40:06,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:40:06,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 04:40:06,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:40:06,241 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:40:06,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:40:06,286 INFO L93 Difference]: Finished difference Result 102 states and 125 transitions. [2023-12-16 04:40:06,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 04:40:06,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-12-16 04:40:06,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:40:06,288 INFO L225 Difference]: With dead ends: 102 [2023-12-16 04:40:06,288 INFO L226 Difference]: Without dead ends: 54 [2023-12-16 04:40:06,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:40:06,290 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 27 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:40:06,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 77 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:40:06,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-12-16 04:40:06,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2023-12-16 04:40:06,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 52 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:40:06,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2023-12-16 04:40:06,305 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 6 [2023-12-16 04:40:06,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:40:06,306 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2023-12-16 04:40:06,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:40:06,306 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2023-12-16 04:40:06,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-16 04:40:06,306 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:40:06,306 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:40:06,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 04:40:06,307 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-12-16 04:40:06,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:40:06,307 INFO L85 PathProgramCache]: Analyzing trace with hash -25720539, now seen corresponding path program 1 times [2023-12-16 04:40:06,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:40:06,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253687313] [2023-12-16 04:40:06,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:40:06,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:40:06,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:40:06,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-16 04:40:06,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:40:06,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253687313] [2023-12-16 04:40:06,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253687313] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:40:06,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:40:06,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 04:40:06,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148280349] [2023-12-16 04:40:06,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:40:06,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:40:06,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:40:06,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:40:06,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:40:06,416 INFO L87 Difference]: Start difference. First operand 53 states and 64 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:40:06,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:40:06,492 INFO L93 Difference]: Finished difference Result 86 states and 104 transitions. [2023-12-16 04:40:06,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 04:40:06,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-16 04:40:06,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:40:06,493 INFO L225 Difference]: With dead ends: 86 [2023-12-16 04:40:06,493 INFO L226 Difference]: Without dead ends: 84 [2023-12-16 04:40:06,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:40:06,494 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 135 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:40:06,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 61 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:40:06,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-12-16 04:40:06,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 51. [2023-12-16 04:40:06,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 50 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:40:06,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2023-12-16 04:40:06,501 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 10 [2023-12-16 04:40:06,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:40:06,501 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2023-12-16 04:40:06,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:40:06,501 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2023-12-16 04:40:06,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-16 04:40:06,502 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:40:06,503 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:40:06,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 04:40:06,503 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-12-16 04:40:06,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:40:06,504 INFO L85 PathProgramCache]: Analyzing trace with hash 246593115, now seen corresponding path program 1 times [2023-12-16 04:40:06,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:40:06,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434815643] [2023-12-16 04:40:06,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:40:06,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:40:06,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:40:07,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:40:07,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:40:07,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434815643] [2023-12-16 04:40:07,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434815643] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:40:07,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374786420] [2023-12-16 04:40:07,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:40:07,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:40:07,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:40:07,053 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:40:07,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-16 04:40:07,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:40:07,133 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 48 conjunts are in the unsatisfiable core [2023-12-16 04:40:07,139 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:40:07,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-12-16 04:40:07,208 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-16 04:40:07,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-16 04:40:07,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-12-16 04:40:07,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-16 04:40:07,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-12-16 04:40:07,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-16 04:40:07,257 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-16 04:40:07,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 53 [2023-12-16 04:40:07,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-16 04:40:07,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-16 04:40:07,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-12-16 04:40:07,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-16 04:40:07,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:40:07,432 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:40:07,484 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 69 treesize of output 49 [2023-12-16 04:40:07,491 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_131 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_131) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)) (forall ((v_ArrVal_128 (Array Int Int))) (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_128) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2023-12-16 04:40:07,537 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:40:07,537 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2023-12-16 04:40:07,543 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:40:07,543 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 42 [2023-12-16 04:40:07,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:40:07,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 47 [2023-12-16 04:40:07,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 29 treesize of output 27 [2023-12-16 04:40:07,565 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:40:07,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 51 [2023-12-16 04:40:07,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 35 treesize of output 33 [2023-12-16 04:40:07,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:40:07,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374786420] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:40:07,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:40:07,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2023-12-16 04:40:07,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586229982] [2023-12-16 04:40:07,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:40:07,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-16 04:40:07,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:40:07,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-16 04:40:07,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=175, Unknown=1, NotChecked=26, Total=240 [2023-12-16 04:40:07,639 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 15 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:40:08,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:40:08,095 INFO L93 Difference]: Finished difference Result 101 states and 130 transitions. [2023-12-16 04:40:08,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 04:40:08,095 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 15 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-12-16 04:40:08,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:40:08,096 INFO L225 Difference]: With dead ends: 101 [2023-12-16 04:40:08,096 INFO L226 Difference]: Without dead ends: 99 [2023-12-16 04:40:08,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=306, Unknown=1, NotChecked=36, Total=420 [2023-12-16 04:40:08,097 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 113 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:40:08,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 440 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 345 Invalid, 0 Unknown, 90 Unchecked, 0.3s Time] [2023-12-16 04:40:08,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-12-16 04:40:08,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 69. [2023-12-16 04:40:08,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.359375) internal successors, (87), 68 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:40:08,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 87 transitions. [2023-12-16 04:40:08,104 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 87 transitions. Word has length 20 [2023-12-16 04:40:08,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:40:08,104 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 87 transitions. [2023-12-16 04:40:08,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 15 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:40:08,104 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2023-12-16 04:40:08,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-16 04:40:08,105 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:40:08,105 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:40:08,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-16 04:40:08,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:40:08,310 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-12-16 04:40:08,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:40:08,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1618331757, now seen corresponding path program 1 times [2023-12-16 04:40:08,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:40:08,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267316278] [2023-12-16 04:40:08,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:40:08,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:40:08,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:40:08,787 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:40:08,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:40:08,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267316278] [2023-12-16 04:40:08,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267316278] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:40:08,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418834536] [2023-12-16 04:40:08,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:40:08,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:40:08,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:40:08,789 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:40:08,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-16 04:40:08,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:40:08,877 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 47 conjunts are in the unsatisfiable core [2023-12-16 04:40:08,881 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:40:08,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-12-16 04:40:08,921 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-16 04:40:08,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-16 04:40:08,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-12-16 04:40:08,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-12-16 04:40:08,993 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-16 04:40:08,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 58 [2023-12-16 04:40:08,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 25 [2023-12-16 04:40:09,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 36 [2023-12-16 04:40:09,191 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:40:09,191 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:40:09,244 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (and (forall ((v_ArrVal_203 (Array Int Int))) (or (not (= v_ArrVal_203 (store .cse0 .cse1 (select v_ArrVal_203 .cse1)))) (forall ((v_ArrVal_205 Int)) (= (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_203))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 .cse1 v_ArrVal_205)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0)))) (forall ((v_ArrVal_203 (Array Int Int))) (or (forall ((v_ArrVal_205 Int)) (= (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 .cse1 v_ArrVal_205)))) (select (select .cse4 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_203) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse4 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) 0)) (not (= v_ArrVal_203 (store .cse0 .cse1 (select v_ArrVal_203 .cse1)))))))) is different from false [2023-12-16 04:40:09,270 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:40:09,270 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 191 treesize of output 160 [2023-12-16 04:40:09,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:40:09,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 474 treesize of output 492 [2023-12-16 04:40:09,531 INFO L349 Elim1Store]: treesize reduction 90, result has 64.4 percent of original size [2023-12-16 04:40:09,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 9152 treesize of output 8845 [2023-12-16 04:40:24,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-16 04:40:25,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-16 04:40:25,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-16 04:40:26,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 Received shutdown request... [2023-12-16 04:41:23,646 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-12-16 04:41:23,652 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-16 04:41:23,652 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 04:41:23,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-16 04:41:23,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:41:23,857 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 24 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-5-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ∧-21-3-2-3-3-6-4-5-3-7-4-7-4-7-3-7-3-7-3-4-2-2-2-3-1 context. [2023-12-16 04:41:23,859 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-12-16 04:41:23,859 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2023-12-16 04:41:23,859 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2023-12-16 04:41:23,859 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2023-12-16 04:41:23,859 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-12-16 04:41:23,862 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-16 04:41:23,863 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 04:41:23,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:41:23 BoogieIcfgContainer [2023-12-16 04:41:23,865 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 04:41:23,865 INFO L158 Benchmark]: Toolchain (without parser) took 79225.76ms. Allocated memory was 235.9MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 183.5MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2023-12-16 04:41:23,865 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 177.2MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 04:41:23,866 INFO L158 Benchmark]: CACSL2BoogieTranslator took 427.00ms. Allocated memory is still 235.9MB. Free memory was 183.5MB in the beginning and 164.2MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-16 04:41:23,866 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.73ms. Allocated memory is still 235.9MB. Free memory was 164.2MB in the beginning and 161.5MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 04:41:23,866 INFO L158 Benchmark]: Boogie Preprocessor took 86.36ms. Allocated memory is still 235.9MB. Free memory was 161.5MB in the beginning and 159.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 04:41:23,866 INFO L158 Benchmark]: RCFGBuilder took 536.72ms. Allocated memory is still 235.9MB. Free memory was 159.0MB in the beginning and 139.5MB in the end (delta: 19.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-12-16 04:41:23,866 INFO L158 Benchmark]: TraceAbstraction took 78122.24ms. Allocated memory was 235.9MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 139.0MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 991.3MB. Max. memory is 8.0GB. [2023-12-16 04:41:23,867 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.09ms. Allocated memory is still 177.2MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 427.00ms. Allocated memory is still 235.9MB. Free memory was 183.5MB in the beginning and 164.2MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.73ms. Allocated memory is still 235.9MB. Free memory was 164.2MB in the beginning and 161.5MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 86.36ms. Allocated memory is still 235.9MB. Free memory was 161.5MB in the beginning and 159.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 536.72ms. Allocated memory is still 235.9MB. Free memory was 159.0MB in the beginning and 139.5MB in the end (delta: 19.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 78122.24ms. Allocated memory was 235.9MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 139.0MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 991.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 1035]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1035). Cancelled while NwaCegarLoop was analyzing trace of length 24 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-5-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ∧-21-3-2-3-3-6-4-5-3-7-4-7-4-7-3-7-3-7-3-4-2-2-2-3-1 context. - TimeoutResultAtElement [Line: 1024]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1024). Cancelled while NwaCegarLoop was analyzing trace of length 24 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-5-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ∧-21-3-2-3-3-6-4-5-3-7-4-7-4-7-3-7-3-7-3-4-2-2-2-3-1 context. - TimeoutResultAtElement [Line: 1055]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1055). Cancelled while NwaCegarLoop was analyzing trace of length 24 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-5-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ∧-21-3-2-3-3-6-4-5-3-7-4-7-4-7-3-7-3-7-3-4-2-2-2-3-1 context. - TimeoutResultAtElement [Line: 1056]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1056). Cancelled while NwaCegarLoop was analyzing trace of length 24 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-5-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ∧-21-3-2-3-3-6-4-5-3-7-4-7-4-7-3-7-3-7-3-4-2-2-2-3-1 context. - TimeoutResultAtElement [Line: 1062]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1062). Cancelled while NwaCegarLoop was analyzing trace of length 24 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-5-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ∧-21-3-2-3-3-6-4-5-3-7-4-7-4-7-3-7-3-7-3-4-2-2-2-3-1 context. - TimeoutResultAtElement [Line: 1063]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1063). Cancelled while NwaCegarLoop was analyzing trace of length 24 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-5-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ∧-21-3-2-3-3-6-4-5-3-7-4-7-4-7-3-7-3-7-3-4-2-2-2-3-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 53 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 78.0s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 275 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 275 mSDsluCounter, 640 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 90 IncrementalHoareTripleChecker+Unchecked, 441 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 399 IncrementalHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 199 mSDtfsCounter, 399 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=4, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 64 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 61 NumberOfCodeBlocks, 61 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 75 ConstructedInterpolants, 4 QuantifiedInterpolants, 1160 SizeOfPredicates, 17 NumberOfNonLiveVariables, 155 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 2/8 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