/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/forester-heap/sll-sorted-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 16:17:50,631 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 16:17:50,701 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-16 16:17:50,704 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 16:17:50,709 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 16:17:50,728 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 16:17:50,728 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 16:17:50,729 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 16:17:50,729 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 16:17:50,732 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 16:17:50,732 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 16:17:50,733 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 16:17:50,733 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 16:17:50,734 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 16:17:50,734 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 16:17:50,734 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 16:17:50,735 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 16:17:50,735 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 16:17:50,735 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 16:17:50,735 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 16:17:50,735 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 16:17:50,748 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 16:17:50,748 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 16:17:50,748 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 16:17:50,748 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 16:17:50,748 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 16:17:50,749 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 16:17:50,749 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 16:17:50,749 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 16:17:50,749 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 16:17:50,749 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 16:17:50,749 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 16:17:50,750 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 16:17:50,750 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 16:17:50,750 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:17:50,750 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 16:17:50,750 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 16:17:50,750 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 16:17:50,751 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 16:17:50,751 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 16:17:50,751 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 16:17:50,752 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 16:17:50,752 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 16:17:50,752 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 16:17:50,752 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 16:17:50,752 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 16:17:50,752 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-16 16:17:50,935 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 16:17:50,955 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 16:17:50,957 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 16:17:50,958 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 16:17:50,958 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 16:17:50,959 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-sorted-2.i [2023-12-16 16:17:52,020 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 16:17:52,171 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 16:17:52,171 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-sorted-2.i [2023-12-16 16:17:52,180 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4525e3768/350d1bff3d92481c9b75d580fa719f3b/FLAGf13cec6c1 [2023-12-16 16:17:52,206 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4525e3768/350d1bff3d92481c9b75d580fa719f3b [2023-12-16 16:17:52,208 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 16:17:52,209 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 16:17:52,209 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 16:17:52,209 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 16:17:52,214 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 16:17:52,215 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:17:52" (1/1) ... [2023-12-16 16:17:52,215 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12f307dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:52, skipping insertion in model container [2023-12-16 16:17:52,216 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:17:52" (1/1) ... [2023-12-16 16:17:52,251 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 16:17:52,452 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-2.i[22317,22330] [2023-12-16 16:17:52,455 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-2.i[22452,22465] [2023-12-16 16:17:52,456 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-2.i[22612,22625] [2023-12-16 16:17:52,462 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-2.i[22941,22954] [2023-12-16 16:17:52,462 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-2.i[23005,23018] [2023-12-16 16:17:52,463 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-2.i[23136,23149] [2023-12-16 16:17:52,464 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-2.i[23200,23213] [2023-12-16 16:17:52,466 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:17:52,474 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 16:17:52,520 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-2.i[22317,22330] [2023-12-16 16:17:52,522 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-2.i[22452,22465] [2023-12-16 16:17:52,523 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-2.i[22612,22625] [2023-12-16 16:17:52,525 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-2.i[22941,22954] [2023-12-16 16:17:52,525 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-2.i[23005,23018] [2023-12-16 16:17:52,526 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-2.i[23136,23149] [2023-12-16 16:17:52,527 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-2.i[23200,23213] [2023-12-16 16:17:52,536 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:17:52,557 INFO L206 MainTranslator]: Completed translation [2023-12-16 16:17:52,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:52 WrapperNode [2023-12-16 16:17:52,557 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 16:17:52,558 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 16:17:52,558 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 16:17:52,558 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 16:17:52,563 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:17:52" (1/1) ... [2023-12-16 16:17:52,575 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:17:52" (1/1) ... [2023-12-16 16:17:52,597 INFO L138 Inliner]: procedures = 122, calls = 40, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 196 [2023-12-16 16:17:52,597 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 16:17:52,598 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 16:17:52,598 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 16:17:52,598 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 16:17:52,605 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:52" (1/1) ... [2023-12-16 16:17:52,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:52" (1/1) ... [2023-12-16 16:17:52,608 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:52" (1/1) ... [2023-12-16 16:17:52,622 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 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 16:17:52,622 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:52" (1/1) ... [2023-12-16 16:17:52,622 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:52" (1/1) ... [2023-12-16 16:17:52,630 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:52" (1/1) ... [2023-12-16 16:17:52,633 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:52" (1/1) ... [2023-12-16 16:17:52,635 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:52" (1/1) ... [2023-12-16 16:17:52,636 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:52" (1/1) ... [2023-12-16 16:17:52,639 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 16:17:52,640 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 16:17:52,640 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 16:17:52,640 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 16:17:52,641 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:52" (1/1) ... [2023-12-16 16:17:52,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:17:52,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 16:17:52,789 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 16:17:52,792 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 16:17:52,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-16 16:17:52,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-16 16:17:52,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-16 16:17:52,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 16:17:52,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-16 16:17:52,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-16 16:17:52,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-16 16:17:52,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-16 16:17:52,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-16 16:17:52,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-16 16:17:52,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-16 16:17:52,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 16:17:52,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-16 16:17:52,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 16:17:52,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 16:17:52,937 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 16:17:52,939 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 16:17:53,217 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 16:17:53,235 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 16:17:53,235 INFO L309 CfgBuilder]: Removed 20 assume(true) statements. [2023-12-16 16:17:53,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:17:53 BoogieIcfgContainer [2023-12-16 16:17:53,236 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 16:17:53,261 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 16:17:53,262 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 16:17:53,264 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 16:17:53,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:17:52" (1/3) ... [2023-12-16 16:17:53,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26abb0cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:17:53, skipping insertion in model container [2023-12-16 16:17:53,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:52" (2/3) ... [2023-12-16 16:17:53,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26abb0cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:17:53, skipping insertion in model container [2023-12-16 16:17:53,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:17:53" (3/3) ... [2023-12-16 16:17:53,266 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-sorted-2.i [2023-12-16 16:17:53,278 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 16:17:53,278 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-12-16 16:17:53,308 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 16:17:53,312 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;@6954d7d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 16:17:53,312 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-12-16 16:17:53,315 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 58 states have internal predecessors, (97), 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 16:17:53,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-16 16:17:53,319 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:17:53,319 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-16 16:17:53,320 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-16 16:17:53,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:17:53,323 INFO L85 PathProgramCache]: Analyzing trace with hash 264929569, now seen corresponding path program 1 times [2023-12-16 16:17:53,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:17:53,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2042311503] [2023-12-16 16:17:53,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:17:53,333 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-16 16:17:53,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:17:53,335 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-16 16:17:53,342 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-16 16:17:53,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:17:53,413 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 16:17:53,416 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:17:53,429 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 16:17:53,429 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:17:53,429 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:17:53,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2042311503] [2023-12-16 16:17:53,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2042311503] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:17:53,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:17:53,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 16:17:53,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069889429] [2023-12-16 16:17:53,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:17:53,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 16:17:53,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:17:53,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 16:17:53,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 16:17:53,454 INFO L87 Difference]: Start difference. First operand has 59 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 58 states have internal predecessors, (97), 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 16:17:53,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:17:53,483 INFO L93 Difference]: Finished difference Result 113 states and 185 transitions. [2023-12-16 16:17:53,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 16:17:53,485 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 16:17:53,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:17:53,490 INFO L225 Difference]: With dead ends: 113 [2023-12-16 16:17:53,490 INFO L226 Difference]: Without dead ends: 55 [2023-12-16 16:17:53,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 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 16:17:53,494 INFO L413 NwaCegarLoop]: 68 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, 68 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 16:17:53,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:17:53,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-12-16 16:17:53,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-12-16 16:17:53,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 54 states have internal predecessors, (65), 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 16:17:53,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2023-12-16 16:17:53,520 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 5 [2023-12-16 16:17:53,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:17:53,521 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2023-12-16 16:17:53,521 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 16:17:53,521 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2023-12-16 16:17:53,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-16 16:17:53,521 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:17:53,521 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-16 16:17:53,529 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-16 16:17:53,724 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-16 16:17:53,725 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-16 16:17:53,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:17:53,725 INFO L85 PathProgramCache]: Analyzing trace with hash -395206852, now seen corresponding path program 1 times [2023-12-16 16:17:53,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:17:53,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [382906443] [2023-12-16 16:17:53,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:17:53,726 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-16 16:17:53,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:17:53,735 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-16 16:17:53,737 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-16 16:17:53,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:17:53,804 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 16:17:53,805 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:17:53,819 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 16:17:53,820 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:17:53,820 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:17:53,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [382906443] [2023-12-16 16:17:53,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [382906443] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:17:53,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:17:53,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 16:17:53,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602708041] [2023-12-16 16:17:53,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:17:53,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 16:17:53,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:17:53,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 16:17:53,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 16:17:53,825 INFO L87 Difference]: Start difference. First operand 55 states and 65 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 16:17:53,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:17:53,898 INFO L93 Difference]: Finished difference Result 114 states and 137 transitions. [2023-12-16 16:17:53,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 16:17:53,899 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 16:17:53,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:17:53,900 INFO L225 Difference]: With dead ends: 114 [2023-12-16 16:17:53,900 INFO L226 Difference]: Without dead ends: 60 [2023-12-16 16:17:53,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 16:17:53,901 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 33 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 83 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.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:17:53,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 83 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 16:17:53,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-12-16 16:17:53,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2023-12-16 16:17:53,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 58 states have internal predecessors, (70), 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 16:17:53,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2023-12-16 16:17:53,907 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 6 [2023-12-16 16:17:53,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:17:53,907 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2023-12-16 16:17:53,907 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 16:17:53,907 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2023-12-16 16:17:53,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-16 16:17:53,908 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:17:53,908 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:17:53,913 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-16 16:17:54,110 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-16 16:17:54,111 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-16 16:17:54,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:17:54,111 INFO L85 PathProgramCache]: Analyzing trace with hash 338976657, now seen corresponding path program 1 times [2023-12-16 16:17:54,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:17:54,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [854267288] [2023-12-16 16:17:54,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:17:54,114 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-16 16:17:54,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:17:54,117 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-16 16:17:54,117 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-16 16:17:54,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:17:54,205 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 16:17:54,206 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:17:54,249 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 16:17:54,250 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:17:54,250 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:17:54,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [854267288] [2023-12-16 16:17:54,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [854267288] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:17:54,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:17:54,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 16:17:54,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072788564] [2023-12-16 16:17:54,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:17:54,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 16:17:54,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:17:54,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 16:17:54,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 16:17:54,253 INFO L87 Difference]: Start difference. First operand 59 states and 70 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 16:17:54,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:17:54,426 INFO L93 Difference]: Finished difference Result 98 states and 116 transitions. [2023-12-16 16:17:54,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 16:17:54,426 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 16:17:54,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:17:54,427 INFO L225 Difference]: With dead ends: 98 [2023-12-16 16:17:54,427 INFO L226 Difference]: Without dead ends: 96 [2023-12-16 16:17:54,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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 16:17:54,428 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 153 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:17:54,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 71 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 16:17:54,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-12-16 16:17:54,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 57. [2023-12-16 16:17:54,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 56 states have internal predecessors, (68), 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 16:17:54,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2023-12-16 16:17:54,435 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 10 [2023-12-16 16:17:54,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:17:54,435 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2023-12-16 16:17:54,435 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 16:17:54,435 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2023-12-16 16:17:54,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-16 16:17:54,435 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:17:54,435 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:17:54,439 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 (4)] Ended with exit code 0 [2023-12-16 16:17:54,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:17:54,639 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-16 16:17:54,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:17:54,640 INFO L85 PathProgramCache]: Analyzing trace with hash 702330627, now seen corresponding path program 1 times [2023-12-16 16:17:54,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:17:54,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1737957728] [2023-12-16 16:17:54,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:17:54,640 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-16 16:17:54,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:17:54,641 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:17:54,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-16 16:17:54,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:17:54,723 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-16 16:17:54,726 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:17:54,757 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 7 [2023-12-16 16:17:54,833 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-16 16:17:54,833 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 13 treesize of output 13 [2023-12-16 16:17:54,841 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 16:17:54,847 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 16:17:54,854 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 16:17:54,858 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 16:17:54,936 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-16 16:17:54,936 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 16:17:54,947 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 16:17:54,954 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 16:17:55,126 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 16:17:55,126 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:17:55,196 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 46 treesize of output 26 [2023-12-16 16:17:55,212 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_96 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_96) |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_97 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_97) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.offset|))) is different from false [2023-12-16 16:17:55,253 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:17:55,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2023-12-16 16:17:55,260 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:17:55,260 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 16:17:55,270 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:17:55,271 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 16:17:55,276 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 16:17:55,291 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:17:55,292 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 16:17:55,300 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 16:17:55,383 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 16:17:55,383 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:17:55,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1737957728] [2023-12-16 16:17:55,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1737957728] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:17:55,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:17:55,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-12-16 16:17:55,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865131844] [2023-12-16 16:17:55,384 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:17:55,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-16 16:17:55,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:17:55,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-16 16:17:55,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=71, Unknown=1, NotChecked=16, Total=110 [2023-12-16 16:17:55,385 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 10 states have internal predecessors, (30), 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 16:17:56,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:17:56,152 INFO L93 Difference]: Finished difference Result 131 states and 159 transitions. [2023-12-16 16:17:56,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 16:17:56,152 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 10 states have internal predecessors, (30), 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 17 [2023-12-16 16:17:56,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:17:56,153 INFO L225 Difference]: With dead ends: 131 [2023-12-16 16:17:56,153 INFO L226 Difference]: Without dead ends: 87 [2023-12-16 16:17:56,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=118, Unknown=1, NotChecked=22, Total=182 [2023-12-16 16:17:56,154 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 63 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-16 16:17:56,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 337 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 167 Invalid, 0 Unknown, 60 Unchecked, 0.7s Time] [2023-12-16 16:17:56,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-12-16 16:17:56,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 70. [2023-12-16 16:17:56,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 64 states have (on average 1.328125) internal successors, (85), 69 states have internal predecessors, (85), 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 16:17:56,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2023-12-16 16:17:56,161 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 85 transitions. Word has length 17 [2023-12-16 16:17:56,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:17:56,161 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 85 transitions. [2023-12-16 16:17:56,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 10 states have internal predecessors, (30), 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 16:17:56,161 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2023-12-16 16:17:56,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-16 16:17:56,161 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:17:56,161 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 16:17:56,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-16 16:17:56,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:17:56,365 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-16 16:17:56,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:17:56,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1251712327, now seen corresponding path program 1 times [2023-12-16 16:17:56,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:17:56,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [697533380] [2023-12-16 16:17:56,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:17:56,366 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-16 16:17:56,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:17:56,369 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-16 16:17:56,370 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-16 16:17:56,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:17:56,466 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-16 16:17:56,469 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:17:56,478 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 7 [2023-12-16 16:17:56,522 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-16 16:17:56,523 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 13 treesize of output 13 [2023-12-16 16:17:56,528 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 16:17:56,531 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 16:17:56,536 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 16:17:56,540 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 16:17:56,592 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-16 16:17:56,592 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 16:17:56,598 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 16:17:56,604 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 16:17:56,751 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 16:17:56,754 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 16:17:56,779 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 16:17:56,780 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:17:56,863 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 16:17:56,926 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:17:56,926 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 16:17:56,933 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:17:56,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-12-16 16:17:56,944 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:17:56,944 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 16:17:56,949 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 16:17:56,965 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:17:56,966 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 16:17:56,973 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 16:17:57,051 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 16:17:57,052 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:17:57,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [697533380] [2023-12-16 16:17:57,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [697533380] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:17:57,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:17:57,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-12-16 16:17:57,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571427623] [2023-12-16 16:17:57,052 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:17:57,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-16 16:17:57,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:17:57,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-16 16:17:57,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=123, Unknown=5, NotChecked=0, Total=156 [2023-12-16 16:17:57,053 INFO L87 Difference]: Start difference. First operand 70 states and 85 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 16:17:58,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:17:58,439 INFO L93 Difference]: Finished difference Result 98 states and 120 transitions. [2023-12-16 16:17:58,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 16:17:58,439 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 16:17:58,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:17:58,440 INFO L225 Difference]: With dead ends: 98 [2023-12-16 16:17:58,440 INFO L226 Difference]: Without dead ends: 96 [2023-12-16 16:17:58,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=209, Unknown=6, NotChecked=0, Total=272 [2023-12-16 16:17:58,441 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 91 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-16 16:17:58,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 373 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-16 16:17:58,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-12-16 16:17:58,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 76. [2023-12-16 16:17:58,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 75 states have internal predecessors, (93), 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 16:17:58,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 93 transitions. [2023-12-16 16:17:58,449 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 93 transitions. Word has length 20 [2023-12-16 16:17:58,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:17:58,449 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 93 transitions. [2023-12-16 16:17:58,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 16:17:58,450 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2023-12-16 16:17:58,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-16 16:17:58,450 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:17:58,450 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:17:58,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-16 16:17:58,654 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-16 16:17:58,654 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-16 16:17:58,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:17:58,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1700093902, now seen corresponding path program 1 times [2023-12-16 16:17:58,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:17:58,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2005174626] [2023-12-16 16:17:58,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:17:58,655 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-16 16:17:58,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:17:58,656 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-16 16:17:58,657 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-16 16:17:58,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:17:58,777 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-16 16:17:58,780 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:17:58,788 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-16 16:17:58,792 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 7 [2023-12-16 16:17:58,837 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-12-16 16:17:58,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2023-12-16 16:17:58,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2023-12-16 16:17:58,848 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 16:17:58,878 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 16:17:58,910 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-16 16:17:58,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 15 [2023-12-16 16:17:58,921 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 16:17:58,931 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-16 16:17:58,931 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 13 treesize of output 13 [2023-12-16 16:17:58,953 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 16:17:59,011 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:17:59,011 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:17:59,062 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_200 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_200) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))))) is different from false [2023-12-16 16:17:59,078 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_200 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~x~0#1.base_56| (_ BitVec 32)) (v_ArrVal_198 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_56|))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_198) |v_ULTIMATE.start_main_~x~0#1.base_56| v_ArrVal_200) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))) (_ bv0 32)))) is different from false [2023-12-16 16:17:59,221 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-12-16 16:17:59,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:17:59,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2005174626] [2023-12-16 16:17:59,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2005174626] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:17:59,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:17:59,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-12-16 16:17:59,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528833943] [2023-12-16 16:17:59,222 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:17:59,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-16 16:17:59,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:17:59,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-16 16:17:59,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=76, Unknown=6, NotChecked=38, Total=156 [2023-12-16 16:17:59,223 INFO L87 Difference]: Start difference. First operand 76 states and 93 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 12 states have internal predecessors, (40), 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 16:17:59,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:17:59,913 INFO L93 Difference]: Finished difference Result 140 states and 166 transitions. [2023-12-16 16:17:59,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 16:17:59,914 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 12 states have internal predecessors, (40), 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 21 [2023-12-16 16:17:59,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:17:59,914 INFO L225 Difference]: With dead ends: 140 [2023-12-16 16:17:59,914 INFO L226 Difference]: Without dead ends: 138 [2023-12-16 16:17:59,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=105, Unknown=6, NotChecked=46, Total=210 [2023-12-16 16:17:59,915 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 188 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 229 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 16:17:59,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 414 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 193 Invalid, 0 Unknown, 229 Unchecked, 0.6s Time] [2023-12-16 16:17:59,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-12-16 16:17:59,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 81. [2023-12-16 16:17:59,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 75 states have (on average 1.3333333333333333) internal successors, (100), 80 states have internal predecessors, (100), 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 16:17:59,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 100 transitions. [2023-12-16 16:17:59,940 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 100 transitions. Word has length 21 [2023-12-16 16:17:59,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:17:59,941 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 100 transitions. [2023-12-16 16:17:59,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 12 states have internal predecessors, (40), 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 16:17:59,941 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2023-12-16 16:17:59,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-16 16:17:59,941 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:17:59,941 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:17:59,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-16 16:18:00,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:18:00,146 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-16 16:18:00,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:18:00,147 INFO L85 PathProgramCache]: Analyzing trace with hash 148782236, now seen corresponding path program 1 times [2023-12-16 16:18:00,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:18:00,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [954005828] [2023-12-16 16:18:00,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:18:00,147 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-16 16:18:00,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:18:00,148 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:18:00,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-16 16:18:00,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:18:00,313 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 35 conjunts are in the unsatisfiable core [2023-12-16 16:18:00,316 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:18:00,323 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 7 [2023-12-16 16:18:00,354 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 0 case distinctions, treesize of input 16 treesize of output 16 [2023-12-16 16:18:00,367 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-16 16:18:00,370 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 1 case distinctions, treesize of input 16 treesize of output 15 [2023-12-16 16:18:00,381 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 0 case distinctions, treesize of input 16 treesize of output 16 [2023-12-16 16:18:00,399 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-16 16:18:00,399 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 1 case distinctions, treesize of input 16 treesize of output 15 [2023-12-16 16:18:00,405 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 [2023-12-16 16:18:00,429 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-16 16:18:00,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-16 16:18:00,483 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 16:18:00,489 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 11 treesize of output 7 [2023-12-16 16:18:00,501 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 16:18:00,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:18:00,570 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 84 treesize of output 67 [2023-12-16 16:18:00,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 treesize of output 14 [2023-12-16 16:18:00,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:18:00,604 INFO L349 Elim1Store]: treesize reduction 44, result has 10.2 percent of original size [2023-12-16 16:18:00,604 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 131 treesize of output 98 [2023-12-16 16:18:00,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 59 treesize of output 26 [2023-12-16 16:18:00,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 15 [2023-12-16 16:18:00,626 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-16 16:18:00,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 18 [2023-12-16 16:18:00,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2023-12-16 16:18:00,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 16 treesize of output 11 [2023-12-16 16:18:00,704 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 36 treesize of output 27 [2023-12-16 16:18:00,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 16 treesize of output 11 [2023-12-16 16:18:00,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-16 16:18:00,811 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:18:00,811 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:18:00,870 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_269 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_271 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_269) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_270) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (_ bv0 32))) is different from false [2023-12-16 16:18:00,903 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_266 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_269 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~x~0#1.base_62| (_ BitVec 32)) (v_ArrVal_271 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~x~0#1.offset_60| (_ BitVec 32))) (or (not (= v_ArrVal_267 (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_267 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_267) |v_ULTIMATE.start_main_~x~0#1.base_62| v_ArrVal_269) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_266) |v_ULTIMATE.start_main_~x~0#1.base_62| v_ArrVal_270) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_60|)) |v_ULTIMATE.start_main_~x~0#1.base_62| v_ArrVal_271) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (_ bv0 32)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_62|))))) is different from false [2023-12-16 16:18:00,976 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:18:00,977 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 410 treesize of output 402 [2023-12-16 16:18:00,991 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:18:00,991 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 164 [2023-12-16 16:18:01,008 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 78 treesize of output 50 [2023-12-16 16:18:01,074 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 266 treesize of output 238 [2023-12-16 16:18:01,121 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 283 treesize of output 241 [2023-12-16 16:18:01,145 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 17 treesize of output 3 [2023-12-16 16:18:02,502 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~x~0#1.base_62| (_ BitVec 32))) (or (forall ((v_ArrVal_266 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_266) |v_ULTIMATE.start_main_~x~0#1.base_62| v_ArrVal_270) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_62|))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.base_62| (_ BitVec 32))) (or (forall ((v_ArrVal_271 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~x~0#1.base_62| v_ArrVal_271) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_62|))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.base_62| (_ BitVec 32))) (or (forall ((v_ArrVal_271 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~x~0#1.base_62| v_ArrVal_271) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~x~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_62|))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.base_62| (_ BitVec 32))) (or (forall ((v_ArrVal_266 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |v_ULTIMATE.start_main_~x~0#1.base_62| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_266) |v_ULTIMATE.start_main_~x~0#1.base_62| v_ArrVal_270) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_62|)))))) is different from false [2023-12-16 16:18:02,571 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:18:02,572 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 129 treesize of output 122 [2023-12-16 16:18:02,581 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:18:02,582 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 149 treesize of output 142 [2023-12-16 16:18:02,598 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:18:02,599 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 346 treesize of output 245 [2023-12-16 16:18:02,623 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:18:02,624 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 326 treesize of output 321 [2023-12-16 16:18:02,641 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 247 treesize of output 245 [2023-12-16 16:18:02,650 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 245 treesize of output 243 [2023-12-16 16:18:02,658 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 243 treesize of output 239 [2023-12-16 16:18:02,666 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 239 treesize of output 237 [2023-12-16 16:18:02,672 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 237 treesize of output 233 [2023-12-16 16:18:02,679 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 233 treesize of output 229 [2023-12-16 16:18:02,686 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 229 treesize of output 227 [2023-12-16 16:18:02,693 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 227 treesize of output 223 [2023-12-16 16:18:04,297 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-12-16 16:18:04,298 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:18:04,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [954005828] [2023-12-16 16:18:04,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [954005828] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:18:04,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:18:04,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-12-16 16:18:04,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274635348] [2023-12-16 16:18:04,299 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:18:04,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-16 16:18:04,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:18:04,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-16 16:18:04,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=106, Unknown=3, NotChecked=66, Total=210 [2023-12-16 16:18:04,300 INFO L87 Difference]: Start difference. First operand 81 states and 100 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 14 states have internal predecessors, (41), 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 16:18:06,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:18:06,302 INFO L93 Difference]: Finished difference Result 188 states and 226 transitions. [2023-12-16 16:18:06,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 16:18:06,303 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 14 states have internal predecessors, (41), 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 24 [2023-12-16 16:18:06,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:18:06,305 INFO L225 Difference]: With dead ends: 188 [2023-12-16 16:18:06,305 INFO L226 Difference]: Without dead ends: 153 [2023-12-16 16:18:06,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=49, Invalid=142, Unknown=3, NotChecked=78, Total=272 [2023-12-16 16:18:06,305 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 130 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 375 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-16 16:18:06,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 586 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 345 Invalid, 0 Unknown, 375 Unchecked, 1.9s Time] [2023-12-16 16:18:06,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-12-16 16:18:06,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 95. [2023-12-16 16:18:06,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 94 states have internal predecessors, (118), 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 16:18:06,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 118 transitions. [2023-12-16 16:18:06,314 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 118 transitions. Word has length 24 [2023-12-16 16:18:06,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:18:06,314 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 118 transitions. [2023-12-16 16:18:06,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 14 states have internal predecessors, (41), 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 16:18:06,314 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 118 transitions. [2023-12-16 16:18:06,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-16 16:18:06,315 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:18:06,315 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:18:06,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-16 16:18:06,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:18:06,516 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-16 16:18:06,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:18:06,516 INFO L85 PathProgramCache]: Analyzing trace with hash -660564390, now seen corresponding path program 1 times [2023-12-16 16:18:06,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:18:06,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [636646227] [2023-12-16 16:18:06,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:18:06,517 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-16 16:18:06,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:18:06,518 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-16 16:18:06,521 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-16 16:18:06,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:18:06,626 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 16:18:06,627 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:18:06,672 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-16 16:18:06,673 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:18:06,673 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:18:06,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [636646227] [2023-12-16 16:18:06,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [636646227] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:18:06,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:18:06,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 16:18:06,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611825434] [2023-12-16 16:18:06,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:18:06,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 16:18:06,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:18:06,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 16:18:06,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 16:18:06,674 INFO L87 Difference]: Start difference. First operand 95 states and 118 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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 16:18:06,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:18:06,938 INFO L93 Difference]: Finished difference Result 143 states and 178 transitions. [2023-12-16 16:18:06,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 16:18:06,939 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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 24 [2023-12-16 16:18:06,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:18:06,939 INFO L225 Difference]: With dead ends: 143 [2023-12-16 16:18:06,939 INFO L226 Difference]: Without dead ends: 105 [2023-12-16 16:18:06,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 16:18:06,940 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 8 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 16:18:06,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 177 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 16:18:06,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-12-16 16:18:06,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 98. [2023-12-16 16:18:06,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 92 states have (on average 1.315217391304348) internal successors, (121), 97 states have internal predecessors, (121), 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 16:18:06,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 121 transitions. [2023-12-16 16:18:06,949 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 121 transitions. Word has length 24 [2023-12-16 16:18:06,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:18:06,949 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 121 transitions. [2023-12-16 16:18:06,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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 16:18:06,949 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 121 transitions. [2023-12-16 16:18:06,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-16 16:18:06,950 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:18:06,950 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:18:06,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-16 16:18:07,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:18:07,169 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-16 16:18:07,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:18:07,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1044619042, now seen corresponding path program 1 times [2023-12-16 16:18:07,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:18:07,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1153529801] [2023-12-16 16:18:07,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:18:07,170 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-16 16:18:07,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:18:07,171 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:18:07,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-16 16:18:07,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:18:07,312 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-16 16:18:07,315 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:18:07,327 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 7 [2023-12-16 16:18:07,382 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-16 16:18:07,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-16 16:18:07,391 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 16:18:07,394 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 16:18:07,399 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 16:18:07,403 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 16:18:07,451 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 11 treesize of output 7 [2023-12-16 16:18:07,456 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 16:18:07,467 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 16:18:07,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:18:07,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 75 [2023-12-16 16:18:07,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2023-12-16 16:18:07,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:18:07,545 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 16:18:07,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 treesize of output 14 [2023-12-16 16:18:07,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:18:07,593 INFO L349 Elim1Store]: treesize reduction 44, result has 10.2 percent of original size [2023-12-16 16:18:07,593 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 108 treesize of output 81 [2023-12-16 16:18:07,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2023-12-16 16:18:07,616 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-16 16:18:07,616 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 1 case distinctions, treesize of input 16 treesize of output 15 [2023-12-16 16:18:07,631 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-16 16:18:07,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 18 [2023-12-16 16:18:07,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2023-12-16 16:18:07,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-16 16:18:07,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 16 treesize of output 11 [2023-12-16 16:18:07,691 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 36 treesize of output 27 [2023-12-16 16:18:07,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-16 16:18:07,810 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 16:18:07,814 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 16:18:07,836 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:18:07,837 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:18:07,931 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_394 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_393 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_394) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_393) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_395) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (_ bv1 32))) is different from false [2023-12-16 16:18:08,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:18:08,597 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 2 case distinctions, treesize of input 48 treesize of output 54 [2023-12-16 16:18:08,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:18:08,615 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 92 treesize of output 91 [2023-12-16 16:18:08,623 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:18:08,624 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 69 [2023-12-16 16:18:08,630 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 31 treesize of output 17 [2023-12-16 16:18:08,836 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:18:08,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 96 [2023-12-16 16:18:08,845 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:18:08,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 80 [2023-12-16 16:18:08,867 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:18:08,867 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 300 treesize of output 223 [2023-12-16 16:18:08,888 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 143 treesize of output 141 [2023-12-16 16:18:08,893 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 141 treesize of output 137 [2023-12-16 16:18:08,914 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:18:08,914 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 246 treesize of output 245 [2023-12-16 16:18:08,925 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 171 treesize of output 169 [2023-12-16 16:18:08,931 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 169 treesize of output 165 [2023-12-16 16:18:08,938 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 165 treesize of output 163 [2023-12-16 16:18:08,945 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 163 treesize of output 159 [2023-12-16 16:18:21,639 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-16 16:18:21,640 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:18:21,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1153529801] [2023-12-16 16:18:21,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1153529801] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:18:21,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:18:21,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-12-16 16:18:21,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414415255] [2023-12-16 16:18:21,640 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:18:21,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-16 16:18:21,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:18:21,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-16 16:18:21,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=186, Unknown=13, NotChecked=28, Total=272 [2023-12-16 16:18:21,641 INFO L87 Difference]: Start difference. First operand 98 states and 121 transitions. Second operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 states have internal predecessors, (46), 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 16:18:28,732 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 [1] [2023-12-16 16:18:32,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-16 16:18:48,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:18:48,205 INFO L93 Difference]: Finished difference Result 285 states and 350 transitions. [2023-12-16 16:18:48,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-16 16:18:48,207 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 states have internal predecessors, (46), 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 24 [2023-12-16 16:18:48,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:18:48,208 INFO L225 Difference]: With dead ends: 285 [2023-12-16 16:18:48,208 INFO L226 Difference]: Without dead ends: 283 [2023-12-16 16:18:48,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=132, Invalid=575, Unknown=53, NotChecked=52, Total=812 [2023-12-16 16:18:48,209 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 309 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 32 mSolverCounterUnsat, 47 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 47 IncrementalHoareTripleChecker+Unknown, 234 IncrementalHoareTripleChecker+Unchecked, 23.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:18:48,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 618 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 489 Invalid, 47 Unknown, 234 Unchecked, 23.1s Time] [2023-12-16 16:18:48,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2023-12-16 16:18:48,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 113. [2023-12-16 16:18:48,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 107 states have (on average 1.3457943925233644) internal successors, (144), 112 states have internal predecessors, (144), 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 16:18:48,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 144 transitions. [2023-12-16 16:18:48,229 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 144 transitions. Word has length 24 [2023-12-16 16:18:48,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:18:48,230 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 144 transitions. [2023-12-16 16:18:48,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 states have internal predecessors, (46), 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 16:18:48,230 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 144 transitions. [2023-12-16 16:18:48,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-16 16:18:48,234 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:18:48,234 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:18:48,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-16 16:18:48,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:18:48,441 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-16 16:18:48,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:18:48,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1571921691, now seen corresponding path program 1 times [2023-12-16 16:18:48,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:18:48,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1858364860] [2023-12-16 16:18:48,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:18:48,442 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-16 16:18:48,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:18:48,443 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-16 16:18:48,445 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-16 16:18:48,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:18:48,593 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-16 16:18:48,600 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:18:48,614 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 7 [2023-12-16 16:18:48,620 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-16 16:18:48,657 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 26 treesize of output 21 [2023-12-16 16:18:48,665 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 35 treesize of output 18 [2023-12-16 16:18:48,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 11 [2023-12-16 16:18:48,678 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-16 16:18:48,679 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 13 treesize of output 13 [2023-12-16 16:18:48,732 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 16:18:48,848 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 20 treesize of output 16 [2023-12-16 16:18:48,877 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-16 16:18:48,878 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 1 case distinctions, treesize of input 16 treesize of output 15 [2023-12-16 16:18:48,900 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 20 treesize of output 16 [2023-12-16 16:18:48,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:18:48,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:18:48,940 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 30 treesize of output 27 [2023-12-16 16:18:48,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2023-12-16 16:18:48,985 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 16:18:48,985 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:18:49,100 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 41 treesize of output 37 [2023-12-16 16:18:49,110 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 37 treesize of output 33 [2023-12-16 16:18:49,150 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))) (and (forall ((v_ArrVal_464 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_465 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~tmp~0#1.base_12| (_ BitVec 32))) (let ((.cse0 (store |c_#memory_int#1| |v_ULTIMATE.start_main_~tmp~0#1.base_12| v_ArrVal_464))) (or (= (select (select (store .cse0 |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_465) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) (_ bv0 32)) (= |c_ULTIMATE.start_main_~x~0#1.base| |v_ULTIMATE.start_main_~tmp~0#1.base_12|) (not (= v_ArrVal_465 (store (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_465 |c_ULTIMATE.start_main_~x~0#1.offset|))))))) (or (forall ((v_ArrVal_464 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_465 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~tmp~0#1.base_12| (_ BitVec 32))) (let ((.cse2 (store |c_#memory_int#1| |v_ULTIMATE.start_main_~tmp~0#1.base_12| v_ArrVal_464))) (or (= (select (select (store .cse2 |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_465) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) (_ bv0 32)) (not (= v_ArrVal_465 (store (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_465 |c_ULTIMATE.start_main_~x~0#1.offset|))))))) (= |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv0 32))))) is different from false [2023-12-16 16:18:49,511 WARN L854 $PredicateComparison]: unable to prove that (and (or (forall ((|v_ULTIMATE.start_main_~x~0#1.base_74| (_ BitVec 32))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_74|) (_ bv0 1)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~x~0#1.base_74| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_74|) (_ bv0 1))) (forall ((v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_457) |v_ULTIMATE.start_main_~x~0#1.base_74| v_ArrVal_458) |c_ULTIMATE.start_main_~head~0#1.base|) (_ bv4 32)) (_ bv0 32))) (not (= (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_457 |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_457))))))) is different from false [2023-12-16 16:18:49,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-16 16:18:49,530 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:18:49,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1858364860] [2023-12-16 16:18:49,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1858364860] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:18:49,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:18:49,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2023-12-16 16:18:49,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919286249] [2023-12-16 16:18:49,530 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:18:49,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-16 16:18:49,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:18:49,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-16 16:18:49,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=116, Unknown=6, NotChecked=46, Total=210 [2023-12-16 16:18:49,531 INFO L87 Difference]: Start difference. First operand 113 states and 144 transitions. Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 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 16:18:50,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:18:50,602 INFO L93 Difference]: Finished difference Result 187 states and 228 transitions. [2023-12-16 16:18:50,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 16:18:50,603 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 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 26 [2023-12-16 16:18:50,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:18:50,603 INFO L225 Difference]: With dead ends: 187 [2023-12-16 16:18:50,604 INFO L226 Difference]: Without dead ends: 185 [2023-12-16 16:18:50,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=195, Unknown=6, NotChecked=62, Total=342 [2023-12-16 16:18:50,604 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 178 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 232 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-16 16:18:50,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 480 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 231 Invalid, 0 Unknown, 232 Unchecked, 0.9s Time] [2023-12-16 16:18:50,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2023-12-16 16:18:50,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 128. [2023-12-16 16:18:50,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 122 states have (on average 1.3442622950819672) internal successors, (164), 127 states have internal predecessors, (164), 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 16:18:50,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 164 transitions. [2023-12-16 16:18:50,618 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 164 transitions. Word has length 26 [2023-12-16 16:18:50,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:18:50,619 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 164 transitions. [2023-12-16 16:18:50,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 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 16:18:50,619 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 164 transitions. [2023-12-16 16:18:50,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-16 16:18:50,621 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:18:50,621 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:18:50,625 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-16 16:18:50,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:18:50,826 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-16 16:18:50,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:18:50,826 INFO L85 PathProgramCache]: Analyzing trace with hash -762575065, now seen corresponding path program 1 times [2023-12-16 16:18:50,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:18:50,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1867943556] [2023-12-16 16:18:50,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:18:50,827 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:18:50,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:18:50,828 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:18:50,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-16 16:18:50,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:18:50,991 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-16 16:18:50,992 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:18:50,995 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 7 [2023-12-16 16:18:51,009 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-16 16:18:51,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 14 treesize of output 20 [2023-12-16 16:18:51,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:18:51,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2023-12-16 16:18:51,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:18:51,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-12-16 16:18:51,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-12-16 16:18:51,150 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 16:18:51,150 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:18:51,151 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:18:51,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1867943556] [2023-12-16 16:18:51,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1867943556] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:18:51,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:18:51,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 16:18:51,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549336356] [2023-12-16 16:18:51,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:18:51,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 16:18:51,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:18:51,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 16:18:51,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-16 16:18:51,152 INFO L87 Difference]: Start difference. First operand 128 states and 164 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 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 16:18:51,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:18:51,570 INFO L93 Difference]: Finished difference Result 195 states and 240 transitions. [2023-12-16 16:18:51,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 16:18:51,570 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 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 26 [2023-12-16 16:18:51,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:18:51,576 INFO L225 Difference]: With dead ends: 195 [2023-12-16 16:18:51,577 INFO L226 Difference]: Without dead ends: 170 [2023-12-16 16:18:51,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-12-16 16:18:51,579 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 153 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 16:18:51,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 163 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 16:18:51,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2023-12-16 16:18:51,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 137. [2023-12-16 16:18:51,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 131 states have (on average 1.3358778625954197) internal successors, (175), 136 states have internal predecessors, (175), 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 16:18:51,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 175 transitions. [2023-12-16 16:18:51,598 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 175 transitions. Word has length 26 [2023-12-16 16:18:51,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:18:51,598 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 175 transitions. [2023-12-16 16:18:51,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 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 16:18:51,598 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 175 transitions. [2023-12-16 16:18:51,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-16 16:18:51,598 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:18:51,599 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:18:51,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-16 16:18:51,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:18:51,808 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-16 16:18:51,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:18:51,808 INFO L85 PathProgramCache]: Analyzing trace with hash 960418098, now seen corresponding path program 1 times [2023-12-16 16:18:51,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:18:51,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1460645468] [2023-12-16 16:18:51,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:18:51,809 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-16 16:18:51,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:18:51,817 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-16 16:18:51,818 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-16 16:18:51,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:18:51,929 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-16 16:18:51,942 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:18:51,945 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 7 [2023-12-16 16:18:51,968 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-16 16:18:51,968 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 13 treesize of output 13 [2023-12-16 16:18:51,972 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 16:18:51,978 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 16:18:52,036 INFO L349 Elim1Store]: treesize reduction 63, result has 10.0 percent of original size [2023-12-16 16:18:52,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 90 [2023-12-16 16:18:52,050 INFO L349 Elim1Store]: treesize reduction 31, result has 26.2 percent of original size [2023-12-16 16:18:52,050 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 62 [2023-12-16 16:18:52,234 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:18:52,234 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:18:57,696 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:18:57,696 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 6 new quantified variables, introduced 10 case distinctions, treesize of input 9966 treesize of output 9459 [2023-12-16 16:19:03,253 WARN L293 SmtUtils]: Spent 5.21s on a formula simplification. DAG size of input: 453 DAG size of output: 267 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-16 16:19:03,254 INFO L349 Elim1Store]: treesize reduction 738, result has 46.0 percent of original size [2023-12-16 16:19:03,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 16 new quantified variables, introduced 106 case distinctions, treesize of input 93116 treesize of output 90260 Received shutdown request... [2023-12-16 16:19:05,326 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-12-16 16:19:05,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-12-16 16:19:05,336 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 16:19:05,364 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 (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 16:19:05,531 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-16 16:19:05,531 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 27 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-71-3-2-3-4-3-4-3-3-3-3-5-5-5-3-5-5-5-5-5-5-3-3-3-3-3-2-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ∧-90-5-6-5-6-5-5-5-5-5-5-5-5-5-5-5-5-3-3-3-3-2-1 context. [2023-12-16 16:19:05,534 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-12-16 16:19:05,535 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2023-12-16 16:19:05,535 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2023-12-16 16:19:05,535 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2023-12-16 16:19:05,536 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2023-12-16 16:19:05,537 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-12-16 16:19:05,539 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:19:05,542 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 16:19:05,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:19:05 BoogieIcfgContainer [2023-12-16 16:19:05,544 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 16:19:05,544 INFO L158 Benchmark]: Toolchain (without parser) took 73335.37ms. Allocated memory was 180.4MB in the beginning and 376.4MB in the end (delta: 196.1MB). Free memory was 138.2MB in the beginning and 275.1MB in the end (delta: -136.9MB). Peak memory consumption was 219.6MB. Max. memory is 8.0GB. [2023-12-16 16:19:05,544 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 180.4MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 16:19:05,545 INFO L158 Benchmark]: CACSL2BoogieTranslator took 348.01ms. Allocated memory is still 180.4MB. Free memory was 138.2MB in the beginning and 117.6MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2023-12-16 16:19:05,545 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.34ms. Allocated memory is still 180.4MB. Free memory was 117.6MB in the beginning and 115.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 16:19:05,545 INFO L158 Benchmark]: Boogie Preprocessor took 41.96ms. Allocated memory is still 180.4MB. Free memory was 115.1MB in the beginning and 112.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 16:19:05,545 INFO L158 Benchmark]: RCFGBuilder took 595.80ms. Allocated memory is still 180.4MB. Free memory was 111.6MB in the beginning and 90.3MB in the end (delta: 21.3MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2023-12-16 16:19:05,546 INFO L158 Benchmark]: TraceAbstraction took 72282.15ms. Allocated memory was 217.1MB in the beginning and 376.4MB in the end (delta: 159.4MB). Free memory was 186.0MB in the beginning and 275.1MB in the end (delta: -89.1MB). Peak memory consumption was 229.7MB. Max. memory is 8.0GB. [2023-12-16 16:19:05,548 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.12ms. Allocated memory is still 180.4MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 348.01ms. Allocated memory is still 180.4MB. Free memory was 138.2MB in the beginning and 117.6MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.34ms. Allocated memory is still 180.4MB. Free memory was 117.6MB in the beginning and 115.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.96ms. Allocated memory is still 180.4MB. Free memory was 115.1MB in the beginning and 112.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 595.80ms. Allocated memory is still 180.4MB. Free memory was 111.6MB in the beginning and 90.3MB in the end (delta: 21.3MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 72282.15ms. Allocated memory was 217.1MB in the beginning and 376.4MB in the end (delta: 159.4MB). Free memory was 186.0MB in the beginning and 275.1MB in the end (delta: -89.1MB). Peak memory consumption was 229.7MB. 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: 1036]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1036). Cancelled while NwaCegarLoop was analyzing trace of length 27 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-71-3-2-3-4-3-4-3-3-3-3-5-5-5-3-5-5-5-5-5-5-3-3-3-3-3-2-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ∧-90-5-6-5-6-5-5-5-5-5-5-5-5-5-5-5-5-3-3-3-3-2-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 27 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-71-3-2-3-4-3-4-3-3-3-3-5-5-5-3-5-5-5-5-5-5-3-3-3-3-3-2-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ∧-90-5-6-5-6-5-5-5-5-5-5-5-5-5-5-5-5-3-3-3-3-2-1 context. - TimeoutResultAtElement [Line: 1029]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1029). Cancelled while NwaCegarLoop was analyzing trace of length 27 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-71-3-2-3-4-3-4-3-3-3-3-5-5-5-3-5-5-5-5-5-5-3-3-3-3-3-2-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ∧-90-5-6-5-6-5-5-5-5-5-5-5-5-5-5-5-5-3-3-3-3-2-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 27 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-71-3-2-3-4-3-4-3-3-3-3-5-5-5-3-5-5-5-5-5-5-3-3-3-3-3-2-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ∧-90-5-6-5-6-5-5-5-5-5-5-5-5-5-5-5-5-3-3-3-3-2-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 27 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-71-3-2-3-4-3-4-3-3-3-3-5-5-5-3-5-5-5-5-5-5-3-3-3-3-3-2-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ∧-90-5-6-5-6-5-5-5-5-5-5-5-5-5-5-5-5-3-3-3-3-2-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 27 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-71-3-2-3-4-3-4-3-3-3-3-5-5-5-3-5-5-5-5-5-5-3-3-3-3-3-2-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ∧-90-5-6-5-6-5-5-5-5-5-5-5-5-5-5-5-5-3-3-3-3-2-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 27 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-71-3-2-3-4-3-4-3-3-3-3-5-5-5-3-5-5-5-5-5-5-3-3-3-3-3-2-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ∧-90-5-6-5-6-5-5-5-5-5-5-5-5-5-5-5-5-3-3-3-3-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 59 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 72.2s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 33.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 47 mSolverCounterUnknown, 1306 SdHoareTripleChecker+Valid, 29.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1306 mSDsluCounter, 3370 SdHoareTripleChecker+Invalid, 28.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1130 IncrementalHoareTripleChecker+Unchecked, 2778 mSDsCounter, 111 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1910 IncrementalHoareTripleChecker+Invalid, 3198 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 111 mSolverCounterUnsat, 592 mSDtfsCounter, 1910 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 360 GetRequests, 233 SyntacticMatches, 10 SemanticMatches, 117 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 20.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137occurred in iteration=11, InterpolantAutomatonStates: 93, 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, 11 MinimizatonAttempts, 459 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 21.3s InterpolantComputationTime, 203 NumberOfCodeBlocks, 203 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 318 ConstructedInterpolants, 47 QuantifiedInterpolants, 6971 SizeOfPredicates, 95 NumberOfNonLiveVariables, 1206 ConjunctsInSsa, 204 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 12/72 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