/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/ldv-sets/test_mutex_unbounded-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 21:22:12,584 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 21:22:12,623 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-24 21:22:12,626 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 21:22:12,627 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 21:22:12,641 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 21:22:12,641 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 21:22:12,642 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 21:22:12,642 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 21:22:12,646 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 21:22:12,646 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 21:22:12,646 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 21:22:12,647 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 21:22:12,648 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 21:22:12,648 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 21:22:12,648 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 21:22:12,648 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 21:22:12,649 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 21:22:12,649 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 21:22:12,649 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 21:22:12,649 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 21:22:12,650 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 21:22:12,650 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 21:22:12,650 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 21:22:12,650 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 21:22:12,650 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 21:22:12,650 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 21:22:12,650 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 21:22:12,651 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 21:22:12,651 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 21:22:12,652 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 21:22:12,652 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 21:22:12,652 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 21:22:12,652 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 21:22:12,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 21:22:12,652 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 21:22:12,652 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 21:22:12,652 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 21:22:12,653 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 21:22:12,653 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 21:22:12,653 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 21:22:12,653 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 21:22:12,653 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 21:22:12,654 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 21:22:12,654 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 21:22:12,654 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 21:22:12,654 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-24 21:22:12,845 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 21:22:12,867 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 21:22:12,868 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 21:22:12,869 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 21:22:12,869 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 21:22:12,871 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-sets/test_mutex_unbounded-1.i [2023-12-24 21:22:13,938 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 21:22:14,146 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 21:22:14,147 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_unbounded-1.i [2023-12-24 21:22:14,170 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/265f06f09/ab292774de2e4ae8bdc058aa6e8c85b5/FLAGb3fd41e61 [2023-12-24 21:22:14,183 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/265f06f09/ab292774de2e4ae8bdc058aa6e8c85b5 [2023-12-24 21:22:14,185 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 21:22:14,187 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 21:22:14,189 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 21:22:14,189 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 21:22:14,194 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 21:22:14,194 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 09:22:14" (1/1) ... [2023-12-24 21:22:14,195 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7801e93e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:22:14, skipping insertion in model container [2023-12-24 21:22:14,195 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 09:22:14" (1/1) ... [2023-12-24 21:22:14,233 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 21:22:14,515 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_unbounded-1.i[26271,26284] [2023-12-24 21:22:14,521 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_unbounded-1.i[26396,26409] [2023-12-24 21:22:14,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/ldv-sets/test_mutex_unbounded-1.i[26511,26524] [2023-12-24 21:22:14,540 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 21:22:14,562 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-12-24 21:22:14,570 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 21:22:14,604 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_unbounded-1.i[26271,26284] [2023-12-24 21:22:14,607 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_unbounded-1.i[26396,26409] [2023-12-24 21:22:14,608 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_unbounded-1.i[26511,26524] [2023-12-24 21:22:14,612 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 21:22:14,614 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 21:22:14,664 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_unbounded-1.i[26271,26284] [2023-12-24 21:22:14,665 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_unbounded-1.i[26396,26409] [2023-12-24 21:22:14,665 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_unbounded-1.i[26511,26524] [2023-12-24 21:22:14,675 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 21:22:14,709 INFO L206 MainTranslator]: Completed translation [2023-12-24 21:22:14,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:22:14 WrapperNode [2023-12-24 21:22:14,709 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 21:22:14,710 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 21:22:14,710 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 21:22:14,710 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 21:22:14,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:22:14" (1/1) ... [2023-12-24 21:22:14,739 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:22:14" (1/1) ... [2023-12-24 21:22:14,773 INFO L138 Inliner]: procedures = 143, calls = 62, calls flagged for inlining = 15, calls inlined = 14, statements flattened = 181 [2023-12-24 21:22:14,774 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 21:22:14,774 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 21:22:14,774 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 21:22:14,774 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 21:22:14,782 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:22:14" (1/1) ... [2023-12-24 21:22:14,782 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:22:14" (1/1) ... [2023-12-24 21:22:14,785 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:22:14" (1/1) ... [2023-12-24 21:22:14,814 INFO L175 MemorySlicer]: Split 28 memory accesses to 2 slices as follows [2, 26]. 93 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 4]. The 7 writes are split as follows [0, 7]. [2023-12-24 21:22:14,814 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:22:14" (1/1) ... [2023-12-24 21:22:14,815 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:22:14" (1/1) ... [2023-12-24 21:22:14,824 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:22:14" (1/1) ... [2023-12-24 21:22:14,827 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:22:14" (1/1) ... [2023-12-24 21:22:14,829 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:22:14" (1/1) ... [2023-12-24 21:22:14,831 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:22:14" (1/1) ... [2023-12-24 21:22:14,834 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 21:22:14,835 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 21:22:14,835 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 21:22:14,835 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 21:22:14,836 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:22:14" (1/1) ... [2023-12-24 21:22:14,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 21:22:14,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 21:22:14,861 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-24 21:22:14,876 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-24 21:22:14,906 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2023-12-24 21:22:14,907 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2023-12-24 21:22:14,907 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2023-12-24 21:22:14,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2023-12-24 21:22:14,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-24 21:22:14,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 21:22:14,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-24 21:22:14,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-24 21:22:14,907 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2023-12-24 21:22:14,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2023-12-24 21:22:14,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-24 21:22:14,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-24 21:22:14,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-24 21:22:14,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-24 21:22:14,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-24 21:22:14,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 21:22:14,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 21:22:14,908 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2023-12-24 21:22:14,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2023-12-24 21:22:14,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 21:22:14,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 21:22:15,018 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 21:22:15,020 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 21:22:15,485 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 21:22:15,541 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 21:22:15,541 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-12-24 21:22:15,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 09:22:15 BoogieIcfgContainer [2023-12-24 21:22:15,542 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 21:22:15,543 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 21:22:15,543 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 21:22:15,546 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 21:22:15,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 09:22:14" (1/3) ... [2023-12-24 21:22:15,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dcd1050 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 09:22:15, skipping insertion in model container [2023-12-24 21:22:15,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:22:14" (2/3) ... [2023-12-24 21:22:15,548 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dcd1050 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 09:22:15, skipping insertion in model container [2023-12-24 21:22:15,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 09:22:15" (3/3) ... [2023-12-24 21:22:15,549 INFO L112 eAbstractionObserver]: Analyzing ICFG test_mutex_unbounded-1.i [2023-12-24 21:22:15,567 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 21:22:15,567 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-12-24 21:22:15,605 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 21:22:15,612 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;@32880ea1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 21:22:15,612 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-24 21:22:15,615 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 40 states have internal predecessors, (57), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-24 21:22:15,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-24 21:22:15,622 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:22:15,622 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:22:15,623 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:22:15,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:22:15,628 INFO L85 PathProgramCache]: Analyzing trace with hash 2000708181, now seen corresponding path program 1 times [2023-12-24 21:22:15,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:22:15,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1225364476] [2023-12-24 21:22:15,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:22:15,642 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-24 21:22:15,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:22:15,672 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-24 21:22:15,696 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-24 21:22:15,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:22:15,787 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 21:22:15,789 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:22:15,802 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-24 21:22:15,802 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:22:15,803 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:22:15,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1225364476] [2023-12-24 21:22:15,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1225364476] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:22:15,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:22:15,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 21:22:15,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663791188] [2023-12-24 21:22:15,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:22:15,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 21:22:15,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:22:15,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 21:22:15,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 21:22:15,828 INFO L87 Difference]: Start difference. First operand has 53 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 40 states have internal predecessors, (57), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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-24 21:22:15,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:22:15,914 INFO L93 Difference]: Finished difference Result 105 states and 150 transitions. [2023-12-24 21:22:15,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 21:22:15,917 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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 9 [2023-12-24 21:22:15,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:22:15,922 INFO L225 Difference]: With dead ends: 105 [2023-12-24 21:22:15,922 INFO L226 Difference]: Without dead ends: 51 [2023-12-24 21:22:15,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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-24 21:22:15,928 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 21:22:15,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 21:22:15,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-24 21:22:15,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-12-24 21:22:15,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 38 states have internal predecessors, (46), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-24 21:22:15,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2023-12-24 21:22:15,965 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 9 [2023-12-24 21:22:15,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:22:15,966 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2023-12-24 21:22:15,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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-24 21:22:15,966 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2023-12-24 21:22:15,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-24 21:22:15,968 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:22:15,968 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:22:15,978 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 (2)] Ended with exit code 0 [2023-12-24 21:22:16,171 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-24 21:22:16,172 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:22:16,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:22:16,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1658557476, now seen corresponding path program 1 times [2023-12-24 21:22:16,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:22:16,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [98676246] [2023-12-24 21:22:16,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:22:16,175 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-24 21:22:16,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:22:16,178 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-24 21:22:16,179 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-24 21:22:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:22:16,239 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 21:22:16,240 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:22:16,346 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-24 21:22:16,346 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:22:16,346 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:22:16,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [98676246] [2023-12-24 21:22:16,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [98676246] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:22:16,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:22:16,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 21:22:16,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673584448] [2023-12-24 21:22:16,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:22:16,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 21:22:16,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:22:16,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 21:22:16,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 21:22:16,350 INFO L87 Difference]: Start difference. First operand 51 states and 62 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-24 21:22:16,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:22:16,609 INFO L93 Difference]: Finished difference Result 95 states and 118 transitions. [2023-12-24 21:22:16,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 21:22:16,609 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 9 [2023-12-24 21:22:16,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:22:16,611 INFO L225 Difference]: With dead ends: 95 [2023-12-24 21:22:16,611 INFO L226 Difference]: Without dead ends: 91 [2023-12-24 21:22:16,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-24 21:22:16,612 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 44 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 21:22:16,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 120 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 21:22:16,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-12-24 21:22:16,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 75. [2023-12-24 21:22:16,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 58 states have internal predecessors, (75), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-24 21:22:16,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 97 transitions. [2023-12-24 21:22:16,623 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 97 transitions. Word has length 9 [2023-12-24 21:22:16,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:22:16,623 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 97 transitions. [2023-12-24 21:22:16,623 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-24 21:22:16,624 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 97 transitions. [2023-12-24 21:22:16,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-24 21:22:16,624 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:22:16,624 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:22:16,633 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 (3)] Ended with exit code 0 [2023-12-24 21:22:16,827 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-24 21:22:16,828 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:22:16,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:22:16,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1526787684, now seen corresponding path program 1 times [2023-12-24 21:22:16,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:22:16,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1994433697] [2023-12-24 21:22:16,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:22:16,829 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-24 21:22:16,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:22:16,831 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-24 21:22:16,839 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-24 21:22:16,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:22:16,918 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-24 21:22:16,922 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:22:17,001 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-24 21:22:17,002 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:22:17,002 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:22:17,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1994433697] [2023-12-24 21:22:17,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1994433697] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:22:17,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:22:17,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 21:22:17,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194642414] [2023-12-24 21:22:17,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:22:17,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 21:22:17,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:22:17,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 21:22:17,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 21:22:17,004 INFO L87 Difference]: Start difference. First operand 75 states and 97 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 21:22:17,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:22:17,300 INFO L93 Difference]: Finished difference Result 132 states and 165 transitions. [2023-12-24 21:22:17,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 21:22:17,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-12-24 21:22:17,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:22:17,302 INFO L225 Difference]: With dead ends: 132 [2023-12-24 21:22:17,302 INFO L226 Difference]: Without dead ends: 62 [2023-12-24 21:22:17,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-24 21:22:17,303 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 14 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 21:22:17,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 126 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 21:22:17,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-12-24 21:22:17,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 57. [2023-12-24 21:22:17,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.25) internal successors, (50), 43 states have internal predecessors, (50), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-24 21:22:17,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2023-12-24 21:22:17,309 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 12 [2023-12-24 21:22:17,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:22:17,309 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2023-12-24 21:22:17,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 21:22:17,309 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2023-12-24 21:22:17,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-24 21:22:17,310 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:22:17,310 INFO L195 NwaCegarLoop]: trace histogram [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-24 21:22:17,331 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-24 21:22:17,513 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-24 21:22:17,514 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:22:17,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:22:17,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1767248851, now seen corresponding path program 1 times [2023-12-24 21:22:17,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:22:17,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [278238118] [2023-12-24 21:22:17,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:22:17,515 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-24 21:22:17,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:22:17,516 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-24 21:22:17,517 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-24 21:22:17,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:22:17,604 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-24 21:22:17,606 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:22:17,681 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-24 21:22:17,682 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-24 21:22:17,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 49 treesize of output 47 [2023-12-24 21:22:17,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 62 treesize of output 54 [2023-12-24 21:22:17,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 54 treesize of output 52 [2023-12-24 21:22:17,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 55 [2023-12-24 21:22:17,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-12-24 21:22:17,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2023-12-24 21:22:17,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 49 treesize of output 47 [2023-12-24 21:22:17,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 59 treesize of output 51 [2023-12-24 21:22:17,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2023-12-24 21:22:17,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 45 [2023-12-24 21:22:21,196 INFO L349 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2023-12-24 21:22:21,196 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 1 case distinctions, treesize of input 18 treesize of output 26 [2023-12-24 21:22:21,200 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 49 treesize of output 28 [2023-12-24 21:22:21,243 INFO L349 Elim1Store]: treesize reduction 78, result has 25.0 percent of original size [2023-12-24 21:22:21,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 28 treesize of output 42 [2023-12-24 21:22:21,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 34 treesize of output 42 [2023-12-24 21:22:21,916 INFO L349 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2023-12-24 21:22:21,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 18 treesize of output 30 [2023-12-24 21:22:21,923 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 32 [2023-12-24 21:22:21,943 INFO L349 Elim1Store]: treesize reduction 11, result has 42.1 percent of original size [2023-12-24 21:22:21,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 22 [2023-12-24 21:22:21,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-12-24 21:22:21,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 42 [2023-12-24 21:22:23,784 INFO L349 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2023-12-24 21:22:23,784 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 1 case distinctions, treesize of input 18 treesize of output 26 [2023-12-24 21:22:23,788 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:22:23,789 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 49 treesize of output 28 [2023-12-24 21:22:23,832 INFO L349 Elim1Store]: treesize reduction 78, result has 25.0 percent of original size [2023-12-24 21:22:23,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 28 treesize of output 42 [2023-12-24 21:22:24,616 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 16 treesize of output 8 [2023-12-24 21:22:24,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:22:24,649 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:22:25,777 INFO L349 Elim1Store]: treesize reduction 136, result has 36.7 percent of original size [2023-12-24 21:22:25,777 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 4 case distinctions, treesize of input 554 treesize of output 361 [2023-12-24 21:22:25,793 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 144 treesize of output 142 [2023-12-24 21:22:25,867 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:22:25,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 225 treesize of output 253 [2023-12-24 21:22:25,886 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 130 treesize of output 126 [2023-12-24 21:22:26,347 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 8 treesize of output 4 [2023-12-24 21:22:26,439 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 8 treesize of output 4 [2023-12-24 21:22:26,599 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2023-12-24 21:22:26,600 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 39 treesize of output 36 [2023-12-24 21:22:26,626 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 6 treesize of output 4 [2023-12-24 21:22:26,643 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:22:26,644 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 47 treesize of output 51 [2023-12-24 21:22:26,802 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:22:26,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 148 treesize of output 238 [2023-12-24 21:22:27,173 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:22:27,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:22:27,182 INFO L349 Elim1Store]: treesize reduction 94, result has 1.1 percent of original size [2023-12-24 21:22:27,182 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 3 case distinctions, treesize of input 44 treesize of output 1 [2023-12-24 21:22:27,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:22:27,375 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:22:27,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [278238118] [2023-12-24 21:22:27,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [278238118] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:22:27,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:22:27,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2023-12-24 21:22:27,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788657108] [2023-12-24 21:22:27,392 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:22:27,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-24 21:22:27,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:22:27,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-24 21:22:27,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2023-12-24 21:22:27,393 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand has 25 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 19 states have internal predecessors, (31), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-24 21:22:28,231 WARN L876 $PredicateComparison]: unable to prove that (and (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ldv_list_add_#in~head.base|))) (let ((.cse2 (exists ((__ldv_list_add_~next.offset (_ BitVec 32))) (= |c_ldv_list_add_#in~new.base| (select .cse1 (bvadd (_ bv4 32) __ldv_list_add_~next.offset))))) (.cse0 (= |c_ldv_list_add_#in~new.base| (select .cse1 |c_ldv_list_add_#in~head.offset|)))) (or (and (not (= |c_ldv_list_add_#in~head.base| |c_ldv_list_add_#in~new.base|)) .cse0) (and (exists ((__ldv_list_add_~new.offset (_ BitVec 32))) (and (= |c_ldv_list_add_#in~head.base| (select .cse1 (bvadd (_ bv4 32) __ldv_list_add_~new.offset))) (= |c_ldv_list_add_#in~head.base| (select .cse1 __ldv_list_add_~new.offset)))) .cse2 .cse0) (and .cse2 .cse0 (exists ((__ldv_list_add_~new.offset (_ BitVec 32))) (and (= |c_ldv_list_add_#in~head.base| (select .cse1 (bvadd (_ bv4 32) __ldv_list_add_~new.offset))) (= |c_ldv_list_add_#in~new.base| (select .cse1 __ldv_list_add_~new.offset))))) (exists ((v_arrayElimArr_2 (Array (_ BitVec 32) (_ BitVec 32))) (__ldv_list_add_~new.offset (_ BitVec 32)) (v_DerPreprocessor_1 (Array (_ BitVec 32) (_ BitVec 32))) (__ldv_list_add_~next.base (_ BitVec 32)) (__ldv_list_add_~next.offset (_ BitVec 32))) (and (= .cse1 (store (select (let ((.cse3 (store (store |c_#memory_$Pointer$#1.base| |c_ldv_list_add_#in~head.base| v_DerPreprocessor_1) __ldv_list_add_~next.base v_arrayElimArr_2))) (store .cse3 |c_ldv_list_add_#in~new.base| (store (store (select .cse3 |c_ldv_list_add_#in~new.base|) __ldv_list_add_~new.offset __ldv_list_add_~next.base) (bvadd (_ bv4 32) __ldv_list_add_~new.offset) |c_ldv_list_add_#in~head.base|))) |c_ldv_list_add_#in~head.base|) |c_ldv_list_add_#in~head.offset| |c_ldv_list_add_#in~new.base|)) (not (= |c_ldv_list_add_#in~new.base| __ldv_list_add_~next.base)) (= |c_ldv_list_add_#in~new.base| (select v_arrayElimArr_2 (bvadd (_ bv4 32) __ldv_list_add_~next.offset)))))))) (= (_ bv0 1) (bvadd (select |c_#valid| (_ bv4 32)) (_ bv1 1))) (= |c_#valid| |c_old(#valid)|) (= (_ bv4 32) |c_~#drvlist~0.base|) (= |c_ldv_list_add_#in~head.offset| c_ldv_list_add_~head.offset) (= |c_ldv_list_add_#in~new.base| c_ldv_list_add_~new.base) (= |c_ldv_list_add_#in~head.base| c_ldv_list_add_~head.base)) is different from true [2023-12-24 21:22:29,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:22:29,840 INFO L93 Difference]: Finished difference Result 167 states and 208 transitions. [2023-12-24 21:22:29,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-24 21:22:29,841 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 19 states have internal predecessors, (31), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 24 [2023-12-24 21:22:29,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:22:29,843 INFO L225 Difference]: With dead ends: 167 [2023-12-24 21:22:29,843 INFO L226 Difference]: Without dead ends: 146 [2023-12-24 21:22:29,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=265, Invalid=1378, Unknown=1, NotChecked=78, Total=1722 [2023-12-24 21:22:29,844 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 442 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-24 21:22:29,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 308 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 649 Invalid, 0 Unknown, 22 Unchecked, 1.7s Time] [2023-12-24 21:22:29,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-12-24 21:22:29,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 100. [2023-12-24 21:22:29,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 75 states have (on average 1.3333333333333333) internal successors, (100), 79 states have internal predecessors, (100), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-24 21:22:29,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 128 transitions. [2023-12-24 21:22:29,858 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 128 transitions. Word has length 24 [2023-12-24 21:22:29,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:22:29,858 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 128 transitions. [2023-12-24 21:22:29,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 19 states have internal predecessors, (31), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-24 21:22:29,858 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 128 transitions. [2023-12-24 21:22:29,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-24 21:22:29,859 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:22:29,859 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:22:29,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-24 21:22:30,062 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-24 21:22:30,063 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:22:30,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:22:30,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1146199125, now seen corresponding path program 1 times [2023-12-24 21:22:30,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:22:30,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1934187095] [2023-12-24 21:22:30,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:22:30,064 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-24 21:22:30,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:22:30,065 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-24 21:22:30,067 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-24 21:22:30,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:22:30,162 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 21:22:30,163 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:22:30,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 21:22:30,176 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:22:30,176 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:22:30,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1934187095] [2023-12-24 21:22:30,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1934187095] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:22:30,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:22:30,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 21:22:30,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974754826] [2023-12-24 21:22:30,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:22:30,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 21:22:30,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:22:30,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 21:22:30,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 21:22:30,178 INFO L87 Difference]: Start difference. First operand 100 states and 128 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-24 21:22:30,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:22:30,382 INFO L93 Difference]: Finished difference Result 110 states and 143 transitions. [2023-12-24 21:22:30,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 21:22:30,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 27 [2023-12-24 21:22:30,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:22:30,399 INFO L225 Difference]: With dead ends: 110 [2023-12-24 21:22:30,399 INFO L226 Difference]: Without dead ends: 108 [2023-12-24 21:22:30,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 21:22:30,400 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 21:22:30,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 21:22:30,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-12-24 21:22:30,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2023-12-24 21:22:30,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 79 states have (on average 1.3164556962025316) internal successors, (104), 83 states have internal predecessors, (104), 14 states have call successors, (14), 8 states have call predecessors, (14), 10 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2023-12-24 21:22:30,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 138 transitions. [2023-12-24 21:22:30,424 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 138 transitions. Word has length 27 [2023-12-24 21:22:30,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:22:30,424 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 138 transitions. [2023-12-24 21:22:30,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-24 21:22:30,424 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 138 transitions. [2023-12-24 21:22:30,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-24 21:22:30,425 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:22:30,425 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:22:30,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-24 21:22:30,629 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-24 21:22:30,629 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:22:30,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:22:30,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1095405470, now seen corresponding path program 1 times [2023-12-24 21:22:30,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:22:30,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2120828935] [2023-12-24 21:22:30,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:22:30,630 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-24 21:22:30,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:22:30,631 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-24 21:22:30,633 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-24 21:22:30,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:22:30,755 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 46 conjunts are in the unsatisfiable core [2023-12-24 21:22:30,757 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:22:30,945 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-24 21:22:30,945 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-24 21:22:31,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-24 21:22:31,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-24 21:22:37,116 INFO L349 Elim1Store]: treesize reduction 13, result has 56.7 percent of original size [2023-12-24 21:22:37,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 87 [2023-12-24 21:22:37,232 INFO L349 Elim1Store]: treesize reduction 13, result has 59.4 percent of original size [2023-12-24 21:22:37,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 65 [2023-12-24 21:22:37,332 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2023-12-24 21:22:37,333 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 1 case distinctions, treesize of input 22 treesize of output 17 [2023-12-24 21:22:37,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 35 treesize of output 40 [2023-12-24 21:22:37,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 1 [2023-12-24 21:22:37,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2023-12-24 21:22:37,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:22:37,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:22:37,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 45 [2023-12-24 21:22:37,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2023-12-24 21:22:38,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:22:38,084 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:22:45,431 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:22:45,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2120828935] [2023-12-24 21:22:45,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2120828935] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:22:45,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [413918] [2023-12-24 21:22:45,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:22:45,431 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 21:22:45,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 21:22:45,453 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 21:22:45,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2023-12-24 21:22:45,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:22:45,624 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 44 conjunts are in the unsatisfiable core [2023-12-24 21:22:45,627 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:22:46,210 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-24 21:22:46,212 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-24 21:22:51,827 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-24 21:22:51,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 16 [2023-12-24 21:22:51,838 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-24 21:22:51,838 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 11 [2023-12-24 21:22:52,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:22:52,594 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:22:53,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [413918] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:22:53,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:22:53,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2023-12-24 21:22:53,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126964965] [2023-12-24 21:22:53,998 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:22:53,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-24 21:22:53,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:22:53,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-24 21:22:53,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=901, Unknown=21, NotChecked=0, Total=1056 [2023-12-24 21:22:53,999 INFO L87 Difference]: Start difference. First operand 106 states and 138 transitions. Second operand has 28 states, 20 states have (on average 1.8) internal successors, (36), 21 states have internal predecessors, (36), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-24 21:22:56,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 21:23:02,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 21:23:10,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 21:23:18,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:23:18,193 INFO L93 Difference]: Finished difference Result 260 states and 341 transitions. [2023-12-24 21:23:18,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-24 21:23:18,194 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 20 states have (on average 1.8) internal successors, (36), 21 states have internal predecessors, (36), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Word has length 27 [2023-12-24 21:23:18,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:23:18,195 INFO L225 Difference]: With dead ends: 260 [2023-12-24 21:23:18,195 INFO L226 Difference]: Without dead ends: 168 [2023-12-24 21:23:18,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 28.6s TimeCoverageRelationStatistics Valid=231, Invalid=1466, Unknown=25, NotChecked=0, Total=1722 [2023-12-24 21:23:18,196 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 101 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 23 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.1s IncrementalHoareTripleChecker+Time [2023-12-24 21:23:18,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 453 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 947 Invalid, 3 Unknown, 0 Unchecked, 14.1s Time] [2023-12-24 21:23:18,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2023-12-24 21:23:18,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 145. [2023-12-24 21:23:18,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 109 states have (on average 1.3211009174311927) internal successors, (144), 113 states have internal predecessors, (144), 19 states have call successors, (19), 11 states have call predecessors, (19), 14 states have return successors, (26), 20 states have call predecessors, (26), 19 states have call successors, (26) [2023-12-24 21:23:18,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 189 transitions. [2023-12-24 21:23:18,224 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 189 transitions. Word has length 27 [2023-12-24 21:23:18,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:23:18,224 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 189 transitions. [2023-12-24 21:23:18,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 20 states have (on average 1.8) internal successors, (36), 21 states have internal predecessors, (36), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-24 21:23:18,225 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 189 transitions. [2023-12-24 21:23:18,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-24 21:23:18,225 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:23:18,226 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:23:18,234 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-24 21:23:18,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2023-12-24 21:23:18,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 21:23:18,633 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:23:18,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:23:18,634 INFO L85 PathProgramCache]: Analyzing trace with hash -2067538317, now seen corresponding path program 2 times [2023-12-24 21:23:18,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:23:18,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1080179547] [2023-12-24 21:23:18,634 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 21:23:18,634 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-24 21:23:18,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:23:18,635 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-24 21:23:18,636 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-24 21:23:18,816 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 21:23:18,817 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:23:18,823 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 78 conjunts are in the unsatisfiable core [2023-12-24 21:23:18,828 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:23:19,066 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-12-24 21:23:19,066 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-24 21:23:19,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-24 21:23:19,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-24 21:23:19,490 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse12 (= |c___ldv_list_add_#in~next.base| |c___ldv_list_add_#in~new.base|))) (let ((.cse0 (not .cse12))) (and (= (bvadd (select |c_#valid| (_ bv3 32)) (_ bv1 1)) (_ bv0 1)) (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~new.base|)) (.cse2 (select |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~prev.base|))) (or (and .cse0 (= (store (store (store |c_old(#memory_$Pointer$#1.offset)| |c___ldv_list_add_#in~next.base| (select |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~next.base|)) |c___ldv_list_add_#in~new.base| .cse1) |c___ldv_list_add_#in~prev.base| .cse2) |c_#memory_$Pointer$#1.offset|)) (= (store (store |c_old(#memory_$Pointer$#1.offset)| |c___ldv_list_add_#in~new.base| .cse1) |c___ldv_list_add_#in~prev.base| .cse2) |c_#memory_$Pointer$#1.offset|))) (let ((.cse5 (= |c___ldv_list_add_#in~new.base| |c___ldv_list_add_#in~prev.base|))) (let ((.cse11 (not .cse5)) (.cse9 (select |c_#memory_$Pointer$#1.base| |c___ldv_list_add_#in~new.base|)) (.cse8 (select |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~next.base|))) (let ((.cse4 (= |c___ldv_list_add_#in~next.base| |c___ldv_list_add_#in~prev.base|)) (.cse3 (or (and .cse11 (exists ((__ldv_list_add_~new.offset (_ BitVec 32)) (__ldv_list_add_~next.offset (_ BitVec 32))) (= (store (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~new.base| .cse9) |c___ldv_list_add_#in~prev.base| (store (select (let ((.cse13 (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~next.base| (store .cse8 (bvadd (_ bv4 32) __ldv_list_add_~next.offset) |c___ldv_list_add_#in~new.base|)))) (store .cse13 |c___ldv_list_add_#in~new.base| (store (store (select .cse13 |c___ldv_list_add_#in~new.base|) __ldv_list_add_~new.offset |c___ldv_list_add_#in~next.base|) (bvadd (_ bv4 32) __ldv_list_add_~new.offset) |c___ldv_list_add_#in~prev.base|))) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)) |c_#memory_$Pointer$#1.base|))) (and (exists ((__ldv_list_add_~new.offset (_ BitVec 32)) (__ldv_list_add_~next.offset (_ BitVec 32))) (= (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~prev.base| (store (select (let ((.cse14 (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~next.base| (store .cse8 (bvadd (_ bv4 32) __ldv_list_add_~next.offset) |c___ldv_list_add_#in~new.base|)))) (store .cse14 |c___ldv_list_add_#in~new.base| (store (store (select .cse14 |c___ldv_list_add_#in~new.base|) __ldv_list_add_~new.offset |c___ldv_list_add_#in~next.base|) (bvadd (_ bv4 32) __ldv_list_add_~new.offset) |c___ldv_list_add_#in~prev.base|))) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)) |c_#memory_$Pointer$#1.base|)) .cse5)))) (or (and .cse3 .cse4) (and .cse0 (let ((.cse6 (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~next.base| (select |c_#memory_$Pointer$#1.base| |c___ldv_list_add_#in~next.base|)))) (or (and .cse5 (exists ((__ldv_list_add_~new.offset (_ BitVec 32)) (__ldv_list_add_~next.offset (_ BitVec 32))) (= (store .cse6 |c___ldv_list_add_#in~prev.base| (store (select (let ((.cse7 (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~next.base| (store .cse8 (bvadd (_ bv4 32) __ldv_list_add_~next.offset) |c___ldv_list_add_#in~new.base|)))) (store .cse7 |c___ldv_list_add_#in~new.base| (store (store (select .cse7 |c___ldv_list_add_#in~new.base|) __ldv_list_add_~new.offset |c___ldv_list_add_#in~next.base|) (bvadd (_ bv4 32) __ldv_list_add_~new.offset) |c___ldv_list_add_#in~prev.base|))) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)) |c_#memory_$Pointer$#1.base|))) (and (exists ((__ldv_list_add_~new.offset (_ BitVec 32)) (__ldv_list_add_~next.offset (_ BitVec 32))) (= (store (store .cse6 |c___ldv_list_add_#in~new.base| .cse9) |c___ldv_list_add_#in~prev.base| (store (select (let ((.cse10 (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~next.base| (store .cse8 (bvadd (_ bv4 32) __ldv_list_add_~next.offset) |c___ldv_list_add_#in~new.base|)))) (store .cse10 |c___ldv_list_add_#in~new.base| (store (store (select .cse10 |c___ldv_list_add_#in~new.base|) __ldv_list_add_~new.offset |c___ldv_list_add_#in~next.base|) (bvadd (_ bv4 32) __ldv_list_add_~new.offset) |c___ldv_list_add_#in~prev.base|))) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)) |c_#memory_$Pointer$#1.base|)) .cse11))) (not .cse4)) (and .cse3 .cse12))))) (= (_ bv3 32) |c_~#mutexes~0.base|) (= (_ bv4 32) |c_~#drvlist~0.base|)))) is different from true [2023-12-24 21:23:20,819 INFO L349 Elim1Store]: treesize reduction 39, result has 2.5 percent of original size [2023-12-24 21:23:20,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 130 [2023-12-24 21:23:23,069 INFO L349 Elim1Store]: treesize reduction 129, result has 23.2 percent of original size [2023-12-24 21:23:23,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 116 [2023-12-24 21:23:23,218 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2023-12-24 21:23:23,218 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 29 treesize of output 11 [2023-12-24 21:23:29,491 WARN L293 SmtUtils]: Spent 5.90s on a formula simplification. DAG size of input: 65 DAG size of output: 1 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-24 21:23:29,491 INFO L349 Elim1Store]: treesize reduction 216, result has 0.5 percent of original size [2023-12-24 21:23:29,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 65 treesize of output 13 [2023-12-24 21:23:29,628 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 33 treesize of output 20 [2023-12-24 21:23:35,438 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-24 21:23:35,439 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-24 21:23:37,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-24 21:23:37,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 112 [2023-12-24 21:23:37,947 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-24 21:23:37,959 INFO L349 Elim1Store]: treesize reduction 46, result has 2.1 percent of original size [2023-12-24 21:23:37,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 327 treesize of output 315 [2023-12-24 21:23:51,958 WARN L293 SmtUtils]: Spent 11.27s on a formula simplification. DAG size of input: 80 DAG size of output: 37 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-24 21:23:51,958 INFO L349 Elim1Store]: treesize reduction 158, result has 27.2 percent of original size [2023-12-24 21:23:51,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 9 new quantified variables, introduced 16 case distinctions, treesize of input 671 treesize of output 756 [2023-12-24 21:23:52,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 1 [2023-12-24 21:23:52,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:23:52,196 INFO L349 Elim1Store]: treesize reduction 60, result has 1.6 percent of original size [2023-12-24 21:23:52,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 11 [2023-12-24 21:23:52,230 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 10 treesize of output 6 [2023-12-24 21:23:52,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 42 treesize of output 23 [2023-12-24 21:23:52,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:24:04,553 WARN L293 SmtUtils]: Spent 11.70s on a formula simplification. DAG size of input: 137 DAG size of output: 81 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-24 21:24:04,554 INFO L349 Elim1Store]: treesize reduction 525, result has 42.6 percent of original size [2023-12-24 21:24:04,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 9 new quantified variables, introduced 25 case distinctions, treesize of input 866 treesize of output 1386 [2023-12-24 21:24:12,949 WARN L293 SmtUtils]: Spent 8.27s on a formula simplification. DAG size of input: 19 DAG size of output: 15 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-24 21:24:12,949 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2023-12-24 21:24:12,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 231 treesize of output 251 [2023-12-24 21:24:18,225 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 7 treesize of output 5 [2023-12-24 21:24:20,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 35 [2023-12-24 21:24:21,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 35 [2023-12-24 21:24:29,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 Received shutdown request... [2023-12-24 21:36:55,981 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-24 21:36:55,982 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 (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-24 21:36:56,990 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-24 21:36:57,182 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-24 21:36:57,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2023-12-24 21:36:57,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:36:57,223 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-12-24 21:36:57,223 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 43 with TraceHistMax 2,while AutomatonFreeRefinementEngine was Timeout during proof generation before using IpTcStrategyModuleMathsat [1080179547]. [2023-12-24 21:36:57,224 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-12-24 21:36:57,224 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-12-24 21:36:57,226 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2023-12-24 21:36:57,228 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 21:36:57,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 09:36:57 BoogieIcfgContainer [2023-12-24 21:36:57,229 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 21:36:57,229 INFO L158 Benchmark]: Toolchain (without parser) took 883042.71ms. Allocated memory was 194.0MB in the beginning and 232.8MB in the end (delta: 38.8MB). Free memory was 146.2MB in the beginning and 144.4MB in the end (delta: 1.8MB). Peak memory consumption was 128.5MB. Max. memory is 8.0GB. [2023-12-24 21:36:57,229 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 161.5MB. Free memory is still 114.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 21:36:57,230 INFO L158 Benchmark]: CACSL2BoogieTranslator took 520.50ms. Allocated memory is still 194.0MB. Free memory was 146.2MB in the beginning and 118.3MB in the end (delta: 28.0MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2023-12-24 21:36:57,230 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.62ms. Allocated memory is still 194.0MB. Free memory was 118.3MB in the beginning and 115.8MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-24 21:36:57,235 INFO L158 Benchmark]: Boogie Preprocessor took 60.34ms. Allocated memory is still 194.0MB. Free memory was 115.8MB in the beginning and 109.2MB in the end (delta: 6.6MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2023-12-24 21:36:57,235 INFO L158 Benchmark]: RCFGBuilder took 706.59ms. Allocated memory is still 194.0MB. Free memory was 108.9MB in the beginning and 139.8MB in the end (delta: -30.9MB). Peak memory consumption was 18.3MB. Max. memory is 8.0GB. [2023-12-24 21:36:57,236 INFO L158 Benchmark]: TraceAbstraction took 881686.08ms. Allocated memory was 194.0MB in the beginning and 232.8MB in the end (delta: 38.8MB). Free memory was 139.3MB in the beginning and 144.4MB in the end (delta: -5.2MB). Peak memory consumption was 120.6MB. Max. memory is 8.0GB. [2023-12-24 21:36:57,237 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 161.5MB. Free memory is still 114.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 520.50ms. Allocated memory is still 194.0MB. Free memory was 146.2MB in the beginning and 118.3MB in the end (delta: 28.0MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 63.62ms. Allocated memory is still 194.0MB. Free memory was 118.3MB in the beginning and 115.8MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 60.34ms. Allocated memory is still 194.0MB. Free memory was 115.8MB in the beginning and 109.2MB in the end (delta: 6.6MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 706.59ms. Allocated memory is still 194.0MB. Free memory was 108.9MB in the beginning and 139.8MB in the end (delta: -30.9MB). Peak memory consumption was 18.3MB. Max. memory is 8.0GB. * TraceAbstraction took 881686.08ms. Allocated memory was 194.0MB in the beginning and 232.8MB in the end (delta: 38.8MB). Free memory was 139.3MB in the beginning and 144.4MB in the end (delta: -5.2MB). Peak memory consumption was 120.6MB. 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: 673]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 673). Cancelled while NwaCegarLoop was analyzing trace of length 43 with TraceHistMax 2,while AutomatonFreeRefinementEngine was Timeout during proof generation before using IpTcStrategyModuleMathsat [1080179547]. - TimeoutResultAtElement [Line: 677]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 677). Cancelled while NwaCegarLoop was analyzing trace of length 43 with TraceHistMax 2,while AutomatonFreeRefinementEngine was Timeout during proof generation before using IpTcStrategyModuleMathsat [1080179547]. - TimeoutResultAtElement [Line: 681]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 681). Cancelled while NwaCegarLoop was analyzing trace of length 43 with TraceHistMax 2,while AutomatonFreeRefinementEngine was Timeout during proof generation before using IpTcStrategyModuleMathsat [1080179547]. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 53 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 881.6s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 27.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 610 SdHoareTripleChecker+Valid, 16.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 601 mSDsluCounter, 1213 SdHoareTripleChecker+Invalid, 16.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 22 IncrementalHoareTripleChecker+Unchecked, 950 mSDsCounter, 178 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1765 IncrementalHoareTripleChecker+Invalid, 1968 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 178 mSolverCounterUnsat, 263 mSDtfsCounter, 1765 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 207 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 577 ImplicationChecksByTransitivity, 30.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=6, InterpolantAutomatonStates: 53, 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, 6 MinimizatonAttempts, 92 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 33.1s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 151 ConstructedInterpolants, 6 QuantifiedInterpolants, 2634 SizeOfPredicates, 54 NumberOfNonLiveVariables, 711 ConjunctsInSsa, 131 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 1/5 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