/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/forester-heap/sll-01-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 21:07:18,911 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 21:07:18,984 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:07:18,989 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 21:07:18,990 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 21:07:19,012 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 21:07:19,013 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 21:07:19,013 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 21:07:19,014 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 21:07:19,017 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 21:07:19,017 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 21:07:19,018 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 21:07:19,018 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 21:07:19,019 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 21:07:19,019 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 21:07:19,020 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 21:07:19,020 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 21:07:19,020 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 21:07:19,020 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 21:07:19,021 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 21:07:19,021 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 21:07:19,021 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 21:07:19,022 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 21:07:19,022 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 21:07:19,022 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 21:07:19,022 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 21:07:19,022 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 21:07:19,022 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 21:07:19,022 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 21:07:19,023 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 21:07:19,023 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 21:07:19,024 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 21:07:19,024 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 21:07:19,024 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 21:07:19,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 21:07:19,024 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 21:07:19,024 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 21:07:19,024 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 21:07:19,024 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 21:07:19,024 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 21:07:19,025 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 21:07:19,025 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 21:07:19,025 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 21:07:19,025 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 21:07:19,025 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 21:07:19,025 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 21:07:19,025 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:07:19,200 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 21:07:19,231 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 21:07:19,234 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 21:07:19,234 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 21:07:19,235 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 21:07:19,236 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-01-2.i [2023-12-24 21:07:20,250 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 21:07:20,442 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 21:07:20,443 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-2.i [2023-12-24 21:07:20,451 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4130d7515/4224df1072174ab7a5875c3e652cfc81/FLAG0b2e7eacd [2023-12-24 21:07:20,461 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4130d7515/4224df1072174ab7a5875c3e652cfc81 [2023-12-24 21:07:20,463 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 21:07:20,464 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 21:07:20,465 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 21:07:20,466 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 21:07:20,469 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 21:07:20,470 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 09:07:20" (1/1) ... [2023-12-24 21:07:20,470 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e37f4de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:07:20, skipping insertion in model container [2023-12-24 21:07:20,470 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 09:07:20" (1/1) ... [2023-12-24 21:07:20,510 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 21:07:20,695 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-2.i[22034,22047] [2023-12-24 21:07:20,713 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-2.i[22307,22320] [2023-12-24 21:07:20,715 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-2.i[22516,22529] [2023-12-24 21:07:20,715 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-2.i[22586,22599] [2023-12-24 21:07:20,717 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-2.i[22853,22866] [2023-12-24 21:07:20,717 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-2.i[22961,22974] [2023-12-24 21:07:20,719 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-2.i[23192,23205] [2023-12-24 21:07:20,719 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-2.i[23272,23285] [2023-12-24 21:07:20,720 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-2.i[23351,23364] [2023-12-24 21:07:20,721 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-2.i[23484,23497] [2023-12-24 21:07:20,722 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-2.i[23662,23675] [2023-12-24 21:07:20,723 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-2.i[23740,23753] [2023-12-24 21:07:20,723 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-2.i[23817,23830] [2023-12-24 21:07:20,725 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 21:07:20,734 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 21:07:20,753 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-2.i[22034,22047] [2023-12-24 21:07:20,755 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-2.i[22307,22320] [2023-12-24 21:07:20,756 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-2.i[22516,22529] [2023-12-24 21:07:20,757 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-2.i[22586,22599] [2023-12-24 21:07:20,758 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-2.i[22853,22866] [2023-12-24 21:07:20,759 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-2.i[22961,22974] [2023-12-24 21:07:20,760 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-2.i[23192,23205] [2023-12-24 21:07:20,760 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-2.i[23272,23285] [2023-12-24 21:07:20,761 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-2.i[23351,23364] [2023-12-24 21:07:20,761 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-2.i[23484,23497] [2023-12-24 21:07:20,762 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-2.i[23662,23675] [2023-12-24 21:07:20,763 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-2.i[23740,23753] [2023-12-24 21:07:20,763 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-2.i[23817,23830] [2023-12-24 21:07:20,765 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 21:07:20,782 INFO L206 MainTranslator]: Completed translation [2023-12-24 21:07:20,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:07:20 WrapperNode [2023-12-24 21:07:20,782 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 21:07:20,783 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 21:07:20,783 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 21:07:20,783 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 21:07:20,788 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:07:20" (1/1) ... [2023-12-24 21:07:20,801 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:07:20" (1/1) ... [2023-12-24 21:07:20,818 INFO L138 Inliner]: procedures = 120, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 225 [2023-12-24 21:07:20,819 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 21:07:20,819 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 21:07:20,820 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 21:07:20,820 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 21:07:20,827 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:07:20" (1/1) ... [2023-12-24 21:07:20,827 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:07:20" (1/1) ... [2023-12-24 21:07:20,830 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:07:20" (1/1) ... [2023-12-24 21:07:20,844 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 11 writes are split as follows [0, 11]. [2023-12-24 21:07:20,845 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:07:20" (1/1) ... [2023-12-24 21:07:20,845 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:07:20" (1/1) ... [2023-12-24 21:07:20,852 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:07:20" (1/1) ... [2023-12-24 21:07:20,856 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:07:20" (1/1) ... [2023-12-24 21:07:20,857 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:07:20" (1/1) ... [2023-12-24 21:07:20,859 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:07:20" (1/1) ... [2023-12-24 21:07:20,861 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 21:07:20,862 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 21:07:20,862 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 21:07:20,862 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 21:07:20,863 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:07:20" (1/1) ... [2023-12-24 21:07:20,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 21:07:20,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 21:07:20,905 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:07:20,907 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:07:20,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-24 21:07:20,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 21:07:20,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-24 21:07:20,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-24 21:07:20,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-24 21:07:20,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-24 21:07:20,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-24 21:07:20,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 21:07:20,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 21:07:20,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 21:07:20,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 21:07:21,028 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 21:07:21,030 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 21:07:21,484 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 21:07:21,518 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 21:07:21,518 INFO L309 CfgBuilder]: Removed 30 assume(true) statements. [2023-12-24 21:07:21,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 09:07:21 BoogieIcfgContainer [2023-12-24 21:07:21,519 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 21:07:21,520 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 21:07:21,520 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 21:07:21,523 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 21:07:21,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 09:07:20" (1/3) ... [2023-12-24 21:07:21,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54cb64bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 09:07:21, skipping insertion in model container [2023-12-24 21:07:21,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:07:20" (2/3) ... [2023-12-24 21:07:21,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54cb64bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 09:07:21, skipping insertion in model container [2023-12-24 21:07:21,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 09:07:21" (3/3) ... [2023-12-24 21:07:21,531 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-01-2.i [2023-12-24 21:07:21,546 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 21:07:21,546 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2023-12-24 21:07:21,578 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 21:07:21,583 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;@7f59eb3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 21:07:21,583 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-12-24 21:07:21,589 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 67 states have (on average 2.0) internal successors, (134), 80 states have internal predecessors, (134), 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:07:21,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-12-24 21:07:21,593 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:07:21,594 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-12-24 21:07:21,594 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-12-24 21:07:21,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:07:21,598 INFO L85 PathProgramCache]: Analyzing trace with hash 353905, now seen corresponding path program 1 times [2023-12-24 21:07:21,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:07:21,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1710118918] [2023-12-24 21:07:21,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:07:21,607 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:07:21,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:07:21,608 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:07:21,632 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:07:21,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:07:21,695 INFO L262 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-24 21:07:21,698 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:07:21,720 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:07:21,721 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:07:21,721 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:07:21,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1710118918] [2023-12-24 21:07:21,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1710118918] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:07:21,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:07:21,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 21:07:21,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084391675] [2023-12-24 21:07:21,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:07:21,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 21:07:21,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:07:21,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 21:07:21,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 21:07:21,749 INFO L87 Difference]: Start difference. First operand has 81 states, 67 states have (on average 2.0) internal successors, (134), 80 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 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:07:21,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:07:21,878 INFO L93 Difference]: Finished difference Result 177 states and 295 transitions. [2023-12-24 21:07:21,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 21:07:21,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2023-12-24 21:07:21,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:07:21,900 INFO L225 Difference]: With dead ends: 177 [2023-12-24 21:07:21,900 INFO L226 Difference]: Without dead ends: 95 [2023-12-24 21:07:21,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 21:07:21,905 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 85 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 21:07:21,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 95 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 21:07:21,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-12-24 21:07:21,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 77. [2023-12-24 21:07:21,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 76 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:07:21,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2023-12-24 21:07:21,930 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 3 [2023-12-24 21:07:21,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:07:21,930 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2023-12-24 21:07:21,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 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:07:21,931 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2023-12-24 21:07:21,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-24 21:07:21,931 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:07:21,931 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:07:21,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-24 21:07:22,132 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:07:22,132 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-12-24 21:07:22,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:07:22,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1955036411, now seen corresponding path program 1 times [2023-12-24 21:07:22,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:07:22,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1194333911] [2023-12-24 21:07:22,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:07:22,134 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:07:22,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:07:22,135 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:07:22,169 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:07:22,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:07:22,229 INFO L262 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 21:07:22,231 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:07:22,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-24 21:07:22,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-24 21:07:22,340 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:07:22,341 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:07:22,341 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:07:22,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1194333911] [2023-12-24 21:07:22,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1194333911] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:07:22,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:07:22,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 21:07:22,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248645394] [2023-12-24 21:07:22,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:07:22,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 21:07:22,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:07:22,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 21:07:22,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 21:07:22,344 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:07:22,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:07:22,913 INFO L93 Difference]: Finished difference Result 203 states and 228 transitions. [2023-12-24 21:07:22,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 21:07:22,915 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:07:22,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:07:22,916 INFO L225 Difference]: With dead ends: 203 [2023-12-24 21:07:22,916 INFO L226 Difference]: Without dead ends: 133 [2023-12-24 21:07:22,917 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:07:22,917 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 60 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-24 21:07:22,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 203 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-24 21:07:22,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-12-24 21:07:22,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 79. [2023-12-24 21:07:22,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 67 states have (on average 1.328358208955224) internal successors, (89), 78 states have internal predecessors, (89), 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:07:22,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2023-12-24 21:07:22,935 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 9 [2023-12-24 21:07:22,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:07:22,936 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2023-12-24 21:07:22,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:07:22,936 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2023-12-24 21:07:22,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-24 21:07:22,936 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:07:22,936 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:07:22,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-24 21:07:23,137 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:07:23,137 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-12-24 21:07:23,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:07:23,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1955038333, now seen corresponding path program 1 times [2023-12-24 21:07:23,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:07:23,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1490290470] [2023-12-24 21:07:23,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:07:23,139 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:07:23,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:07:23,140 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:07:23,141 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:07:23,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:07:23,205 INFO L262 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 21:07:23,208 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:07:23,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-24 21:07:23,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-24 21:07:23,267 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:07:23,267 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:07:23,267 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:07:23,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1490290470] [2023-12-24 21:07:23,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1490290470] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:07:23,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:07:23,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 21:07:23,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741022362] [2023-12-24 21:07:23,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:07:23,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 21:07:23,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:07:23,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 21:07:23,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 21:07:23,269 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:07:23,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:07:23,565 INFO L93 Difference]: Finished difference Result 134 states and 151 transitions. [2023-12-24 21:07:23,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 21:07:23,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:07:23,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:07:23,567 INFO L225 Difference]: With dead ends: 134 [2023-12-24 21:07:23,567 INFO L226 Difference]: Without dead ends: 132 [2023-12-24 21:07:23,567 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:07:23,568 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 57 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 21:07:23,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 201 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 21:07:23,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-12-24 21:07:23,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 80. [2023-12-24 21:07:23,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 68 states have (on average 1.3235294117647058) internal successors, (90), 79 states have internal predecessors, (90), 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:07:23,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2023-12-24 21:07:23,576 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 9 [2023-12-24 21:07:23,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:07:23,576 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2023-12-24 21:07:23,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:07:23,576 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2023-12-24 21:07:23,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-24 21:07:23,577 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:07:23,577 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:07:23,584 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:07:23,784 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:07:23,784 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-12-24 21:07:23,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:07:23,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1956885375, now seen corresponding path program 1 times [2023-12-24 21:07:23,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:07:23,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [347817833] [2023-12-24 21:07:23,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:07:23,785 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:07:23,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:07:23,787 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:07:23,787 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:07:23,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:07:23,849 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 21:07:23,850 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:07:23,937 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:07:23,938 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:07:23,938 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:07:23,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [347817833] [2023-12-24 21:07:23,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [347817833] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:07:23,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:07:23,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 21:07:23,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014412366] [2023-12-24 21:07:23,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:07:23,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 21:07:23,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:07:23,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 21:07:23,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 21:07:23,941 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:07:24,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:07:24,317 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2023-12-24 21:07:24,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 21:07:24,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:07:24,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:07:24,318 INFO L225 Difference]: With dead ends: 81 [2023-12-24 21:07:24,319 INFO L226 Difference]: Without dead ends: 79 [2023-12-24 21:07:24,319 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:07:24,320 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 1 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-24 21:07:24,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 221 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-24 21:07:24,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-12-24 21:07:24,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2023-12-24 21:07:24,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 66 states have (on average 1.3181818181818181) internal successors, (87), 76 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:07:24,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2023-12-24 21:07:24,326 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 9 [2023-12-24 21:07:24,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:07:24,326 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2023-12-24 21:07:24,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:07:24,326 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2023-12-24 21:07:24,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-24 21:07:24,326 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:07:24,326 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:07:24,335 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:07:24,533 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:07:24,533 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-12-24 21:07:24,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:07:24,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1062943642, now seen corresponding path program 1 times [2023-12-24 21:07:24,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:07:24,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1506221276] [2023-12-24 21:07:24,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:07:24,534 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:07:24,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:07:24,535 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:07:24,541 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:07:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:07:24,594 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-24 21:07:24,595 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:07:24,602 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:07:24,602 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:07:24,602 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:07:24,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1506221276] [2023-12-24 21:07:24,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1506221276] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:07:24,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:07:24,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 21:07:24,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444389620] [2023-12-24 21:07:24,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:07:24,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 21:07:24,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:07:24,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 21:07:24,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 21:07:24,603 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:07:24,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:07:24,708 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2023-12-24 21:07:24,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 21:07:24,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2023-12-24 21:07:24,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:07:24,709 INFO L225 Difference]: With dead ends: 80 [2023-12-24 21:07:24,709 INFO L226 Difference]: Without dead ends: 76 [2023-12-24 21:07:24,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 21:07:24,710 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 16 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 21:07:24,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 126 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 21:07:24,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-12-24 21:07:24,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2023-12-24 21:07:24,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 64 states have (on average 1.296875) internal successors, (83), 72 states have internal predecessors, (83), 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:07:24,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2023-12-24 21:07:24,716 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 14 [2023-12-24 21:07:24,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:07:24,717 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2023-12-24 21:07:24,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:07:24,717 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2023-12-24 21:07:24,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-24 21:07:24,717 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:07:24,717 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:07:24,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-24 21:07:24,920 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:07:24,921 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-12-24 21:07:24,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:07:24,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1408481266, now seen corresponding path program 1 times [2023-12-24 21:07:24,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:07:24,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1771590798] [2023-12-24 21:07:24,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:07:24,922 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:07:24,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:07:24,923 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:07:24,940 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:07:24,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:07:24,973 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 21:07:24,977 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:07:25,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:07:25,001 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:07:25,001 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:07:25,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1771590798] [2023-12-24 21:07:25,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1771590798] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:07:25,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:07:25,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 21:07:25,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449959392] [2023-12-24 21:07:25,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:07:25,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 21:07:25,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:07:25,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 21:07:25,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 21:07:25,005 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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:07:25,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:07:25,200 INFO L93 Difference]: Finished difference Result 133 states and 149 transitions. [2023-12-24 21:07:25,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 21:07:25,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2023-12-24 21:07:25,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:07:25,201 INFO L225 Difference]: With dead ends: 133 [2023-12-24 21:07:25,201 INFO L226 Difference]: Without dead ends: 113 [2023-12-24 21:07:25,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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:07:25,202 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 137 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 21:07:25,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 116 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 21:07:25,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-12-24 21:07:25,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 72. [2023-12-24 21:07:25,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 64 states have (on average 1.28125) internal successors, (82), 71 states have internal predecessors, (82), 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:07:25,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2023-12-24 21:07:25,229 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 15 [2023-12-24 21:07:25,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:07:25,229 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2023-12-24 21:07:25,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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:07:25,229 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2023-12-24 21:07:25,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-24 21:07:25,230 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:07:25,230 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:07:25,238 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:07:25,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:07:25,433 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-12-24 21:07:25,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:07:25,433 INFO L85 PathProgramCache]: Analyzing trace with hash -991038407, now seen corresponding path program 1 times [2023-12-24 21:07:25,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:07:25,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [417742940] [2023-12-24 21:07:25,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:07:25,434 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:07:25,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:07:25,435 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:07:25,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-24 21:07:25,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:07:25,501 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-24 21:07:25,502 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:07:25,508 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:07:25,508 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:07:25,509 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:07:25,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [417742940] [2023-12-24 21:07:25,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [417742940] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:07:25,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:07:25,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 21:07:25,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098109705] [2023-12-24 21:07:25,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:07:25,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 21:07:25,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:07:25,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 21:07:25,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 21:07:25,510 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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:07:25,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:07:25,545 INFO L93 Difference]: Finished difference Result 119 states and 137 transitions. [2023-12-24 21:07:25,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 21:07:25,545 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2023-12-24 21:07:25,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:07:25,545 INFO L225 Difference]: With dead ends: 119 [2023-12-24 21:07:25,545 INFO L226 Difference]: Without dead ends: 77 [2023-12-24 21:07:25,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 21:07:25,547 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 3 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 21:07:25,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 146 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 21:07:25,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-12-24 21:07:25,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2023-12-24 21:07:25,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 67 states have (on average 1.2835820895522387) internal successors, (86), 74 states have internal predecessors, (86), 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:07:25,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 86 transitions. [2023-12-24 21:07:25,566 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 86 transitions. Word has length 19 [2023-12-24 21:07:25,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:07:25,566 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 86 transitions. [2023-12-24 21:07:25,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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:07:25,566 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2023-12-24 21:07:25,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-24 21:07:25,567 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:07:25,567 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] [2023-12-24 21:07:25,575 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 (8)] Ended with exit code 0 [2023-12-24 21:07:25,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:07:25,770 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-12-24 21:07:25,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:07:25,770 INFO L85 PathProgramCache]: Analyzing trace with hash -657429999, now seen corresponding path program 1 times [2023-12-24 21:07:25,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:07:25,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1451498849] [2023-12-24 21:07:25,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:07:25,771 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:07:25,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:07:25,772 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:07:25,772 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:07:25,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:07:25,816 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-24 21:07:25,818 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:07:25,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-24 21:07:25,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-24 21:07:25,924 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:07:25,924 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:07:25,924 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:07:25,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1451498849] [2023-12-24 21:07:25,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1451498849] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:07:25,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:07:25,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 21:07:25,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012369087] [2023-12-24 21:07:25,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:07:25,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 21:07:25,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:07:25,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 21:07:25,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 21:07:25,925 INFO L87 Difference]: Start difference. First operand 75 states and 86 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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:07:26,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:07:26,853 INFO L93 Difference]: Finished difference Result 187 states and 214 transitions. [2023-12-24 21:07:26,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 21:07:26,854 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-12-24 21:07:26,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:07:26,855 INFO L225 Difference]: With dead ends: 187 [2023-12-24 21:07:26,855 INFO L226 Difference]: Without dead ends: 142 [2023-12-24 21:07:26,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-24 21:07:26,855 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 77 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-24 21:07:26,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 271 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-24 21:07:26,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-12-24 21:07:26,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 85. [2023-12-24 21:07:26,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 77 states have (on average 1.2597402597402598) internal successors, (97), 84 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:07:26,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 97 transitions. [2023-12-24 21:07:26,862 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 97 transitions. Word has length 20 [2023-12-24 21:07:26,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:07:26,862 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 97 transitions. [2023-12-24 21:07:26,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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:07:26,862 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 97 transitions. [2023-12-24 21:07:26,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-24 21:07:26,863 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:07:26,863 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] [2023-12-24 21:07:26,868 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 (9)] Ended with exit code 0 [2023-12-24 21:07:27,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:07:27,065 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-12-24 21:07:27,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:07:27,065 INFO L85 PathProgramCache]: Analyzing trace with hash -667381103, now seen corresponding path program 1 times [2023-12-24 21:07:27,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:07:27,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1321206579] [2023-12-24 21:07:27,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:07:27,065 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:07:27,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:07:27,066 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:07:27,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 (10)] Waiting until timeout for monitored process [2023-12-24 21:07:27,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:07:27,128 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 21:07:27,130 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:07:27,145 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:07:27,145 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:07:27,145 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:07:27,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1321206579] [2023-12-24 21:07:27,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1321206579] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:07:27,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:07:27,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 21:07:27,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095487951] [2023-12-24 21:07:27,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:07:27,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 21:07:27,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:07:27,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 21:07:27,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 21:07:27,147 INFO L87 Difference]: Start difference. First operand 85 states and 97 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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:07:27,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:07:27,174 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2023-12-24 21:07:27,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 21:07:27,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-12-24 21:07:27,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:07:27,175 INFO L225 Difference]: With dead ends: 85 [2023-12-24 21:07:27,175 INFO L226 Difference]: Without dead ends: 83 [2023-12-24 21:07:27,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 21:07:27,177 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 13 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 21:07:27,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 128 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 21:07:27,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-12-24 21:07:27,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-12-24 21:07:27,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 76 states have (on average 1.25) internal successors, (95), 82 states have internal predecessors, (95), 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:07:27,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 95 transitions. [2023-12-24 21:07:27,189 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 95 transitions. Word has length 20 [2023-12-24 21:07:27,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:07:27,189 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 95 transitions. [2023-12-24 21:07:27,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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:07:27,189 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 95 transitions. [2023-12-24 21:07:27,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-24 21:07:27,191 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:07:27,191 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] [2023-12-24 21:07:27,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-24 21:07:27,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:07:27,395 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-12-24 21:07:27,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:07:27,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1945601878, now seen corresponding path program 1 times [2023-12-24 21:07:27,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:07:27,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [959868650] [2023-12-24 21:07:27,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:07:27,396 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:07:27,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:07:27,397 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:07:27,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-24 21:07:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:07:27,460 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 21:07:27,461 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:07:27,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-24 21:07:27,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-24 21:07:27,499 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:07:27,499 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:07:27,499 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:07:27,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [959868650] [2023-12-24 21:07:27,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [959868650] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:07:27,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:07:27,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 21:07:27,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896365732] [2023-12-24 21:07:27,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:07:27,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 21:07:27,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:07:27,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 21:07:27,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 21:07:27,501 INFO L87 Difference]: Start difference. First operand 83 states and 95 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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:07:27,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:07:27,850 INFO L93 Difference]: Finished difference Result 93 states and 108 transitions. [2023-12-24 21:07:27,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 21:07:27,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2023-12-24 21:07:27,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:07:27,851 INFO L225 Difference]: With dead ends: 93 [2023-12-24 21:07:27,851 INFO L226 Difference]: Without dead ends: 91 [2023-12-24 21:07:27,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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:07:27,852 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 6 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 21:07:27,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 196 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 21:07:27,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-12-24 21:07:27,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2023-12-24 21:07:27,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 79 states have (on average 1.2531645569620253) internal successors, (99), 85 states have internal predecessors, (99), 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:07:27,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2023-12-24 21:07:27,857 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 22 [2023-12-24 21:07:27,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:07:27,857 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2023-12-24 21:07:27,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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:07:27,857 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2023-12-24 21:07:27,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-24 21:07:27,858 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:07:27,858 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] [2023-12-24 21:07:27,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-24 21:07:28,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:07:28,058 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-12-24 21:07:28,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:07:28,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1943754836, now seen corresponding path program 1 times [2023-12-24 21:07:28,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:07:28,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1859613109] [2023-12-24 21:07:28,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:07:28,059 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:07:28,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:07:28,060 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:07:28,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-24 21:07:28,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:07:28,146 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 21:07:28,148 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:07:28,189 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:07:28,189 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:07:28,189 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:07:28,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1859613109] [2023-12-24 21:07:28,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1859613109] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:07:28,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:07:28,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 21:07:28,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460831671] [2023-12-24 21:07:28,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:07:28,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 21:07:28,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:07:28,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 21:07:28,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 21:07:28,190 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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:07:28,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:07:28,541 INFO L93 Difference]: Finished difference Result 87 states and 100 transitions. [2023-12-24 21:07:28,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 21:07:28,541 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2023-12-24 21:07:28,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:07:28,542 INFO L225 Difference]: With dead ends: 87 [2023-12-24 21:07:28,542 INFO L226 Difference]: Without dead ends: 85 [2023-12-24 21:07:28,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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:07:28,542 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 1 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 21:07:28,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 183 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 21:07:28,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-12-24 21:07:28,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2023-12-24 21:07:28,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 75 states have (on average 1.24) internal successors, (93), 80 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:07:28,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2023-12-24 21:07:28,547 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 22 [2023-12-24 21:07:28,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:07:28,547 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 93 transitions. [2023-12-24 21:07:28,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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:07:28,548 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2023-12-24 21:07:28,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-24 21:07:28,548 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:07:28,548 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] [2023-12-24 21:07:28,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-24 21:07:28,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:07:28,749 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-12-24 21:07:28,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:07:28,749 INFO L85 PathProgramCache]: Analyzing trace with hash -542731922, now seen corresponding path program 1 times [2023-12-24 21:07:28,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:07:28,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2100055786] [2023-12-24 21:07:28,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:07:28,750 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:07:28,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:07:28,750 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:07:28,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-24 21:07:28,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:07:28,834 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-24 21:07:28,836 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:07:28,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-24 21:07:28,900 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:07:28,903 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-24 21:07:28,960 INFO L349 Elim1Store]: treesize reduction 105, result has 6.3 percent of original size [2023-12-24 21:07:28,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 375 treesize of output 281 [2023-12-24 21:07:28,973 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-12-24 21:07:28,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 38 [2023-12-24 21:07:28,998 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-12-24 21:07:28,998 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 17 treesize of output 17 [2023-12-24 21:07:29,406 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:07:29,406 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:07:29,406 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:07:29,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2100055786] [2023-12-24 21:07:29,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2100055786] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:07:29,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:07:29,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 21:07:29,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117454373] [2023-12-24 21:07:29,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:07:29,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 21:07:29,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:07:29,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 21:07:29,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-24 21:07:29,408 INFO L87 Difference]: Start difference. First operand 81 states and 93 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 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:07:30,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:07:30,840 INFO L93 Difference]: Finished difference Result 188 states and 212 transitions. [2023-12-24 21:07:30,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 21:07:30,840 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 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 23 [2023-12-24 21:07:30,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:07:30,842 INFO L225 Difference]: With dead ends: 188 [2023-12-24 21:07:30,842 INFO L226 Difference]: Without dead ends: 186 [2023-12-24 21:07:30,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-12-24 21:07:30,842 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 208 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-24 21:07:30,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 391 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-24 21:07:30,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-12-24 21:07:30,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 93. [2023-12-24 21:07:30,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 87 states have (on average 1.2298850574712643) internal successors, (107), 92 states have internal predecessors, (107), 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:07:30,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2023-12-24 21:07:30,855 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 23 [2023-12-24 21:07:30,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:07:30,856 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2023-12-24 21:07:30,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 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:07:30,856 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2023-12-24 21:07:30,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-24 21:07:30,858 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:07:30,858 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] [2023-12-24 21:07:30,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-24 21:07:31,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:07:31,062 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-12-24 21:07:31,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:07:31,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1556332866, now seen corresponding path program 1 times [2023-12-24 21:07:31,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:07:31,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [726938075] [2023-12-24 21:07:31,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:07:31,062 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:07:31,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:07:31,063 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:07:31,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-24 21:07:31,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:07:31,147 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-24 21:07:31,149 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:07:31,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-24 21:07:31,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-24 21:07:31,239 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:07:31,240 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:07:31,240 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:07:31,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [726938075] [2023-12-24 21:07:31,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [726938075] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:07:31,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:07:31,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 21:07:31,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668550099] [2023-12-24 21:07:31,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:07:31,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 21:07:31,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:07:31,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 21:07:31,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 21:07:31,241 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:07:31,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:07:31,593 INFO L93 Difference]: Finished difference Result 140 states and 161 transitions. [2023-12-24 21:07:31,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 21:07:31,593 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-12-24 21:07:31,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:07:31,594 INFO L225 Difference]: With dead ends: 140 [2023-12-24 21:07:31,594 INFO L226 Difference]: Without dead ends: 122 [2023-12-24 21:07:31,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 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:07:31,594 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 24 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 21:07:31,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 193 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 21:07:31,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-12-24 21:07:31,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 114. [2023-12-24 21:07:31,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 108 states have (on average 1.2592592592592593) internal successors, (136), 113 states have internal predecessors, (136), 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:07:31,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 136 transitions. [2023-12-24 21:07:31,609 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 136 transitions. Word has length 25 [2023-12-24 21:07:31,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:07:31,609 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 136 transitions. [2023-12-24 21:07:31,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:07:31,609 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 136 transitions. [2023-12-24 21:07:31,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-24 21:07:31,609 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:07:31,609 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] [2023-12-24 21:07:31,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-24 21:07:31,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:07:31,812 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-12-24 21:07:31,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:07:31,813 INFO L85 PathProgramCache]: Analyzing trace with hash 555312702, now seen corresponding path program 1 times [2023-12-24 21:07:31,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:07:31,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1137092165] [2023-12-24 21:07:31,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:07:31,813 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:07:31,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:07:31,814 INFO L229 MonitoredProcess]: Starting monitored process 15 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:07:31,815 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 (15)] Waiting until timeout for monitored process [2023-12-24 21:07:31,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:07:31,888 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-24 21:07:31,889 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:07:31,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2023-12-24 21:07:31,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-24 21:07:31,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:07:31,999 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:07:31,999 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:07:31,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1137092165] [2023-12-24 21:07:31,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1137092165] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:07:31,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:07:31,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 21:07:31,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749864303] [2023-12-24 21:07:31,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:07:31,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 21:07:31,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:07:32,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 21:07:32,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-24 21:07:32,000 INFO L87 Difference]: Start difference. First operand 114 states and 136 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:07:32,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:07:32,992 INFO L93 Difference]: Finished difference Result 236 states and 275 transitions. [2023-12-24 21:07:32,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 21:07:32,992 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-12-24 21:07:32,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:07:32,993 INFO L225 Difference]: With dead ends: 236 [2023-12-24 21:07:32,993 INFO L226 Difference]: Without dead ends: 193 [2023-12-24 21:07:32,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-12-24 21:07:32,994 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 128 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-24 21:07:32,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 359 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-24 21:07:32,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2023-12-24 21:07:33,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 124. [2023-12-24 21:07:33,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 118 states have (on average 1.2457627118644068) internal successors, (147), 123 states have internal predecessors, (147), 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:07:33,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 147 transitions. [2023-12-24 21:07:33,010 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 147 transitions. Word has length 25 [2023-12-24 21:07:33,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:07:33,011 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 147 transitions. [2023-12-24 21:07:33,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:07:33,011 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 147 transitions. [2023-12-24 21:07:33,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-24 21:07:33,011 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:07:33,011 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] [2023-12-24 21:07:33,016 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 (15)] Forceful destruction successful, exit code 0 [2023-12-24 21:07:33,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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:07:33,215 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-12-24 21:07:33,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:07:33,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1133631040, now seen corresponding path program 1 times [2023-12-24 21:07:33,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:07:33,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [773434816] [2023-12-24 21:07:33,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:07:33,216 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:07:33,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:07:33,217 INFO L229 MonitoredProcess]: Starting monitored process 16 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:07:33,252 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 (16)] Waiting until timeout for monitored process [2023-12-24 21:07:33,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:07:33,313 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-24 21:07:33,314 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:07:33,429 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:07:33,429 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:07:33,429 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:07:33,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [773434816] [2023-12-24 21:07:33,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [773434816] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:07:33,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:07:33,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 21:07:33,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235898612] [2023-12-24 21:07:33,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:07:33,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 21:07:33,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:07:33,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 21:07:33,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 21:07:33,430 INFO L87 Difference]: Start difference. First operand 124 states and 147 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:07:34,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:07:34,048 INFO L93 Difference]: Finished difference Result 176 states and 206 transitions. [2023-12-24 21:07:34,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 21:07:34,050 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-12-24 21:07:34,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:07:34,051 INFO L225 Difference]: With dead ends: 176 [2023-12-24 21:07:34,051 INFO L226 Difference]: Without dead ends: 158 [2023-12-24 21:07:34,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-24 21:07:34,051 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 26 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-24 21:07:34,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 252 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-24 21:07:34,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-12-24 21:07:34,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 129. [2023-12-24 21:07:34,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 123 states have (on average 1.2357723577235773) internal successors, (152), 128 states have internal predecessors, (152), 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:07:34,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 152 transitions. [2023-12-24 21:07:34,071 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 152 transitions. Word has length 25 [2023-12-24 21:07:34,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:07:34,072 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 152 transitions. [2023-12-24 21:07:34,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:07:34,072 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 152 transitions. [2023-12-24 21:07:34,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-24 21:07:34,072 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:07:34,072 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] [2023-12-24 21:07:34,079 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 (16)] Forceful destruction successful, exit code 0 [2023-12-24 21:07:34,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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:07:34,276 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-12-24 21:07:34,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:07:34,276 INFO L85 PathProgramCache]: Analyzing trace with hash 2029293379, now seen corresponding path program 1 times [2023-12-24 21:07:34,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:07:34,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [627770100] [2023-12-24 21:07:34,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:07:34,277 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:07:34,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:07:34,278 INFO L229 MonitoredProcess]: Starting monitored process 17 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:07:34,282 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 (17)] Waiting until timeout for monitored process [2023-12-24 21:07:34,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:07:34,359 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-24 21:07:34,363 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:07:34,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-24 21:07:34,399 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:07:34,402 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:07:34,405 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-24 21:07:34,589 INFO L349 Elim1Store]: treesize reduction 249, result has 3.5 percent of original size [2023-12-24 21:07:34,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 482 treesize of output 362 [2023-12-24 21:07:34,680 INFO L349 Elim1Store]: treesize reduction 174, result has 11.7 percent of original size [2023-12-24 21:07:34,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 271 treesize of output 203 [2023-12-24 21:07:34,694 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:07:34,695 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:07:34,695 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:07:34,696 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 11 [2023-12-24 21:07:34,888 INFO L349 Elim1Store]: treesize reduction 6, result has 62.5 percent of original size [2023-12-24 21:07:34,889 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 19 treesize of output 19 [2023-12-24 21:07:36,835 INFO L349 Elim1Store]: treesize reduction 32, result has 82.9 percent of original size [2023-12-24 21:07:36,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 20 case distinctions, treesize of input 292 treesize of output 396 [2023-12-24 21:07:37,163 INFO L349 Elim1Store]: treesize reduction 94, result has 51.3 percent of original size [2023-12-24 21:07:37,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 11 new quantified variables, introduced 35 case distinctions, treesize of input 487 treesize of output 405 [2023-12-24 21:07:37,190 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 122 treesize of output 120 [2023-12-24 21:07:37,204 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 120 treesize of output 118 [2023-12-24 21:07:37,311 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 3 [2023-12-24 21:07:37,352 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:07:37,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 38 [2023-12-24 21:07:39,653 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:07:39,654 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:07:39,654 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:07:39,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [627770100] [2023-12-24 21:07:39,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [627770100] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:07:39,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:07:39,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 21:07:39,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403665755] [2023-12-24 21:07:39,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:07:39,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 21:07:39,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:07:39,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 21:07:39,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-24 21:07:39,655 INFO L87 Difference]: Start difference. First operand 129 states and 152 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 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:07:41,081 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|)) (.cse4 (bvadd |c_ULTIMATE.start_main_~end~0#1.offset| (_ bv4 32)))) (let ((.cse15 (select (select |c_#memory_$Pointer$#1.base| (_ bv0 32)) (_ bv4 32))) (.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) .cse4)) (.cse18 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| .cse18)) (.cse2 (select |c_#memory_$Pointer$#1.offset| .cse5)) (.cse3 (select |c_#memory_$Pointer$#1.base| .cse5)) (.cse6 (select |c_#memory_$Pointer$#1.offset| .cse18)) (.cse14 (exists ((v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_DerPreprocessor_3 (_ bv4 32)) (_ bv0 32)) (= (select (select (store (store |c_#memory_$Pointer$#1.base| .cse15 v_DerPreprocessor_2) (_ bv0 32) v_DerPreprocessor_3) .cse15) (_ bv0 32)) (_ bv0 32)))))) (and (= (select .cse0 (_ bv4 32)) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv0 32)) (= (select .cse2 (_ bv0 32)) (_ bv0 32)) (= (select .cse0 (_ bv0 32)) (_ bv0 32)) (= (select .cse3 (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base|) .cse4)) (not (= |c_ULTIMATE.start_main_~end~0#1.base| .cse5)) (= (select .cse2 (_ bv4 32)) (_ bv0 32)) (= (select .cse3 (_ bv4 32)) (_ bv0 32)) (= |c_ULTIMATE.start_main_~inner~0#1.offset| (_ bv0 32)) (= (select .cse6 (_ bv0 32)) (_ bv0 32)) (= (select .cse6 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 1) (bvadd (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) (_ bv1 1))) (or (exists ((|ULTIMATE.start_main_~end~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~end~0#1.base| (_ BitVec 32))) (let ((.cse11 (bvadd (_ bv4 32) |ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~end~0#1.base|) .cse11))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse7)) (.cse9 (select |c_#memory_$Pointer$#1.offset| .cse7))) (and (not (= |ULTIMATE.start_main_~end~0#1.base| .cse7)) (= (select .cse8 (_ bv4 32)) (_ bv0 32)) (= |c_ULTIMATE.start_main_~inner~0#1.base| .cse7) (= (_ bv0 32) (select .cse9 (_ bv4 32))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (and (exists ((v_DerPreprocessor_1 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~end~0#1.base| v_DerPreprocessor_1) .cse7 v_DerPreprocessor_2) (_ bv0 32) v_DerPreprocessor_3))) (let ((.cse10 (select .cse13 |ULTIMATE.start_main_~end~0#1.base|)) (.cse12 (select .cse13 .cse7))) (and (= (select .cse10 .cse11) .cse7) (= v_DerPreprocessor_1 .cse10) (= .cse12 v_DerPreprocessor_2) (= (select .cse12 (_ bv0 32)) (_ bv0 32)))))) (= (select v_DerPreprocessor_3 (_ bv4 32)) (_ bv0 32)))) (= (select .cse8 (_ bv0 32)) (_ bv0 32)) (= (select .cse9 (_ bv0 32)) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~end~0#1.base|) .cse11) (_ bv0 32))))))) (let ((.cse17 (select |c_#memory_$Pointer$#1.offset| .cse15)) (.cse16 (select |c_#memory_$Pointer$#1.base| .cse15))) (and .cse14 (= (select (select |c_#memory_$Pointer$#1.offset| (_ bv0 32)) (_ bv4 32)) (_ bv0 32)) (not (= (_ bv0 32) .cse15)) (= (select .cse16 (_ bv0 32)) (_ bv0 32)) (= (select .cse17 (_ bv0 32)) (_ bv0 32)) (= |c_ULTIMATE.start_main_~inner~0#1.base| .cse15) (= (_ bv0 32) (select .cse17 (_ bv4 32))) (= (select .cse16 (_ bv4 32)) (_ bv0 32))))) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse18)) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (and (exists ((v_DerPreprocessor_1 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_1) .cse18 v_DerPreprocessor_2) (_ bv0 32) v_DerPreprocessor_3))) (let ((.cse20 (select .cse21 .cse18)) (.cse19 (select .cse21 |c_ULTIMATE.start_main_~list~0#1.base|))) (and (= (select .cse19 .cse1) .cse18) (= (select .cse20 (_ bv0 32)) (_ bv0 32)) (= .cse20 v_DerPreprocessor_2) (= .cse19 v_DerPreprocessor_1))))) (= (select v_DerPreprocessor_3 (_ bv4 32)) (_ bv0 32)))) (and .cse14 (= |c_ULTIMATE.start_main_~list~0#1.base| (_ bv0 32)) (= |c_ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (and (exists ((v_DerPreprocessor_1 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_DerPreprocessor_1) .cse5 v_DerPreprocessor_2) (_ bv0 32) v_DerPreprocessor_3))) (let ((.cse22 (select .cse24 |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse23 (select .cse24 .cse5))) (and (= .cse22 v_DerPreprocessor_1) (= (select .cse23 (_ bv0 32)) (_ bv0 32)) (= (select .cse22 .cse4) .cse5) (= .cse23 v_DerPreprocessor_2))))) (= (select v_DerPreprocessor_3 (_ bv4 32)) (_ bv0 32)))) (and .cse14 (= |c_ULTIMATE.start_main_~end~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~end~0#1.base| (_ bv0 32)))))))) is different from true [2023-12-24 21:07:41,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:07:41,730 INFO L93 Difference]: Finished difference Result 205 states and 243 transitions. [2023-12-24 21:07:41,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 21:07:41,730 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-12-24 21:07:41,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:07:41,731 INFO L225 Difference]: With dead ends: 205 [2023-12-24 21:07:41,731 INFO L226 Difference]: Without dead ends: 203 [2023-12-24 21:07:41,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=26, Invalid=66, Unknown=2, NotChecked=16, Total=110 [2023-12-24 21:07:41,732 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 75 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 3 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-24 21:07:41,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 430 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 167 Invalid, 13 Unknown, 11 Unchecked, 1.7s Time] [2023-12-24 21:07:41,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2023-12-24 21:07:41,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 135. [2023-12-24 21:07:41,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 129 states have (on average 1.2248062015503876) internal successors, (158), 134 states have internal predecessors, (158), 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:07:41,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 158 transitions. [2023-12-24 21:07:41,756 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 158 transitions. Word has length 26 [2023-12-24 21:07:41,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:07:41,756 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 158 transitions. [2023-12-24 21:07:41,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 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:07:41,756 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 158 transitions. [2023-12-24 21:07:41,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-24 21:07:41,757 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:07:41,757 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:07:41,760 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 (17)] Forceful destruction successful, exit code 0 [2023-12-24 21:07:41,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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:07:41,960 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-12-24 21:07:41,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:07:41,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1140325941, now seen corresponding path program 1 times [2023-12-24 21:07:41,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:07:41,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [333649378] [2023-12-24 21:07:41,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:07:41,961 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:07:41,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:07:41,962 INFO L229 MonitoredProcess]: Starting monitored process 18 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:07:41,994 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 (18)] Waiting until timeout for monitored process [2023-12-24 21:07:42,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:07:42,028 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-24 21:07:42,029 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:07:42,093 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:07:42,093 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:07:42,146 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-12-24 21:07:42,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2023-12-24 21:07:42,170 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-12-24 21:07:42,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 12 [2023-12-24 21:07:42,189 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:07:42,189 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:07:42,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [333649378] [2023-12-24 21:07:42,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [333649378] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:07:42,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:07:42,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2023-12-24 21:07:42,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579168077] [2023-12-24 21:07:42,189 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:07:42,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 21:07:42,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:07:42,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 21:07:42,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-24 21:07:42,190 INFO L87 Difference]: Start difference. First operand 135 states and 158 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:07:43,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:07:43,305 INFO L93 Difference]: Finished difference Result 293 states and 346 transitions. [2023-12-24 21:07:43,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-24 21:07:43,306 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-12-24 21:07:43,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:07:43,307 INFO L225 Difference]: With dead ends: 293 [2023-12-24 21:07:43,307 INFO L226 Difference]: Without dead ends: 214 [2023-12-24 21:07:43,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-12-24 21:07:43,307 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 266 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-24 21:07:43,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 292 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-24 21:07:43,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2023-12-24 21:07:43,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 166. [2023-12-24 21:07:43,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 160 states have (on average 1.25) internal successors, (200), 165 states have internal predecessors, (200), 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:07:43,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 200 transitions. [2023-12-24 21:07:43,339 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 200 transitions. Word has length 28 [2023-12-24 21:07:43,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:07:43,339 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 200 transitions. [2023-12-24 21:07:43,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:07:43,339 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 200 transitions. [2023-12-24 21:07:43,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-24 21:07:43,339 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:07:43,340 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, 1, 1, 1, 1] [2023-12-24 21:07:43,343 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 (18)] Forceful destruction successful, exit code 0 [2023-12-24 21:07:43,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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:07:43,543 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-12-24 21:07:43,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:07:43,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1666599485, now seen corresponding path program 1 times [2023-12-24 21:07:43,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:07:43,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [290649488] [2023-12-24 21:07:43,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:07:43,544 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:07:43,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:07:43,545 INFO L229 MonitoredProcess]: Starting monitored process 19 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:07:43,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-12-24 21:07:43,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:07:43,612 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-24 21:07:43,612 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:07:43,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:07:43,625 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:07:43,625 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:07:43,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [290649488] [2023-12-24 21:07:43,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [290649488] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:07:43,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:07:43,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 21:07:43,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117101000] [2023-12-24 21:07:43,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:07:43,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 21:07:43,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:07:43,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 21:07:43,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 21:07:43,626 INFO L87 Difference]: Start difference. First operand 166 states and 200 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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:07:43,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:07:43,707 INFO L93 Difference]: Finished difference Result 325 states and 406 transitions. [2023-12-24 21:07:43,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 21:07:43,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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 31 [2023-12-24 21:07:43,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:07:43,708 INFO L225 Difference]: With dead ends: 325 [2023-12-24 21:07:43,708 INFO L226 Difference]: Without dead ends: 227 [2023-12-24 21:07:43,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 21:07:43,709 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 7 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 21:07:43,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 142 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 21:07:43,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-12-24 21:07:43,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 215. [2023-12-24 21:07:43,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 209 states have (on average 1.244019138755981) internal successors, (260), 214 states have internal predecessors, (260), 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:07:43,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 260 transitions. [2023-12-24 21:07:43,755 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 260 transitions. Word has length 31 [2023-12-24 21:07:43,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:07:43,755 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 260 transitions. [2023-12-24 21:07:43,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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:07:43,755 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 260 transitions. [2023-12-24 21:07:43,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-24 21:07:43,756 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:07:43,756 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:07:43,759 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 (19)] Forceful destruction successful, exit code 0 [2023-12-24 21:07:43,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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:07:43,959 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-12-24 21:07:43,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:07:43,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1398696085, now seen corresponding path program 1 times [2023-12-24 21:07:43,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:07:43,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [640700075] [2023-12-24 21:07:43,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:07:43,960 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:07:43,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:07:43,961 INFO L229 MonitoredProcess]: Starting monitored process 20 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:07:43,963 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 (20)] Waiting until timeout for monitored process [2023-12-24 21:07:44,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:07:44,049 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-24 21:07:44,068 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:07:44,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-24 21:07:44,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-24 21:07:44,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-24 21:07:44,178 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-24 21:07:44,179 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:07:44,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2023-12-24 21:07:44,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-12-24 21:07:44,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2023-12-24 21:07:44,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-12-24 21:07:44,295 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-24 21:07:44,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 43 [2023-12-24 21:07:44,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2023-12-24 21:07:44,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:07:44,446 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:07:44,529 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (and (forall ((v_ArrVal_483 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_483) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) (_ bv0 32))) (forall ((v_ArrVal_484 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_484) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) (_ bv0 32))))) is different from false [2023-12-24 21:07:49,150 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:07:49,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2023-12-24 21:07:49,158 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:07:49,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 30 [2023-12-24 21:07:49,160 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 3 [2023-12-24 21:07:49,167 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-12-24 21:07:49,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 1 [2023-12-24 21:07:49,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:07:49,192 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:07:49,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [640700075] [2023-12-24 21:07:49,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [640700075] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:07:49,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:07:49,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-12-24 21:07:49,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144149042] [2023-12-24 21:07:49,192 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:07:49,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-24 21:07:49,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:07:49,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-24 21:07:49,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=138, Unknown=3, NotChecked=24, Total=210 [2023-12-24 21:07:49,193 INFO L87 Difference]: Start difference. First operand 215 states and 260 transitions. Second operand has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 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:07:52,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:07:52,791 INFO L93 Difference]: Finished difference Result 483 states and 582 transitions. [2023-12-24 21:07:52,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-24 21:07:52,792 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 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 35 [2023-12-24 21:07:52,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:07:52,794 INFO L225 Difference]: With dead ends: 483 [2023-12-24 21:07:52,794 INFO L226 Difference]: Without dead ends: 389 [2023-12-24 21:07:52,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=192, Invalid=459, Unknown=3, NotChecked=48, Total=702 [2023-12-24 21:07:52,794 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 561 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 57 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 215 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-12-24 21:07:52,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 570 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 330 Invalid, 1 Unknown, 215 Unchecked, 3.0s Time] [2023-12-24 21:07:52,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2023-12-24 21:07:52,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 232. [2023-12-24 21:07:52,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 226 states have (on average 1.238938053097345) internal successors, (280), 231 states have internal predecessors, (280), 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:07:52,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 280 transitions. [2023-12-24 21:07:52,854 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 280 transitions. Word has length 35 [2023-12-24 21:07:52,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:07:52,854 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 280 transitions. [2023-12-24 21:07:52,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 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:07:52,855 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 280 transitions. [2023-12-24 21:07:52,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-24 21:07:52,855 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:07:52,855 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:07:52,860 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 (20)] Forceful destruction successful, exit code 0 [2023-12-24 21:07:53,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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:07:53,059 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-12-24 21:07:53,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:07:53,059 INFO L85 PathProgramCache]: Analyzing trace with hash -812323024, now seen corresponding path program 1 times [2023-12-24 21:07:53,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:07:53,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [488105261] [2023-12-24 21:07:53,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:07:53,059 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:07:53,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:07:53,061 INFO L229 MonitoredProcess]: Starting monitored process 21 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:07:53,062 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 (21)] Waiting until timeout for monitored process [2023-12-24 21:07:53,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-24 21:07:53,152 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-24 21:07:53,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-24 21:07:53,212 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-24 21:07:53,212 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-24 21:07:53,213 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (12 of 13 remaining) [2023-12-24 21:07:53,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (11 of 13 remaining) [2023-12-24 21:07:53,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (10 of 13 remaining) [2023-12-24 21:07:53,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (9 of 13 remaining) [2023-12-24 21:07:53,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (8 of 13 remaining) [2023-12-24 21:07:53,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (7 of 13 remaining) [2023-12-24 21:07:53,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (6 of 13 remaining) [2023-12-24 21:07:53,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (5 of 13 remaining) [2023-12-24 21:07:53,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (4 of 13 remaining) [2023-12-24 21:07:53,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (3 of 13 remaining) [2023-12-24 21:07:53,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (2 of 13 remaining) [2023-12-24 21:07:53,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (1 of 13 remaining) [2023-12-24 21:07:53,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (0 of 13 remaining) [2023-12-24 21:07:53,221 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 (21)] Forceful destruction successful, exit code 0 [2023-12-24 21:07:53,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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:07:53,422 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:07:53,424 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 21:07:53,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 09:07:53 BoogieIcfgContainer [2023-12-24 21:07:53,443 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 21:07:53,443 INFO L158 Benchmark]: Toolchain (without parser) took 32979.80ms. Allocated memory was 197.1MB in the beginning and 419.4MB in the end (delta: 222.3MB). Free memory was 159.9MB in the beginning and 317.8MB in the end (delta: -157.9MB). Peak memory consumption was 66.4MB. Max. memory is 8.0GB. [2023-12-24 21:07:53,443 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 197.1MB. Free memory is still 153.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 21:07:53,444 INFO L158 Benchmark]: CACSL2BoogieTranslator took 316.97ms. Allocated memory is still 197.1MB. Free memory was 159.9MB in the beginning and 137.9MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2023-12-24 21:07:53,444 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.00ms. Allocated memory is still 197.1MB. Free memory was 137.9MB in the beginning and 135.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 21:07:53,444 INFO L158 Benchmark]: Boogie Preprocessor took 41.93ms. Allocated memory is still 197.1MB. Free memory was 135.3MB in the beginning and 132.0MB in the end (delta: 3.3MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-24 21:07:53,444 INFO L158 Benchmark]: RCFGBuilder took 656.92ms. Allocated memory is still 197.1MB. Free memory was 132.0MB in the beginning and 107.0MB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2023-12-24 21:07:53,444 INFO L158 Benchmark]: TraceAbstraction took 31922.70ms. Allocated memory was 197.1MB in the beginning and 419.4MB in the end (delta: 222.3MB). Free memory was 106.4MB in the beginning and 317.8MB in the end (delta: -211.4MB). Peak memory consumption was 12.9MB. Max. memory is 8.0GB. [2023-12-24 21:07:53,445 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.46ms. Allocated memory is still 197.1MB. Free memory is still 153.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 316.97ms. Allocated memory is still 197.1MB. Free memory was 159.9MB in the beginning and 137.9MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.00ms. Allocated memory is still 197.1MB. Free memory was 137.9MB in the beginning and 135.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.93ms. Allocated memory is still 197.1MB. Free memory was 135.3MB in the beginning and 132.0MB in the end (delta: 3.3MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 656.92ms. Allocated memory is still 197.1MB. Free memory was 132.0MB in the beginning and 107.0MB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 31922.70ms. Allocated memory was 197.1MB in the beginning and 419.4MB in the end (delta: 222.3MB). Free memory was 106.4MB in the beginning and 317.8MB in the end (delta: -211.4MB). Peak memory consumption was 12.9MB. 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 - CounterExampleResult [Line: 1036]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1002] SLL* list = malloc(sizeof(SLL)); [L1003] list->next = ((void*)0) [L1004] COND FALSE !(!(list != ((void*)0))) VAL [list={3:0}] [L1004] COND FALSE !(__VERIFIER_nondet_int()) [L1004] list->inner = malloc(sizeof(SLL)) [L1004] EXPR list->inner [L1004] list->inner->next = ((void*)0) [L1004] EXPR list->inner [L1004] list->inner->inner = ((void*)0) [L1004] EXPR list->inner [L1004] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={3:0}] [L1004] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) [L1004] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L1006] SLL* end = list; VAL [end={3:0}, list={3:0}] [L1009] COND FALSE !(__VERIFIER_nondet_int()) [L1019] end = ((void*)0) [L1020] end = list VAL [end={3:0}, list={3:0}] [L1023] COND FALSE !(!(((void*)0) != end)) VAL [end={3:0}, list={3:0}] [L1025] COND TRUE ((void*)0) != end [L1027] int len = 0; [L1028] EXPR end->inner [L1028] SLL* inner = end->inner; [L1029] COND TRUE ((void*)0) != inner VAL [end={3:0}, inner={6:0}, len=0, list={3:0}] [L1031] COND TRUE len == 0 [L1032] len = 1 VAL [end={3:0}, inner={6:0}, len=1, list={3:0}] [L1035] COND FALSE !(!(((void*)0) != inner)) VAL [end={3:0}, inner={6:0}, len=1, list={3:0}] [L1036] EXPR inner->inner [L1036] COND FALSE !(!(((void*)0) == inner->inner)) [L1037] EXPR inner->next [L1037] COND FALSE !(!(((void*)0) == inner->next)) [L1038] EXPR inner->inner [L1038] inner = inner->inner [L1039] COND TRUE len == 1 [L1040] EXPR inner->inner [L1040] inner = inner->inner VAL [end={3:0}, inner={0:-2147483648}, len=1, list={3:0}] [L1029] COND TRUE ((void*)0) != inner VAL [end={3:0}, inner={0:-2147483648}, len=1, list={3:0}] [L1031] COND FALSE !(len == 0) [L1034] len = 2 VAL [end={3:0}, inner={0:-2147483648}, len=2, list={3:0}] [L1035] COND FALSE !(!(((void*)0) != inner)) VAL [end={3:0}, inner={0:-2147483648}, len=2, list={3:0}] [L1036] EXPR inner->inner [L1036] COND TRUE !(((void*)0) == inner->inner) [L1036] reach_error() VAL [end={3:0}, inner={0:-2147483648}, len=2, list={3:0}] - UnprovableResult [Line: 1004]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1054]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1055]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 81 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 31.9s, OverallIterations: 20, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 14 mSolverCounterUnknown, 1751 SdHoareTripleChecker+Valid, 11.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1751 mSDsluCounter, 4515 SdHoareTripleChecker+Invalid, 11.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 226 IncrementalHoareTripleChecker+Unchecked, 3066 mSDsCounter, 118 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1625 IncrementalHoareTripleChecker+Invalid, 1983 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 118 mSolverCounterUnsat, 1449 mSDtfsCounter, 1625 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 464 GetRequests, 366 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 6.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=232occurred in iteration=19, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 722 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 12.1s InterpolantComputationTime, 415 NumberOfCodeBlocks, 415 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 422 ConstructedInterpolants, 37 QuantifiedInterpolants, 9408 SizeOfPredicates, 93 NumberOfNonLiveVariables, 1552 ConjunctsInSsa, 160 ConjunctsInUnsatCore, 21 InterpolantComputations, 17 PerfectInterpolantSequences, 6/14 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 proved your program to be incorrect! [2023-12-24 21:07:53,467 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 0 Received shutdown request...