/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/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-62.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 16:52:36,108 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 16:52:36,176 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 16:52:36,180 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 16:52:36,181 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 16:52:36,202 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 16:52:36,203 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 16:52:36,204 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 16:52:36,204 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 16:52:36,207 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 16:52:36,207 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 16:52:36,208 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 16:52:36,208 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 16:52:36,209 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 16:52:36,209 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 16:52:36,210 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 16:52:36,210 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 16:52:36,210 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 16:52:36,210 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 16:52:36,211 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 16:52:36,211 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 16:52:36,211 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 16:52:36,212 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 16:52:36,212 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 16:52:36,212 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 16:52:36,212 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 16:52:36,212 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 16:52:36,212 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 16:52:36,212 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 16:52:36,212 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 16:52:36,213 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 16:52:36,213 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 16:52:36,213 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 16:52:36,214 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 16:52:36,214 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 16:52:36,214 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 16:52:36,214 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 16:52:36,214 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 16:52:36,214 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 16:52:36,214 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 16:52:36,214 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 16:52:36,214 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 16:52:36,215 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 16:52:36,215 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 16:52:36,215 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 16:52:36,215 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 16:52:36,215 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 16:52:36,404 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 16:52:36,424 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 16:52:36,426 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 16:52:36,426 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 16:52:36,427 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 16:52:36,428 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-62.i [2023-12-24 16:52:37,406 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 16:52:37,561 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 16:52:37,562 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-62.i [2023-12-24 16:52:37,567 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48febbbcc/d33bc7a6f4a14617b8dd0a67d78ac607/FLAG50aeed4c9 [2023-12-24 16:52:37,578 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48febbbcc/d33bc7a6f4a14617b8dd0a67d78ac607 [2023-12-24 16:52:37,580 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 16:52:37,581 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 16:52:37,582 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 16:52:37,582 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 16:52:37,588 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 16:52:37,589 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 04:52:37" (1/1) ... [2023-12-24 16:52:37,589 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8e380a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:52:37, skipping insertion in model container [2023-12-24 16:52:37,589 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 04:52:37" (1/1) ... [2023-12-24 16:52:37,617 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 16:52:37,735 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-62.i[916,929] [2023-12-24 16:52:37,787 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 16:52:37,804 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 16:52:37,816 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-62.i[916,929] [2023-12-24 16:52:37,835 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 16:52:37,847 INFO L206 MainTranslator]: Completed translation [2023-12-24 16:52:37,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:52:37 WrapperNode [2023-12-24 16:52:37,848 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 16:52:37,849 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 16:52:37,849 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 16:52:37,849 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 16:52:37,853 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:52:37" (1/1) ... [2023-12-24 16:52:37,874 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:52:37" (1/1) ... [2023-12-24 16:52:37,892 INFO L138 Inliner]: procedures = 33, calls = 116, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 348 [2023-12-24 16:52:37,892 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 16:52:37,893 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 16:52:37,893 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 16:52:37,893 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 16:52:37,900 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:52:37" (1/1) ... [2023-12-24 16:52:37,900 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:52:37" (1/1) ... [2023-12-24 16:52:37,904 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:52:37" (1/1) ... [2023-12-24 16:52:37,918 INFO L175 MemorySlicer]: Split 87 memory accesses to 11 slices as follows [2, 6, 5, 10, 18, 4, 12, 11, 10, 5, 4]. 21 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 14 writes are split as follows [0, 1, 2, 1, 1, 1, 1, 4, 1, 1, 1]. [2023-12-24 16:52:37,918 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:52:37" (1/1) ... [2023-12-24 16:52:37,918 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:52:37" (1/1) ... [2023-12-24 16:52:37,928 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:52:37" (1/1) ... [2023-12-24 16:52:37,931 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:52:37" (1/1) ... [2023-12-24 16:52:37,934 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:52:37" (1/1) ... [2023-12-24 16:52:37,936 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:52:37" (1/1) ... [2023-12-24 16:52:37,940 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 16:52:37,941 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 16:52:37,941 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 16:52:37,941 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 16:52:37,941 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:52:37" (1/1) ... [2023-12-24 16:52:37,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 16:52:37,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 16:52:37,989 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 16:52:37,994 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 16:52:38,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 16:52:38,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-12-24 16:52:38,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-12-24 16:52:38,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-12-24 16:52:38,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-12-24 16:52:38,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2023-12-24 16:52:38,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2023-12-24 16:52:38,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2023-12-24 16:52:38,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2023-12-24 16:52:38,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2023-12-24 16:52:38,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2023-12-24 16:52:38,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2023-12-24 16:52:38,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2023-12-24 16:52:38,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2023-12-24 16:52:38,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2023-12-24 16:52:38,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2023-12-24 16:52:38,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2023-12-24 16:52:38,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2023-12-24 16:52:38,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2023-12-24 16:52:38,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2023-12-24 16:52:38,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2023-12-24 16:52:38,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2023-12-24 16:52:38,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2023-12-24 16:52:38,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 16:52:38,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 16:52:38,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-24 16:52:38,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-24 16:52:38,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-12-24 16:52:38,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2023-12-24 16:52:38,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2023-12-24 16:52:38,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2023-12-24 16:52:38,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2023-12-24 16:52:38,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2023-12-24 16:52:38,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2023-12-24 16:52:38,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2023-12-24 16:52:38,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2023-12-24 16:52:38,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2023-12-24 16:52:38,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2023-12-24 16:52:38,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2023-12-24 16:52:38,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2023-12-24 16:52:38,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2023-12-24 16:52:38,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2023-12-24 16:52:38,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2023-12-24 16:52:38,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2023-12-24 16:52:38,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2023-12-24 16:52:38,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-24 16:52:38,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-24 16:52:38,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-24 16:52:38,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-12-24 16:52:38,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2023-12-24 16:52:38,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2023-12-24 16:52:38,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2023-12-24 16:52:38,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2023-12-24 16:52:38,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2023-12-24 16:52:38,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2023-12-24 16:52:38,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2023-12-24 16:52:38,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2023-12-24 16:52:38,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2023-12-24 16:52:38,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2023-12-24 16:52:38,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2023-12-24 16:52:38,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2023-12-24 16:52:38,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2023-12-24 16:52:38,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2023-12-24 16:52:38,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2023-12-24 16:52:38,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2023-12-24 16:52:38,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2023-12-24 16:52:38,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2023-12-24 16:52:38,019 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 16:52:38,019 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 16:52:38,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 16:52:38,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 16:52:38,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-12-24 16:52:38,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-12-24 16:52:38,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2023-12-24 16:52:38,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2023-12-24 16:52:38,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2023-12-24 16:52:38,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2023-12-24 16:52:38,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2023-12-24 16:52:38,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2023-12-24 16:52:38,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2023-12-24 16:52:38,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2023-12-24 16:52:38,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2023-12-24 16:52:38,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2023-12-24 16:52:38,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2023-12-24 16:52:38,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2023-12-24 16:52:38,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2023-12-24 16:52:38,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2023-12-24 16:52:38,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2023-12-24 16:52:38,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2023-12-24 16:52:38,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2023-12-24 16:52:38,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2023-12-24 16:52:38,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2023-12-24 16:52:38,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2023-12-24 16:52:38,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-24 16:52:38,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-24 16:52:38,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-24 16:52:38,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-12-24 16:52:38,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-12-24 16:52:38,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2023-12-24 16:52:38,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2023-12-24 16:52:38,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2023-12-24 16:52:38,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2023-12-24 16:52:38,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2023-12-24 16:52:38,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2023-12-24 16:52:38,161 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 16:52:38,163 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 16:52:38,467 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 16:52:38,517 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 16:52:38,517 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 16:52:38,518 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 04:52:38 BoogieIcfgContainer [2023-12-24 16:52:38,518 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 16:52:38,521 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 16:52:38,521 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 16:52:38,523 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 16:52:38,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 04:52:37" (1/3) ... [2023-12-24 16:52:38,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21690718 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 04:52:38, skipping insertion in model container [2023-12-24 16:52:38,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:52:37" (2/3) ... [2023-12-24 16:52:38,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21690718 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 04:52:38, skipping insertion in model container [2023-12-24 16:52:38,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 04:52:38" (3/3) ... [2023-12-24 16:52:38,526 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-62.i [2023-12-24 16:52:38,539 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 16:52:38,539 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 16:52:38,577 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 16:52:38,582 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;@17c7e22b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 16:52:38,582 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 16:52:38,585 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 56 states have internal predecessors, (81), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-24 16:52:38,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-24 16:52:38,591 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:52:38,591 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 16:52:38,592 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:52:38,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:52:38,596 INFO L85 PathProgramCache]: Analyzing trace with hash -710106841, now seen corresponding path program 1 times [2023-12-24 16:52:38,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:52:38,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [542775130] [2023-12-24 16:52:38,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:52:38,605 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 16:52:38,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:52:38,607 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 16:52:38,619 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 16:52:38,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:52:38,795 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 16:52:38,803 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:52:38,839 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-12-24 16:52:38,839 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:52:38,840 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:52:38,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [542775130] [2023-12-24 16:52:38,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [542775130] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:52:38,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:52:38,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 16:52:38,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61235469] [2023-12-24 16:52:38,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:52:38,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 16:52:38,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:52:38,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 16:52:38,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 16:52:38,865 INFO L87 Difference]: Start difference. First operand has 66 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 56 states have internal predecessors, (81), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-24 16:52:38,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:52:38,893 INFO L93 Difference]: Finished difference Result 129 states and 200 transitions. [2023-12-24 16:52:38,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 16:52:38,895 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 68 [2023-12-24 16:52:38,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:52:38,899 INFO L225 Difference]: With dead ends: 129 [2023-12-24 16:52:38,899 INFO L226 Difference]: Without dead ends: 64 [2023-12-24 16:52:38,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 16:52:38,906 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 16:52:38,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 16:52:38,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-12-24 16:52:38,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-12-24 16:52:38,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 54 states have internal predecessors, (76), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-24 16:52:38,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 92 transitions. [2023-12-24 16:52:38,934 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 92 transitions. Word has length 68 [2023-12-24 16:52:38,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:52:38,934 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 92 transitions. [2023-12-24 16:52:38,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-24 16:52:38,934 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 92 transitions. [2023-12-24 16:52:38,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-24 16:52:38,936 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:52:38,936 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 16:52:38,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-24 16:52:39,142 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 16:52:39,143 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:52:39,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:52:39,144 INFO L85 PathProgramCache]: Analyzing trace with hash -770566889, now seen corresponding path program 1 times [2023-12-24 16:52:39,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:52:39,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1089952005] [2023-12-24 16:52:39,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:52:39,145 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 16:52:39,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:52:39,147 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 16:52:39,157 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 16:52:39,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:52:39,298 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 16:52:39,304 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:52:39,347 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 12 treesize of output 8 [2023-12-24 16:52:39,397 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 34 treesize of output 22 [2023-12-24 16:52:39,412 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 16:52:39,412 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:52:39,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:52:39,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1089952005] [2023-12-24 16:52:39,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1089952005] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:52:39,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:52:39,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 16:52:39,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258586280] [2023-12-24 16:52:39,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:52:39,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 16:52:39,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:52:39,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 16:52:39,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 16:52:39,415 INFO L87 Difference]: Start difference. First operand 64 states and 92 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:52:39,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:52:39,487 INFO L93 Difference]: Finished difference Result 152 states and 218 transitions. [2023-12-24 16:52:39,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 16:52:39,487 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 68 [2023-12-24 16:52:39,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:52:39,490 INFO L225 Difference]: With dead ends: 152 [2023-12-24 16:52:39,490 INFO L226 Difference]: Without dead ends: 89 [2023-12-24 16:52:39,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 65 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 16:52:39,493 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 92 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 16:52:39,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 255 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 16:52:39,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-24 16:52:39,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 64. [2023-12-24 16:52:39,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 54 states have internal predecessors, (75), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-24 16:52:39,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 91 transitions. [2023-12-24 16:52:39,509 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 91 transitions. Word has length 68 [2023-12-24 16:52:39,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:52:39,512 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 91 transitions. [2023-12-24 16:52:39,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:52:39,512 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 91 transitions. [2023-12-24 16:52:39,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-24 16:52:39,513 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:52:39,513 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 16:52:39,520 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 16:52:39,717 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 16:52:39,718 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:52:39,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:52:39,718 INFO L85 PathProgramCache]: Analyzing trace with hash -694795588, now seen corresponding path program 1 times [2023-12-24 16:52:39,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:52:39,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1400152025] [2023-12-24 16:52:39,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:52:39,719 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 16:52:39,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:52:39,721 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 16:52:39,756 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 16:52:39,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:52:39,866 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 16:52:39,869 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:52:39,882 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 12 treesize of output 8 [2023-12-24 16:52:39,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2023-12-24 16:52:39,945 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 16:52:39,945 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:52:39,946 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:52:39,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1400152025] [2023-12-24 16:52:39,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1400152025] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:52:39,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:52:39,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 16:52:39,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083700810] [2023-12-24 16:52:39,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:52:39,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 16:52:39,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:52:39,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 16:52:39,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-24 16:52:39,947 INFO L87 Difference]: Start difference. First operand 64 states and 91 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:52:40,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:52:40,047 INFO L93 Difference]: Finished difference Result 212 states and 303 transitions. [2023-12-24 16:52:40,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 16:52:40,048 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 70 [2023-12-24 16:52:40,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:52:40,049 INFO L225 Difference]: With dead ends: 212 [2023-12-24 16:52:40,049 INFO L226 Difference]: Without dead ends: 149 [2023-12-24 16:52:40,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-12-24 16:52:40,050 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 201 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 16:52:40,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 650 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 16:52:40,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-12-24 16:52:40,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 74. [2023-12-24 16:52:40,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 64 states have (on average 1.390625) internal successors, (89), 64 states have internal predecessors, (89), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-24 16:52:40,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 105 transitions. [2023-12-24 16:52:40,056 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 105 transitions. Word has length 70 [2023-12-24 16:52:40,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:52:40,056 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 105 transitions. [2023-12-24 16:52:40,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:52:40,057 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 105 transitions. [2023-12-24 16:52:40,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-24 16:52:40,058 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:52:40,058 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 16:52:40,064 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 16:52:40,262 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 16:52:40,262 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:52:40,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:52:40,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1968798550, now seen corresponding path program 1 times [2023-12-24 16:52:40,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:52:40,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [397397235] [2023-12-24 16:52:40,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:52:40,264 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 16:52:40,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:52:40,265 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 16:52:40,289 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 16:52:40,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:52:40,409 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 16:52:40,414 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:52:40,688 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 15 treesize of output 7 [2023-12-24 16:52:40,693 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 18 treesize of output 10 [2023-12-24 16:52:40,738 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 1 proven. 51 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-24 16:52:40,738 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:52:40,805 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 24 treesize of output 16 [2023-12-24 16:52:40,865 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:52:40,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [397397235] [2023-12-24 16:52:40,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [397397235] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 16:52:40,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1058885457] [2023-12-24 16:52:40,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:52:40,866 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 16:52:40,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 16:52:40,908 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 16:52:40,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2023-12-24 16:52:41,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:52:41,096 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 16:52:41,098 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:52:41,148 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 16:52:41,148 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:52:41,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1058885457] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:52:41,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 16:52:41,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2023-12-24 16:52:41,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692401242] [2023-12-24 16:52:41,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:52:41,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 16:52:41,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:52:41,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 16:52:41,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2023-12-24 16:52:41,152 INFO L87 Difference]: Start difference. First operand 74 states and 105 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:52:41,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:52:41,241 INFO L93 Difference]: Finished difference Result 162 states and 230 transitions. [2023-12-24 16:52:41,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 16:52:41,242 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 72 [2023-12-24 16:52:41,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:52:41,242 INFO L225 Difference]: With dead ends: 162 [2023-12-24 16:52:41,242 INFO L226 Difference]: Without dead ends: 89 [2023-12-24 16:52:41,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2023-12-24 16:52:41,243 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 28 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 16:52:41,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 323 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 16:52:41,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-24 16:52:41,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2023-12-24 16:52:41,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.3676470588235294) internal successors, (93), 68 states have internal predecessors, (93), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-24 16:52:41,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 109 transitions. [2023-12-24 16:52:41,248 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 109 transitions. Word has length 72 [2023-12-24 16:52:41,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:52:41,248 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 109 transitions. [2023-12-24 16:52:41,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:52:41,248 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 109 transitions. [2023-12-24 16:52:41,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-24 16:52:41,249 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:52:41,249 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 16:52:41,267 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 16:52:41,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2023-12-24 16:52:41,649 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,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 16:52:41,650 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:52:41,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:52:41,650 INFO L85 PathProgramCache]: Analyzing trace with hash 2026056852, now seen corresponding path program 1 times [2023-12-24 16:52:41,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:52:41,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1083500118] [2023-12-24 16:52:41,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:52:41,651 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 16:52:41,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:52:41,652 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 16:52:41,654 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 16:52:41,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:52:41,809 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 16:52:41,812 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:52:42,017 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 15 treesize of output 7 [2023-12-24 16:52:42,020 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 18 treesize of output 10 [2023-12-24 16:52:42,041 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 1 proven. 51 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-24 16:52:42,041 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:52:42,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2023-12-24 16:52:42,149 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:52:42,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1083500118] [2023-12-24 16:52:42,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1083500118] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 16:52:42,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [98045865] [2023-12-24 16:52:42,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:52:42,149 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 16:52:42,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 16:52:42,150 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 16:52:42,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2023-12-24 16:52:42,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:52:42,323 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 16:52:42,324 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:52:42,379 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 16:52:42,380 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:52:42,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [98045865] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:52:42,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 16:52:42,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2023-12-24 16:52:42,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021773867] [2023-12-24 16:52:42,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:52:42,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 16:52:42,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:52:42,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 16:52:42,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2023-12-24 16:52:42,381 INFO L87 Difference]: Start difference. First operand 78 states and 109 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:52:42,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:52:42,482 INFO L93 Difference]: Finished difference Result 167 states and 232 transitions. [2023-12-24 16:52:42,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 16:52:42,482 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 72 [2023-12-24 16:52:42,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:52:42,483 INFO L225 Difference]: With dead ends: 167 [2023-12-24 16:52:42,483 INFO L226 Difference]: Without dead ends: 90 [2023-12-24 16:52:42,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2023-12-24 16:52:42,484 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 22 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 16:52:42,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 398 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 16:52:42,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-12-24 16:52:42,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 80. [2023-12-24 16:52:42,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.3571428571428572) internal successors, (95), 70 states have internal predecessors, (95), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-24 16:52:42,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 111 transitions. [2023-12-24 16:52:42,489 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 111 transitions. Word has length 72 [2023-12-24 16:52:42,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:52:42,490 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 111 transitions. [2023-12-24 16:52:42,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:52:42,490 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 111 transitions. [2023-12-24 16:52:42,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-24 16:52:42,490 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:52:42,491 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 16:52:42,494 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 16:52:42,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2023-12-24 16:52:42,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 16:52:42,895 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:52:42,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:52:42,895 INFO L85 PathProgramCache]: Analyzing trace with hash 2026116434, now seen corresponding path program 1 times [2023-12-24 16:52:42,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:52:42,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1172707202] [2023-12-24 16:52:42,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:52:42,896 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 16:52:42,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:52:42,897 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 16:52:42,964 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 16:52:43,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:52:43,060 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 16:52:43,063 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:52:43,261 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 15 treesize of output 7 [2023-12-24 16:52:43,264 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 18 treesize of output 10 [2023-12-24 16:52:43,285 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 1 proven. 51 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-24 16:52:43,285 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:52:43,342 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 24 treesize of output 16 [2023-12-24 16:52:43,406 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:52:43,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1172707202] [2023-12-24 16:52:43,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1172707202] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 16:52:43,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1662598205] [2023-12-24 16:52:43,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:52:43,406 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 16:52:43,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 16:52:43,407 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 16:52:43,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2023-12-24 16:52:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:52:43,584 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 16:52:43,586 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:52:43,643 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 16:52:43,644 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:52:43,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1662598205] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:52:43,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 16:52:43,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2023-12-24 16:52:43,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485778017] [2023-12-24 16:52:43,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:52:43,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 16:52:43,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:52:43,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 16:52:43,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2023-12-24 16:52:43,645 INFO L87 Difference]: Start difference. First operand 80 states and 111 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:52:43,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:52:43,721 INFO L93 Difference]: Finished difference Result 217 states and 299 transitions. [2023-12-24 16:52:43,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 16:52:43,722 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 72 [2023-12-24 16:52:43,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:52:43,723 INFO L225 Difference]: With dead ends: 217 [2023-12-24 16:52:43,723 INFO L226 Difference]: Without dead ends: 138 [2023-12-24 16:52:43,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2023-12-24 16:52:43,723 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 81 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 16:52:43,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 495 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 16:52:43,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-12-24 16:52:43,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 80. [2023-12-24 16:52:43,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.3428571428571427) internal successors, (94), 70 states have internal predecessors, (94), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-24 16:52:43,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 110 transitions. [2023-12-24 16:52:43,728 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 110 transitions. Word has length 72 [2023-12-24 16:52:43,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:52:43,728 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 110 transitions. [2023-12-24 16:52:43,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:52:43,728 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 110 transitions. [2023-12-24 16:52:43,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-24 16:52:43,729 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:52:43,729 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 16:52:43,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-24 16:52:43,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2023-12-24 16:52:44,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 16:52:44,133 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:52:44,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:52:44,134 INFO L85 PathProgramCache]: Analyzing trace with hash -22400883, now seen corresponding path program 1 times [2023-12-24 16:52:44,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:52:44,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [76866449] [2023-12-24 16:52:44,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:52:44,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 16:52:44,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:52:44,135 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 16:52:44,139 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 16:52:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:52:44,286 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 16:52:44,287 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:52:44,298 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 16:52:44,299 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:52:44,299 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:52:44,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [76866449] [2023-12-24 16:52:44,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [76866449] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:52:44,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:52:44,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 16:52:44,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588042955] [2023-12-24 16:52:44,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:52:44,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 16:52:44,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:52:44,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 16:52:44,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 16:52:44,300 INFO L87 Difference]: Start difference. First operand 80 states and 110 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:52:44,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:52:44,354 INFO L93 Difference]: Finished difference Result 175 states and 241 transitions. [2023-12-24 16:52:44,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 16:52:44,355 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 72 [2023-12-24 16:52:44,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:52:44,355 INFO L225 Difference]: With dead ends: 175 [2023-12-24 16:52:44,355 INFO L226 Difference]: Without dead ends: 96 [2023-12-24 16:52:44,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-24 16:52:44,356 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 60 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 16:52:44,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 319 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 16:52:44,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-12-24 16:52:44,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 83. [2023-12-24 16:52:44,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 73 states have (on average 1.3287671232876712) internal successors, (97), 73 states have internal predecessors, (97), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-24 16:52:44,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 113 transitions. [2023-12-24 16:52:44,360 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 113 transitions. Word has length 72 [2023-12-24 16:52:44,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:52:44,360 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 113 transitions. [2023-12-24 16:52:44,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:52:44,360 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 113 transitions. [2023-12-24 16:52:44,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-24 16:52:44,361 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:52:44,361 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 16:52:44,367 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 (11)] Ended with exit code 0 [2023-12-24 16:52:44,564 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 16:52:44,565 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:52:44,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:52:44,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1221843874, now seen corresponding path program 1 times [2023-12-24 16:52:44,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:52:44,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [598259153] [2023-12-24 16:52:44,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:52:44,566 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 16:52:44,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:52:44,567 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 16:52:44,568 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 16:52:44,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:52:44,696 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-24 16:52:44,698 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:52:44,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-12-24 16:52:44,895 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 6 proven. 46 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-24 16:52:44,895 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:52:44,978 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 16:52:44,979 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:52:44,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [598259153] [2023-12-24 16:52:44,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [598259153] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 16:52:44,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 16:52:44,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2023-12-24 16:52:44,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412719720] [2023-12-24 16:52:44,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:52:44,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 16:52:44,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:52:44,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 16:52:44,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-12-24 16:52:44,981 INFO L87 Difference]: Start difference. First operand 83 states and 113 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:52:45,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:52:45,044 INFO L93 Difference]: Finished difference Result 196 states and 265 transitions. [2023-12-24 16:52:45,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 16:52:45,045 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 72 [2023-12-24 16:52:45,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:52:45,045 INFO L225 Difference]: With dead ends: 196 [2023-12-24 16:52:45,045 INFO L226 Difference]: Without dead ends: 114 [2023-12-24 16:52:45,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-12-24 16:52:45,047 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 115 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 16:52:45,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 249 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 16:52:45,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-12-24 16:52:45,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 83. [2023-12-24 16:52:45,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 73 states have (on average 1.3150684931506849) internal successors, (96), 73 states have internal predecessors, (96), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-24 16:52:45,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 112 transitions. [2023-12-24 16:52:45,053 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 112 transitions. Word has length 72 [2023-12-24 16:52:45,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:52:45,054 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 112 transitions. [2023-12-24 16:52:45,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:52:45,054 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 112 transitions. [2023-12-24 16:52:45,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-24 16:52:45,054 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:52:45,054 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 16:52:45,072 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 16:52:45,258 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 16:52:45,258 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:52:45,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:52:45,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1308385672, now seen corresponding path program 1 times [2023-12-24 16:52:45,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:52:45,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1939335650] [2023-12-24 16:52:45,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:52:45,259 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 16:52:45,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:52:45,260 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 16:52:45,262 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 16:52:45,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:52:45,381 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 16:52:45,383 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:52:45,577 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 15 treesize of output 7 [2023-12-24 16:52:45,580 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 18 treesize of output 10 [2023-12-24 16:52:45,600 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 1 proven. 51 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-24 16:52:45,600 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:52:45,660 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 24 treesize of output 16 [2023-12-24 16:52:45,701 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:52:45,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1939335650] [2023-12-24 16:52:45,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1939335650] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 16:52:45,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [174821085] [2023-12-24 16:52:45,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:52:45,702 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 16:52:45,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 16:52:45,712 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 16:52:45,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2023-12-24 16:52:45,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:52:45,928 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-24 16:52:45,931 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:52:46,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-24 16:52:46,444 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 18 treesize of output 10 [2023-12-24 16:52:46,448 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 15 treesize of output 7 [2023-12-24 16:52:46,467 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 1 proven. 51 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-24 16:52:46,467 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:52:46,482 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 24 treesize of output 16 [2023-12-24 16:52:46,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [174821085] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 16:52:46,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 16:52:46,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2023-12-24 16:52:46,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256242097] [2023-12-24 16:52:46,530 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 16:52:46,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-24 16:52:46,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:52:46,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-24 16:52:46,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2023-12-24 16:52:46,531 INFO L87 Difference]: Start difference. First operand 83 states and 112 transitions. Second operand has 18 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 6 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) [2023-12-24 16:52:47,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:52:47,249 INFO L93 Difference]: Finished difference Result 227 states and 299 transitions. [2023-12-24 16:52:47,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-24 16:52:47,249 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 6 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) Word has length 74 [2023-12-24 16:52:47,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:52:47,250 INFO L225 Difference]: With dead ends: 227 [2023-12-24 16:52:47,250 INFO L226 Difference]: Without dead ends: 145 [2023-12-24 16:52:47,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 176 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=294, Invalid=1038, Unknown=0, NotChecked=0, Total=1332 [2023-12-24 16:52:47,251 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 198 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-24 16:52:47,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 908 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-24 16:52:47,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-12-24 16:52:47,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 138. [2023-12-24 16:52:47,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 124 states have (on average 1.2983870967741935) internal successors, (161), 125 states have internal predecessors, (161), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-24 16:52:47,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 181 transitions. [2023-12-24 16:52:47,257 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 181 transitions. Word has length 74 [2023-12-24 16:52:47,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:52:47,257 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 181 transitions. [2023-12-24 16:52:47,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 6 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) [2023-12-24 16:52:47,257 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 181 transitions. [2023-12-24 16:52:47,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-24 16:52:47,258 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:52:47,258 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 16:52:47,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Ended with exit code 0 [2023-12-24 16:52:47,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-12-24 16:52:47,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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 16:52:47,662 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:52:47,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:52:47,662 INFO L85 PathProgramCache]: Analyzing trace with hash -885683846, now seen corresponding path program 1 times [2023-12-24 16:52:47,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:52:47,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1589236414] [2023-12-24 16:52:47,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:52:47,663 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 16:52:47,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:52:47,664 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 16:52:47,665 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 16:52:47,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:52:47,792 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 16:52:47,794 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:52:47,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-24 16:52:47,865 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 16:52:47,866 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:52:47,866 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:52:47,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1589236414] [2023-12-24 16:52:47,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1589236414] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:52:47,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:52:47,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 16:52:47,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475801118] [2023-12-24 16:52:47,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:52:47,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 16:52:47,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:52:47,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 16:52:47,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 16:52:47,867 INFO L87 Difference]: Start difference. First operand 138 states and 181 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:52:48,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:52:48,096 INFO L93 Difference]: Finished difference Result 346 states and 452 transitions. [2023-12-24 16:52:48,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 16:52:48,096 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 74 [2023-12-24 16:52:48,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:52:48,098 INFO L225 Difference]: With dead ends: 346 [2023-12-24 16:52:48,098 INFO L226 Difference]: Without dead ends: 209 [2023-12-24 16:52:48,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-24 16:52:48,099 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 120 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 16:52:48,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 417 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 16:52:48,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2023-12-24 16:52:48,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 132. [2023-12-24 16:52:48,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 118 states have (on average 1.2966101694915255) internal successors, (153), 119 states have internal predecessors, (153), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-24 16:52:48,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 173 transitions. [2023-12-24 16:52:48,104 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 173 transitions. Word has length 74 [2023-12-24 16:52:48,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:52:48,105 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 173 transitions. [2023-12-24 16:52:48,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:52:48,105 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 173 transitions. [2023-12-24 16:52:48,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-24 16:52:48,105 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:52:48,105 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 16:52:48,115 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 16:52:48,309 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 16:52:48,309 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:52:48,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:52:48,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1896801096, now seen corresponding path program 1 times [2023-12-24 16:52:48,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:52:48,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1259827306] [2023-12-24 16:52:48,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:52:48,310 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 16:52:48,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:52:48,311 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 16:52:48,317 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 16:52:48,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:52:48,467 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-24 16:52:48,469 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:52:48,490 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 17 treesize of output 9 [2023-12-24 16:52:48,660 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 19 treesize of output 15 [2023-12-24 16:52:48,709 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 24 treesize of output 16 [2023-12-24 16:52:48,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 29 [2023-12-24 16:52:48,798 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-12-24 16:52:48,798 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:52:48,916 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 16:52:48,916 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:52:48,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1259827306] [2023-12-24 16:52:48,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1259827306] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 16:52:48,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 16:52:48,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [14] total 20 [2023-12-24 16:52:48,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593654138] [2023-12-24 16:52:48,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:52:48,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-24 16:52:48,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:52:48,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-24 16:52:48,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2023-12-24 16:52:48,917 INFO L87 Difference]: Start difference. First operand 132 states and 173 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:52:49,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:52:49,164 INFO L93 Difference]: Finished difference Result 306 states and 399 transitions. [2023-12-24 16:52:49,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-24 16:52:49,164 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 74 [2023-12-24 16:52:49,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:52:49,165 INFO L225 Difference]: With dead ends: 306 [2023-12-24 16:52:49,165 INFO L226 Difference]: Without dead ends: 175 [2023-12-24 16:52:49,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2023-12-24 16:52:49,166 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 190 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 16:52:49,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 784 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 16:52:49,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-12-24 16:52:49,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 136. [2023-12-24 16:52:49,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 122 states have (on average 1.2868852459016393) internal successors, (157), 123 states have internal predecessors, (157), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-24 16:52:49,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 177 transitions. [2023-12-24 16:52:49,171 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 177 transitions. Word has length 74 [2023-12-24 16:52:49,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:52:49,172 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 177 transitions. [2023-12-24 16:52:49,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:52:49,172 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 177 transitions. [2023-12-24 16:52:49,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-24 16:52:49,172 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:52:49,172 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 16:52:49,180 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 (16)] Ended with exit code 0 [2023-12-24 16:52:49,376 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 16:52:49,376 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:52:49,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:52:49,377 INFO L85 PathProgramCache]: Analyzing trace with hash 253759711, now seen corresponding path program 1 times [2023-12-24 16:52:49,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:52:49,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1354010038] [2023-12-24 16:52:49,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:52:49,377 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 16:52:49,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:52:49,378 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 16:52:49,380 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 16:52:49,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:52:49,514 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-24 16:52:49,517 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:52:49,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-12-24 16:52:49,709 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 6 proven. 46 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-24 16:52:49,709 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:52:49,781 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 16:52:49,781 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:52:49,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1354010038] [2023-12-24 16:52:49,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1354010038] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 16:52:49,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 16:52:49,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2023-12-24 16:52:49,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021652398] [2023-12-24 16:52:49,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:52:49,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 16:52:49,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:52:49,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 16:52:49,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-12-24 16:52:49,782 INFO L87 Difference]: Start difference. First operand 136 states and 177 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:52:49,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:52:49,834 INFO L93 Difference]: Finished difference Result 306 states and 398 transitions. [2023-12-24 16:52:49,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 16:52:49,835 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 74 [2023-12-24 16:52:49,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:52:49,836 INFO L225 Difference]: With dead ends: 306 [2023-12-24 16:52:49,836 INFO L226 Difference]: Without dead ends: 171 [2023-12-24 16:52:49,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-12-24 16:52:49,837 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 119 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 268 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.0s IncrementalHoareTripleChecker+Time [2023-12-24 16:52:49,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 268 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 16:52:49,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-12-24 16:52:49,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 136. [2023-12-24 16:52:49,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 122 states have (on average 1.278688524590164) internal successors, (156), 123 states have internal predecessors, (156), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-24 16:52:49,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 176 transitions. [2023-12-24 16:52:49,842 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 176 transitions. Word has length 74 [2023-12-24 16:52:49,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:52:49,842 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 176 transitions. [2023-12-24 16:52:49,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:52:49,842 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 176 transitions. [2023-12-24 16:52:49,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-24 16:52:49,843 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:52:49,843 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 16:52:49,849 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 16:52:50,047 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 16:52:50,047 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:52:50,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:52:50,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1700175206, now seen corresponding path program 1 times [2023-12-24 16:52:50,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:52:50,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1956252653] [2023-12-24 16:52:50,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:52:50,048 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 16:52:50,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:52:50,049 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 16:52:50,050 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 16:52:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:52:50,207 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-24 16:52:50,209 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:52:50,353 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 15 treesize of output 7 [2023-12-24 16:52:50,363 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 1 proven. 51 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-24 16:52:50,363 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:52:50,417 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:52:50,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1956252653] [2023-12-24 16:52:50,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1956252653] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 16:52:50,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1121654877] [2023-12-24 16:52:50,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:52:50,417 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 16:52:50,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 16:52:50,444 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 16:52:50,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2023-12-24 16:52:50,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:52:50,676 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-24 16:52:50,678 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:52:50,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-24 16:52:51,212 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 39 treesize of output 27 [2023-12-24 16:52:51,214 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 29 treesize of output 17 [2023-12-24 16:52:51,249 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 1 proven. 51 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-24 16:52:51,250 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:52:51,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-12-24 16:52:51,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1121654877] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 16:52:51,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 16:52:51,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 18 [2023-12-24 16:52:51,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852055997] [2023-12-24 16:52:51,354 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 16:52:51,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-24 16:52:51,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:52:51,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-24 16:52:51,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2023-12-24 16:52:51,356 INFO L87 Difference]: Start difference. First operand 136 states and 176 transitions. Second operand has 18 states, 16 states have (on average 5.1875) internal successors, (83), 16 states have internal predecessors, (83), 6 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) [2023-12-24 16:52:52,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:52:52,003 INFO L93 Difference]: Finished difference Result 304 states and 388 transitions. [2023-12-24 16:52:52,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-24 16:52:52,008 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 5.1875) internal successors, (83), 16 states have internal predecessors, (83), 6 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) Word has length 74 [2023-12-24 16:52:52,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:52:52,009 INFO L225 Difference]: With dead ends: 304 [2023-12-24 16:52:52,009 INFO L226 Difference]: Without dead ends: 169 [2023-12-24 16:52:52,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=267, Invalid=1139, Unknown=0, NotChecked=0, Total=1406 [2023-12-24 16:52:52,010 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 283 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 16:52:52,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 654 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 16:52:52,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2023-12-24 16:52:52,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 156. [2023-12-24 16:52:52,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 134 states have (on average 1.2388059701492538) internal successors, (166), 136 states have internal predecessors, (166), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-24 16:52:52,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 198 transitions. [2023-12-24 16:52:52,017 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 198 transitions. Word has length 74 [2023-12-24 16:52:52,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:52:52,017 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 198 transitions. [2023-12-24 16:52:52,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 5.1875) internal successors, (83), 16 states have internal predecessors, (83), 6 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) [2023-12-24 16:52:52,017 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 198 transitions. [2023-12-24 16:52:52,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-24 16:52:52,018 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:52:52,018 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 16:52:52,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Ended with exit code 0 [2023-12-24 16:52:52,227 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 (18)] Ended with exit code 0 [2023-12-24 16:52:52,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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 16:52:52,424 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:52:52,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:52:52,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1697474561, now seen corresponding path program 1 times [2023-12-24 16:52:52,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:52:52,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1490739593] [2023-12-24 16:52:52,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:52:52,425 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 16:52:52,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:52:52,433 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 16:52:52,436 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 16:52:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:52:52,576 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-24 16:52:52,578 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:52:52,725 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 20 treesize of output 16 [2023-12-24 16:52:52,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2023-12-24 16:52:52,796 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 42 treesize of output 26 [2023-12-24 16:52:52,853 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 5 proven. 63 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-12-24 16:52:52,853 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:52:52,991 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 16:52:52,991 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:52:52,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1490739593] [2023-12-24 16:52:52,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1490739593] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 16:52:52,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 16:52:52,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15] total 20 [2023-12-24 16:52:52,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904484129] [2023-12-24 16:52:52,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:52:52,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-24 16:52:52,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:52:52,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-24 16:52:52,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2023-12-24 16:52:52,993 INFO L87 Difference]: Start difference. First operand 156 states and 198 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:52:53,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:52:53,348 INFO L93 Difference]: Finished difference Result 360 states and 460 transitions. [2023-12-24 16:52:53,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-24 16:52:53,348 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2023-12-24 16:52:53,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:52:53,349 INFO L225 Difference]: With dead ends: 360 [2023-12-24 16:52:53,349 INFO L226 Difference]: Without dead ends: 225 [2023-12-24 16:52:53,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=601, Unknown=0, NotChecked=0, Total=702 [2023-12-24 16:52:53,350 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 245 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 16:52:53,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 787 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 16:52:53,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2023-12-24 16:52:53,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 156. [2023-12-24 16:52:53,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 134 states have (on average 1.2388059701492538) internal successors, (166), 136 states have internal predecessors, (166), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-24 16:52:53,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 198 transitions. [2023-12-24 16:52:53,358 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 198 transitions. Word has length 75 [2023-12-24 16:52:53,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:52:53,358 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 198 transitions. [2023-12-24 16:52:53,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:52:53,359 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 198 transitions. [2023-12-24 16:52:53,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-24 16:52:53,359 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:52:53,359 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 16:52:53,377 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 16:52:53,577 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 16:52:53,577 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:52:53,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:52:53,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1586375485, now seen corresponding path program 1 times [2023-12-24 16:52:53,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:52:53,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [897802184] [2023-12-24 16:52:53,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:52:53,578 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 16:52:53,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:52:53,579 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 16:52:53,581 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 16:52:53,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:52:53,723 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 16:52:53,725 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:52:53,743 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 18 treesize of output 10 [2023-12-24 16:52:53,773 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 16:52:53,773 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:52:53,773 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:52:53,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [897802184] [2023-12-24 16:52:53,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [897802184] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:52:53,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:52:53,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 16:52:53,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932368601] [2023-12-24 16:52:53,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:52:53,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 16:52:53,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:52:53,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 16:52:53,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 16:52:53,775 INFO L87 Difference]: Start difference. First operand 156 states and 198 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:52:53,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:52:53,868 INFO L93 Difference]: Finished difference Result 328 states and 417 transitions. [2023-12-24 16:52:53,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 16:52:53,869 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2023-12-24 16:52:53,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:52:53,870 INFO L225 Difference]: With dead ends: 328 [2023-12-24 16:52:53,870 INFO L226 Difference]: Without dead ends: 193 [2023-12-24 16:52:53,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 71 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 16:52:53,870 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 84 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 16:52:53,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 370 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 16:52:53,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2023-12-24 16:52:53,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 150. [2023-12-24 16:52:53,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 128 states have (on average 1.234375) internal successors, (158), 130 states have internal predecessors, (158), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-24 16:52:53,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 190 transitions. [2023-12-24 16:52:53,877 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 190 transitions. Word has length 75 [2023-12-24 16:52:53,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:52:53,878 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 190 transitions. [2023-12-24 16:52:53,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:52:53,878 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 190 transitions. [2023-12-24 16:52:53,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-24 16:52:53,878 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:52:53,878 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 16:52:53,899 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 16:52:54,083 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 16:52:54,083 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:52:54,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:52:54,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1071944993, now seen corresponding path program 1 times [2023-12-24 16:52:54,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:52:54,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [284030461] [2023-12-24 16:52:54,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:52:54,084 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 16:52:54,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:52:54,085 INFO L229 MonitoredProcess]: Starting monitored process 22 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 16:52:54,085 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 (22)] Waiting until timeout for monitored process [2023-12-24 16:52:54,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:52:54,227 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-24 16:52:54,228 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:52:54,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-12-24 16:52:54,368 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 6 proven. 46 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-24 16:52:54,368 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:52:54,427 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 16:52:54,428 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:52:54,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [284030461] [2023-12-24 16:52:54,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [284030461] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 16:52:54,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 16:52:54,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2023-12-24 16:52:54,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289762109] [2023-12-24 16:52:54,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:52:54,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 16:52:54,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:52:54,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 16:52:54,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-12-24 16:52:54,429 INFO L87 Difference]: Start difference. First operand 150 states and 190 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:52:54,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:52:54,475 INFO L93 Difference]: Finished difference Result 281 states and 356 transitions. [2023-12-24 16:52:54,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 16:52:54,476 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2023-12-24 16:52:54,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:52:54,476 INFO L225 Difference]: With dead ends: 281 [2023-12-24 16:52:54,476 INFO L226 Difference]: Without dead ends: 152 [2023-12-24 16:52:54,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-12-24 16:52:54,477 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 82 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 16:52:54,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 228 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 16:52:54,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-12-24 16:52:54,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2023-12-24 16:52:54,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 128 states have (on average 1.2265625) internal successors, (157), 130 states have internal predecessors, (157), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-24 16:52:54,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 189 transitions. [2023-12-24 16:52:54,484 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 189 transitions. Word has length 75 [2023-12-24 16:52:54,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:52:54,484 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 189 transitions. [2023-12-24 16:52:54,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:52:54,484 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 189 transitions. [2023-12-24 16:52:54,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-24 16:52:54,485 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:52:54,485 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 16:52:54,491 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 (22)] Forceful destruction successful, exit code 0 [2023-12-24 16:52:54,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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 16:52:54,689 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:52:54,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:52:54,689 INFO L85 PathProgramCache]: Analyzing trace with hash 2088904177, now seen corresponding path program 1 times [2023-12-24 16:52:54,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:52:54,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1646373864] [2023-12-24 16:52:54,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:52:54,690 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 16:52:54,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:52:54,691 INFO L229 MonitoredProcess]: Starting monitored process 23 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 16:52:54,692 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 (23)] Waiting until timeout for monitored process [2023-12-24 16:52:54,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:52:54,842 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-24 16:52:54,844 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:52:55,080 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 23 treesize of output 15 [2023-12-24 16:52:55,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-24 16:52:55,109 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 15 treesize of output 7 [2023-12-24 16:52:55,129 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 1 proven. 51 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-24 16:52:55,129 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:52:55,240 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:52:55,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1646373864] [2023-12-24 16:52:55,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1646373864] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 16:52:55,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [721450983] [2023-12-24 16:52:55,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:52:55,241 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 16:52:55,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 16:52:55,242 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 16:52:55,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2023-12-24 16:52:55,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:52:55,477 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-24 16:52:55,480 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:52:55,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-24 16:52:56,041 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 39 treesize of output 27 [2023-12-24 16:52:56,044 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 29 treesize of output 17 [2023-12-24 16:52:56,078 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 1 proven. 51 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-24 16:52:56,078 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:52:56,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-12-24 16:52:56,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [721450983] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 16:52:56,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 16:52:56,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2023-12-24 16:52:56,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138677154] [2023-12-24 16:52:56,182 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 16:52:56,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-24 16:52:56,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:52:56,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-24 16:52:56,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2023-12-24 16:52:56,184 INFO L87 Difference]: Start difference. First operand 150 states and 189 transitions. Second operand has 19 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 6 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) [2023-12-24 16:52:57,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:52:57,197 INFO L93 Difference]: Finished difference Result 309 states and 388 transitions. [2023-12-24 16:52:57,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-24 16:52:57,197 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 6 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) Word has length 76 [2023-12-24 16:52:57,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:52:57,198 INFO L225 Difference]: With dead ends: 309 [2023-12-24 16:52:57,198 INFO L226 Difference]: Without dead ends: 180 [2023-12-24 16:52:57,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=421, Invalid=1835, Unknown=0, NotChecked=0, Total=2256 [2023-12-24 16:52:57,199 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 274 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-24 16:52:57,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 802 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-24 16:52:57,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-12-24 16:52:57,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 156. [2023-12-24 16:52:57,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 130 states have (on average 1.2076923076923076) internal successors, (157), 132 states have internal predecessors, (157), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-24 16:52:57,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 193 transitions. [2023-12-24 16:52:57,208 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 193 transitions. Word has length 76 [2023-12-24 16:52:57,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:52:57,208 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 193 transitions. [2023-12-24 16:52:57,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 6 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) [2023-12-24 16:52:57,208 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 193 transitions. [2023-12-24 16:52:57,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-24 16:52:57,209 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:52:57,209 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 16:52:57,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Forceful destruction successful, exit code 0 [2023-12-24 16:52:57,417 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 (23)] Forceful destruction successful, exit code 0 [2023-12-24 16:52:57,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,23 /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 16:52:57,616 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:52:57,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:52:57,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1207142703, now seen corresponding path program 1 times [2023-12-24 16:52:57,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:52:57,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1724289786] [2023-12-24 16:52:57,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:52:57,617 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 16:52:57,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:52:57,618 INFO L229 MonitoredProcess]: Starting monitored process 25 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 16:52:57,651 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 (25)] Waiting until timeout for monitored process [2023-12-24 16:52:57,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:52:57,766 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-24 16:52:57,768 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:52:57,864 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 17 treesize of output 13 [2023-12-24 16:52:57,899 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 54 treesize of output 42 [2023-12-24 16:52:57,901 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 42 treesize of output 30 [2023-12-24 16:52:57,933 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-12-24 16:52:57,933 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:52:58,002 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 16:52:58,002 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:52:58,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1724289786] [2023-12-24 16:52:58,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1724289786] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 16:52:58,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 16:52:58,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 13 [2023-12-24 16:52:58,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949403950] [2023-12-24 16:52:58,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:52:58,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 16:52:58,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:52:58,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 16:52:58,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2023-12-24 16:52:58,003 INFO L87 Difference]: Start difference. First operand 156 states and 193 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:52:58,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:52:58,294 INFO L93 Difference]: Finished difference Result 440 states and 553 transitions. [2023-12-24 16:52:58,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-24 16:52:58,294 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 78 [2023-12-24 16:52:58,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:52:58,295 INFO L225 Difference]: With dead ends: 440 [2023-12-24 16:52:58,296 INFO L226 Difference]: Without dead ends: 317 [2023-12-24 16:52:58,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=585, Unknown=0, NotChecked=0, Total=756 [2023-12-24 16:52:58,296 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 299 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 16:52:58,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 617 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 16:52:58,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2023-12-24 16:52:58,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 254. [2023-12-24 16:52:58,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 219 states have (on average 1.1917808219178083) internal successors, (261), 223 states have internal predecessors, (261), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 20 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-24 16:52:58,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 309 transitions. [2023-12-24 16:52:58,308 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 309 transitions. Word has length 78 [2023-12-24 16:52:58,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:52:58,308 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 309 transitions. [2023-12-24 16:52:58,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:52:58,308 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 309 transitions. [2023-12-24 16:52:58,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-24 16:52:58,309 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:52:58,309 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 16:52:58,313 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 (25)] Forceful destruction successful, exit code 0 [2023-12-24 16:52:58,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /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 16:52:58,513 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:52:58,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:52:58,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1425997421, now seen corresponding path program 1 times [2023-12-24 16:52:58,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:52:58,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [207037982] [2023-12-24 16:52:58,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:52:58,513 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 16:52:58,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:52:58,515 INFO L229 MonitoredProcess]: Starting monitored process 26 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 16:52:58,527 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 (26)] Waiting until timeout for monitored process [2023-12-24 16:52:58,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:52:58,661 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-24 16:52:58,663 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:52:58,666 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 12 treesize of output 8 [2023-12-24 16:52:58,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2023-12-24 16:52:58,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-12-24 16:52:58,739 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 16:52:58,740 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:52:58,740 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:52:58,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [207037982] [2023-12-24 16:52:58,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [207037982] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:52:58,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:52:58,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 16:52:58,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784585073] [2023-12-24 16:52:58,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:52:58,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 16:52:58,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:52:58,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 16:52:58,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-24 16:52:58,741 INFO L87 Difference]: Start difference. First operand 254 states and 309 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:52:58,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:52:58,961 INFO L93 Difference]: Finished difference Result 536 states and 657 transitions. [2023-12-24 16:52:58,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 16:52:58,961 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 78 [2023-12-24 16:52:58,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:52:58,964 INFO L225 Difference]: With dead ends: 536 [2023-12-24 16:52:58,964 INFO L226 Difference]: Without dead ends: 319 [2023-12-24 16:52:58,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-12-24 16:52:58,965 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 163 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 16:52:58,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 514 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 16:52:58,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2023-12-24 16:52:58,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 237. [2023-12-24 16:52:58,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 204 states have (on average 1.1715686274509804) internal successors, (239), 207 states have internal predecessors, (239), 22 states have call successors, (22), 10 states have call predecessors, (22), 10 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-24 16:52:58,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 283 transitions. [2023-12-24 16:52:58,976 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 283 transitions. Word has length 78 [2023-12-24 16:52:58,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:52:58,977 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 283 transitions. [2023-12-24 16:52:58,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:52:58,977 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 283 transitions. [2023-12-24 16:52:58,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-12-24 16:52:58,977 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:52:58,977 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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, 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 16:52:58,996 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 (26)] Forceful destruction successful, exit code 0 [2023-12-24 16:52:59,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /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 16:52:59,183 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:52:59,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:52:59,184 INFO L85 PathProgramCache]: Analyzing trace with hash -2119412344, now seen corresponding path program 1 times [2023-12-24 16:52:59,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:52:59,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1463809562] [2023-12-24 16:52:59,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:52:59,184 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 16:52:59,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:52:59,214 INFO L229 MonitoredProcess]: Starting monitored process 27 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 16:52:59,251 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 (27)] Waiting until timeout for monitored process [2023-12-24 16:52:59,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:52:59,418 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-24 16:52:59,420 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:52:59,434 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 17 treesize of output 13 [2023-12-24 16:52:59,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 39 [2023-12-24 16:52:59,495 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 16:52:59,495 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:52:59,495 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:52:59,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1463809562] [2023-12-24 16:52:59,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1463809562] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:52:59,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:52:59,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 16:52:59,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683915398] [2023-12-24 16:52:59,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:52:59,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 16:52:59,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:52:59,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 16:52:59,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 16:52:59,496 INFO L87 Difference]: Start difference. First operand 237 states and 283 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:52:59,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:52:59,584 INFO L93 Difference]: Finished difference Result 252 states and 303 transitions. [2023-12-24 16:52:59,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 16:52:59,584 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 80 [2023-12-24 16:52:59,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:52:59,586 INFO L225 Difference]: With dead ends: 252 [2023-12-24 16:52:59,586 INFO L226 Difference]: Without dead ends: 250 [2023-12-24 16:52:59,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 76 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 16:52:59,586 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 62 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 16:52:59,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 341 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 16:52:59,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2023-12-24 16:52:59,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 243. [2023-12-24 16:52:59,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 210 states have (on average 1.1666666666666667) internal successors, (245), 213 states have internal predecessors, (245), 22 states have call successors, (22), 10 states have call predecessors, (22), 10 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-24 16:52:59,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 289 transitions. [2023-12-24 16:52:59,600 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 289 transitions. Word has length 80 [2023-12-24 16:52:59,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:52:59,600 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 289 transitions. [2023-12-24 16:52:59,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:52:59,600 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 289 transitions. [2023-12-24 16:52:59,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-12-24 16:52:59,601 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:52:59,601 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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, 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 16:52:59,605 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 (27)] Ended with exit code 0 [2023-12-24 16:52:59,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /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 16:52:59,801 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:52:59,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:52:59,802 INFO L85 PathProgramCache]: Analyzing trace with hash -2119352762, now seen corresponding path program 1 times [2023-12-24 16:52:59,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:52:59,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [220324021] [2023-12-24 16:52:59,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:52:59,802 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 16:52:59,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:52:59,803 INFO L229 MonitoredProcess]: Starting monitored process 28 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 16:52:59,832 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 (28)] Waiting until timeout for monitored process [2023-12-24 16:52:59,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:52:59,954 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-24 16:52:59,956 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:52:59,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-24 16:53:00,005 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 16:53:00,005 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:53:00,005 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:53:00,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [220324021] [2023-12-24 16:53:00,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [220324021] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:53:00,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:53:00,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 16:53:00,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042998997] [2023-12-24 16:53:00,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:53:00,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 16:53:00,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:53:00,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 16:53:00,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 16:53:00,006 INFO L87 Difference]: Start difference. First operand 243 states and 289 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:53:00,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:53:00,077 INFO L93 Difference]: Finished difference Result 453 states and 541 transitions. [2023-12-24 16:53:00,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 16:53:00,078 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 80 [2023-12-24 16:53:00,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:53:00,079 INFO L225 Difference]: With dead ends: 453 [2023-12-24 16:53:00,079 INFO L226 Difference]: Without dead ends: 247 [2023-12-24 16:53:00,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-24 16:53:00,080 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 51 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 16:53:00,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 323 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 16:53:00,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2023-12-24 16:53:00,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 235. [2023-12-24 16:53:00,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 205 states have (on average 1.1560975609756097) internal successors, (237), 208 states have internal predecessors, (237), 20 states have call successors, (20), 9 states have call predecessors, (20), 9 states have return successors, (20), 17 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 16:53:00,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 277 transitions. [2023-12-24 16:53:00,091 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 277 transitions. Word has length 80 [2023-12-24 16:53:00,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:53:00,091 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 277 transitions. [2023-12-24 16:53:00,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:53:00,091 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 277 transitions. [2023-12-24 16:53:00,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-12-24 16:53:00,092 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:53:00,092 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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, 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 16:53:00,096 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 (28)] Ended with exit code 0 [2023-12-24 16:53:00,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /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 16:53:00,296 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:53:00,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:53:00,296 INFO L85 PathProgramCache]: Analyzing trace with hash -2062094460, now seen corresponding path program 1 times [2023-12-24 16:53:00,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:53:00,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1892060082] [2023-12-24 16:53:00,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:53:00,297 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 16:53:00,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:53:00,298 INFO L229 MonitoredProcess]: Starting monitored process 29 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 16:53:00,299 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 (29)] Waiting until timeout for monitored process [2023-12-24 16:53:00,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:53:00,530 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-24 16:53:00,532 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:53:00,577 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 17 treesize of output 9 [2023-12-24 16:53:01,026 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 27 treesize of output 23 [2023-12-24 16:53:01,351 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 1 proven. 83 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-24 16:53:01,351 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:53:01,555 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 16:53:01,555 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:53:01,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1892060082] [2023-12-24 16:53:01,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1892060082] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 16:53:01,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 16:53:01,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 16 [2023-12-24 16:53:01,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318285081] [2023-12-24 16:53:01,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:53:01,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 16:53:01,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:53:01,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 16:53:01,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2023-12-24 16:53:01,556 INFO L87 Difference]: Start difference. First operand 235 states and 277 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:53:01,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:53:01,773 INFO L93 Difference]: Finished difference Result 620 states and 732 transitions. [2023-12-24 16:53:01,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 16:53:01,776 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 80 [2023-12-24 16:53:01,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:53:01,777 INFO L225 Difference]: With dead ends: 620 [2023-12-24 16:53:01,777 INFO L226 Difference]: Without dead ends: 410 [2023-12-24 16:53:01,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2023-12-24 16:53:01,779 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 64 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 16:53:01,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 342 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 16:53:01,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2023-12-24 16:53:01,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 346. [2023-12-24 16:53:01,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 316 states have (on average 1.1550632911392404) internal successors, (365), 319 states have internal predecessors, (365), 20 states have call successors, (20), 9 states have call predecessors, (20), 9 states have return successors, (20), 17 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 16:53:01,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 405 transitions. [2023-12-24 16:53:01,794 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 405 transitions. Word has length 80 [2023-12-24 16:53:01,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:53:01,795 INFO L495 AbstractCegarLoop]: Abstraction has 346 states and 405 transitions. [2023-12-24 16:53:01,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:53:01,795 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 405 transitions. [2023-12-24 16:53:01,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-12-24 16:53:01,795 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:53:01,796 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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, 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 16:53:01,802 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 (29)] Forceful destruction successful, exit code 0 [2023-12-24 16:53:02,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /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 16:53:02,000 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:53:02,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:53:02,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1186718059, now seen corresponding path program 1 times [2023-12-24 16:53:02,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:53:02,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [113459922] [2023-12-24 16:53:02,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:53:02,001 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 16:53:02,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:53:02,002 INFO L229 MonitoredProcess]: Starting monitored process 30 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 16:53:02,012 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 (30)] Waiting until timeout for monitored process [2023-12-24 16:53:02,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:53:02,159 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-24 16:53:02,161 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:53:02,298 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 6 proven. 46 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-24 16:53:02,299 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:53:02,351 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 16:53:02,352 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:53:02,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [113459922] [2023-12-24 16:53:02,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [113459922] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 16:53:02,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 16:53:02,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2023-12-24 16:53:02,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682132092] [2023-12-24 16:53:02,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:53:02,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 16:53:02,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:53:02,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 16:53:02,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-24 16:53:02,353 INFO L87 Difference]: Start difference. First operand 346 states and 405 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:53:02,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:53:02,413 INFO L93 Difference]: Finished difference Result 681 states and 795 transitions. [2023-12-24 16:53:02,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 16:53:02,414 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 81 [2023-12-24 16:53:02,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:53:02,416 INFO L225 Difference]: With dead ends: 681 [2023-12-24 16:53:02,416 INFO L226 Difference]: Without dead ends: 360 [2023-12-24 16:53:02,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-12-24 16:53:02,417 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 51 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 16:53:02,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 327 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 16:53:02,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2023-12-24 16:53:02,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 300. [2023-12-24 16:53:02,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 270 states have (on average 1.137037037037037) internal successors, (307), 273 states have internal predecessors, (307), 20 states have call successors, (20), 9 states have call predecessors, (20), 9 states have return successors, (20), 17 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 16:53:02,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 347 transitions. [2023-12-24 16:53:02,432 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 347 transitions. Word has length 81 [2023-12-24 16:53:02,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:53:02,432 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 347 transitions. [2023-12-24 16:53:02,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:53:02,432 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 347 transitions. [2023-12-24 16:53:02,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-12-24 16:53:02,433 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:53:02,433 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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, 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 16:53:02,453 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 (30)] Forceful destruction successful, exit code 0 [2023-12-24 16:53:02,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /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 16:53:02,637 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:53:02,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:53:02,637 INFO L85 PathProgramCache]: Analyzing trace with hash 846304127, now seen corresponding path program 1 times [2023-12-24 16:53:02,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:53:02,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1142783222] [2023-12-24 16:53:02,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:53:02,638 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 16:53:02,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:53:02,639 INFO L229 MonitoredProcess]: Starting monitored process 31 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 16:53:02,639 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 (31)] Waiting until timeout for monitored process [2023-12-24 16:53:02,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:53:02,812 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 16:53:02,814 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:53:02,833 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 17 treesize of output 9 [2023-12-24 16:53:02,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-12-24 16:53:02,969 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 16:53:02,969 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:53:02,969 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:53:02,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1142783222] [2023-12-24 16:53:02,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1142783222] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:53:02,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:53:02,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 16:53:02,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120043372] [2023-12-24 16:53:02,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:53:02,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 16:53:02,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:53:02,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 16:53:02,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-24 16:53:02,970 INFO L87 Difference]: Start difference. First operand 300 states and 347 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:53:03,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:53:03,447 INFO L93 Difference]: Finished difference Result 976 states and 1121 transitions. [2023-12-24 16:53:03,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-24 16:53:03,448 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 82 [2023-12-24 16:53:03,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:53:03,450 INFO L225 Difference]: With dead ends: 976 [2023-12-24 16:53:03,450 INFO L226 Difference]: Without dead ends: 701 [2023-12-24 16:53:03,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2023-12-24 16:53:03,451 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 291 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-24 16:53:03,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 430 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-24 16:53:03,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2023-12-24 16:53:03,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 527. [2023-12-24 16:53:03,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 485 states have (on average 1.1402061855670103) internal successors, (553), 488 states have internal predecessors, (553), 28 states have call successors, (28), 13 states have call predecessors, (28), 13 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-24 16:53:03,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 609 transitions. [2023-12-24 16:53:03,495 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 609 transitions. Word has length 82 [2023-12-24 16:53:03,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:53:03,495 INFO L495 AbstractCegarLoop]: Abstraction has 527 states and 609 transitions. [2023-12-24 16:53:03,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:53:03,495 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 609 transitions. [2023-12-24 16:53:03,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-12-24 16:53:03,496 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:53:03,496 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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, 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 16:53:03,500 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 (31)] Ended with exit code 0 [2023-12-24 16:53:03,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /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 16:53:03,700 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:53:03,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:53:03,700 INFO L85 PathProgramCache]: Analyzing trace with hash -548655890, now seen corresponding path program 1 times [2023-12-24 16:53:03,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:53:03,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1346466050] [2023-12-24 16:53:03,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:53:03,701 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 16:53:03,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:53:03,717 INFO L229 MonitoredProcess]: Starting monitored process 32 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 16:53:03,720 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 (32)] Waiting until timeout for monitored process [2023-12-24 16:53:03,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:53:03,869 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-24 16:53:03,871 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:53:03,877 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 17 treesize of output 9 [2023-12-24 16:53:03,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-12-24 16:53:03,950 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 16:53:03,951 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:53:03,951 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:53:03,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1346466050] [2023-12-24 16:53:03,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1346466050] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:53:03,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:53:03,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 16:53:03,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633633074] [2023-12-24 16:53:03,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:53:03,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 16:53:03,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:53:03,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 16:53:03,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-24 16:53:03,952 INFO L87 Difference]: Start difference. First operand 527 states and 609 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:53:04,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:53:04,156 INFO L93 Difference]: Finished difference Result 1060 states and 1221 transitions. [2023-12-24 16:53:04,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 16:53:04,157 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 82 [2023-12-24 16:53:04,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:53:04,158 INFO L225 Difference]: With dead ends: 1060 [2023-12-24 16:53:04,158 INFO L226 Difference]: Without dead ends: 558 [2023-12-24 16:53:04,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-12-24 16:53:04,159 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 140 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 16:53:04,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 401 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 16:53:04,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2023-12-24 16:53:04,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 480. [2023-12-24 16:53:04,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 438 states have (on average 1.1324200913242009) internal successors, (496), 441 states have internal predecessors, (496), 28 states have call successors, (28), 13 states have call predecessors, (28), 13 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-24 16:53:04,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 552 transitions. [2023-12-24 16:53:04,177 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 552 transitions. Word has length 82 [2023-12-24 16:53:04,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:53:04,178 INFO L495 AbstractCegarLoop]: Abstraction has 480 states and 552 transitions. [2023-12-24 16:53:04,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:53:04,178 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 552 transitions. [2023-12-24 16:53:04,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-12-24 16:53:04,178 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:53:04,178 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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, 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 16:53:04,184 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 (32)] Ended with exit code 0 [2023-12-24 16:53:04,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /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 16:53:04,383 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:53:04,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:53:04,383 INFO L85 PathProgramCache]: Analyzing trace with hash -818166341, now seen corresponding path program 1 times [2023-12-24 16:53:04,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:53:04,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [861538983] [2023-12-24 16:53:04,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:53:04,383 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 16:53:04,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:53:04,385 INFO L229 MonitoredProcess]: Starting monitored process 33 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 16:53:04,417 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 (33)] Waiting until timeout for monitored process [2023-12-24 16:53:04,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:53:04,585 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-24 16:53:04,588 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:53:04,622 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 17 treesize of output 9 [2023-12-24 16:53:05,017 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 27 treesize of output 23 [2023-12-24 16:53:05,317 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 1 proven. 83 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-24 16:53:05,317 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:53:05,484 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 16:53:05,484 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:53:05,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [861538983] [2023-12-24 16:53:05,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [861538983] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 16:53:05,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 16:53:05,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 18 [2023-12-24 16:53:05,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893000898] [2023-12-24 16:53:05,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:53:05,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 16:53:05,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:53:05,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 16:53:05,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2023-12-24 16:53:05,486 INFO L87 Difference]: Start difference. First operand 480 states and 552 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:53:05,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:53:05,871 INFO L93 Difference]: Finished difference Result 1028 states and 1184 transitions. [2023-12-24 16:53:05,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-24 16:53:05,872 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 83 [2023-12-24 16:53:05,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:53:05,874 INFO L225 Difference]: With dead ends: 1028 [2023-12-24 16:53:05,874 INFO L226 Difference]: Without dead ends: 573 [2023-12-24 16:53:05,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2023-12-24 16:53:05,875 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 70 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 16:53:05,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 405 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 16:53:05,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2023-12-24 16:53:05,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 487. [2023-12-24 16:53:05,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 445 states have (on average 1.1370786516853932) internal successors, (506), 448 states have internal predecessors, (506), 28 states have call successors, (28), 13 states have call predecessors, (28), 13 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-24 16:53:05,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 562 transitions. [2023-12-24 16:53:05,892 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 562 transitions. Word has length 83 [2023-12-24 16:53:05,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:53:05,893 INFO L495 AbstractCegarLoop]: Abstraction has 487 states and 562 transitions. [2023-12-24 16:53:05,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:53:05,893 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 562 transitions. [2023-12-24 16:53:05,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-24 16:53:05,893 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:53:05,893 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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, 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 16:53:05,907 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 (33)] Forceful destruction successful, exit code 0 [2023-12-24 16:53:06,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /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 16:53:06,098 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:53:06,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:53:06,099 INFO L85 PathProgramCache]: Analyzing trace with hash -39782315, now seen corresponding path program 1 times [2023-12-24 16:53:06,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:53:06,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [617328347] [2023-12-24 16:53:06,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:53:06,099 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 16:53:06,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:53:06,100 INFO L229 MonitoredProcess]: Starting monitored process 34 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 16:53:06,133 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 (34)] Waiting until timeout for monitored process [2023-12-24 16:53:06,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:53:06,266 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 16:53:06,268 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:53:06,276 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 17 treesize of output 9 [2023-12-24 16:53:06,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-24 16:53:06,442 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 16:53:06,443 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:53:06,443 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:53:06,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [617328347] [2023-12-24 16:53:06,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [617328347] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:53:06,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:53:06,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 16:53:06,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626228446] [2023-12-24 16:53:06,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:53:06,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 16:53:06,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:53:06,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 16:53:06,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-24 16:53:06,444 INFO L87 Difference]: Start difference. First operand 487 states and 562 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:53:06,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:53:06,835 INFO L93 Difference]: Finished difference Result 1048 states and 1198 transitions. [2023-12-24 16:53:06,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 16:53:06,836 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 85 [2023-12-24 16:53:06,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:53:06,837 INFO L225 Difference]: With dead ends: 1048 [2023-12-24 16:53:06,837 INFO L226 Difference]: Without dead ends: 586 [2023-12-24 16:53:06,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2023-12-24 16:53:06,838 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 146 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 16:53:06,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 631 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 16:53:06,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2023-12-24 16:53:06,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 513. [2023-12-24 16:53:06,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 471 states have (on average 1.127388535031847) internal successors, (531), 474 states have internal predecessors, (531), 28 states have call successors, (28), 13 states have call predecessors, (28), 13 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-24 16:53:06,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 587 transitions. [2023-12-24 16:53:06,858 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 587 transitions. Word has length 85 [2023-12-24 16:53:06,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:53:06,858 INFO L495 AbstractCegarLoop]: Abstraction has 513 states and 587 transitions. [2023-12-24 16:53:06,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:53:06,858 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 587 transitions. [2023-12-24 16:53:06,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-12-24 16:53:06,860 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:53:06,860 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 16:53:06,864 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 (34)] Forceful destruction successful, exit code 0 [2023-12-24 16:53:07,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /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 16:53:07,064 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:53:07,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:53:07,064 INFO L85 PathProgramCache]: Analyzing trace with hash 767981285, now seen corresponding path program 1 times [2023-12-24 16:53:07,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:53:07,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [441588043] [2023-12-24 16:53:07,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:53:07,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 16:53:07,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:53:07,066 INFO L229 MonitoredProcess]: Starting monitored process 35 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 16:53:07,096 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 (35)] Waiting until timeout for monitored process [2023-12-24 16:53:07,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:53:07,280 INFO L262 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-24 16:53:07,283 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:53:07,624 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 32 proven. 287 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2023-12-24 16:53:07,624 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:53:07,672 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 498 trivial. 0 not checked. [2023-12-24 16:53:07,673 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:53:07,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [441588043] [2023-12-24 16:53:07,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [441588043] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 16:53:07,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 16:53:07,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2023-12-24 16:53:07,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376346742] [2023-12-24 16:53:07,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:53:07,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 16:53:07,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:53:07,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 16:53:07,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-24 16:53:07,674 INFO L87 Difference]: Start difference. First operand 513 states and 587 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:53:07,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:53:07,761 INFO L93 Difference]: Finished difference Result 881 states and 1017 transitions. [2023-12-24 16:53:07,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 16:53:07,788 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 161 [2023-12-24 16:53:07,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:53:07,790 INFO L225 Difference]: With dead ends: 881 [2023-12-24 16:53:07,790 INFO L226 Difference]: Without dead ends: 600 [2023-12-24 16:53:07,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-12-24 16:53:07,791 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 46 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 16:53:07,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 382 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 16:53:07,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2023-12-24 16:53:07,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 515. [2023-12-24 16:53:07,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 473 states have (on average 1.1268498942917549) internal successors, (533), 476 states have internal predecessors, (533), 28 states have call successors, (28), 13 states have call predecessors, (28), 13 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-24 16:53:07,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 589 transitions. [2023-12-24 16:53:07,837 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 589 transitions. Word has length 161 [2023-12-24 16:53:07,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:53:07,838 INFO L495 AbstractCegarLoop]: Abstraction has 515 states and 589 transitions. [2023-12-24 16:53:07,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:53:07,838 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 589 transitions. [2023-12-24 16:53:07,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-12-24 16:53:07,839 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:53:07,839 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 16:53:07,846 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 (35)] Forceful destruction successful, exit code 0 [2023-12-24 16:53:08,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /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 16:53:08,041 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:53:08,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:53:08,042 INFO L85 PathProgramCache]: Analyzing trace with hash 790613539, now seen corresponding path program 1 times [2023-12-24 16:53:08,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:53:08,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [926104895] [2023-12-24 16:53:08,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:53:08,042 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 16:53:08,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:53:08,043 INFO L229 MonitoredProcess]: Starting monitored process 36 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 16:53:08,060 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 (36)] Waiting until timeout for monitored process [2023-12-24 16:53:08,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:53:08,283 INFO L262 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 16:53:08,286 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:53:08,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-24 16:53:08,340 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 497 trivial. 0 not checked. [2023-12-24 16:53:08,340 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:53:08,340 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:53:08,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [926104895] [2023-12-24 16:53:08,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [926104895] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:53:08,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:53:08,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 16:53:08,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421091984] [2023-12-24 16:53:08,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:53:08,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 16:53:08,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:53:08,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 16:53:08,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 16:53:08,341 INFO L87 Difference]: Start difference. First operand 515 states and 589 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:53:08,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:53:08,498 INFO L93 Difference]: Finished difference Result 1177 states and 1344 transitions. [2023-12-24 16:53:08,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 16:53:08,498 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 161 [2023-12-24 16:53:08,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:53:08,500 INFO L225 Difference]: With dead ends: 1177 [2023-12-24 16:53:08,500 INFO L226 Difference]: Without dead ends: 687 [2023-12-24 16:53:08,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 159 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 16:53:08,501 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 73 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 16:53:08,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 334 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 16:53:08,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2023-12-24 16:53:08,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 595. [2023-12-24 16:53:08,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 553 states have (on average 1.1121157323688968) internal successors, (615), 556 states have internal predecessors, (615), 28 states have call successors, (28), 13 states have call predecessors, (28), 13 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-24 16:53:08,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 671 transitions. [2023-12-24 16:53:08,520 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 671 transitions. Word has length 161 [2023-12-24 16:53:08,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:53:08,520 INFO L495 AbstractCegarLoop]: Abstraction has 595 states and 671 transitions. [2023-12-24 16:53:08,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:53:08,520 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 671 transitions. [2023-12-24 16:53:08,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-12-24 16:53:08,521 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:53:08,521 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 16:53:08,543 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 (36)] Forceful destruction successful, exit code 0 [2023-12-24 16:53:08,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /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 16:53:08,727 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:53:08,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:53:08,727 INFO L85 PathProgramCache]: Analyzing trace with hash 61476176, now seen corresponding path program 1 times [2023-12-24 16:53:08,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:53:08,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1121481605] [2023-12-24 16:53:08,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:53:08,728 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 16:53:08,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:53:08,729 INFO L229 MonitoredProcess]: Starting monitored process 37 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 16:53:08,730 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 (37)] Waiting until timeout for monitored process [2023-12-24 16:53:08,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:53:08,947 INFO L262 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-24 16:53:08,952 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:53:09,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-12-24 16:53:09,339 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 13 proven. 306 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2023-12-24 16:53:09,339 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:53:09,423 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2023-12-24 16:53:09,423 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:53:09,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1121481605] [2023-12-24 16:53:09,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1121481605] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 16:53:09,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 16:53:09,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2023-12-24 16:53:09,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961082137] [2023-12-24 16:53:09,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:53:09,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 16:53:09,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:53:09,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 16:53:09,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-12-24 16:53:09,426 INFO L87 Difference]: Start difference. First operand 595 states and 671 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:53:09,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:53:09,531 INFO L93 Difference]: Finished difference Result 1060 states and 1197 transitions. [2023-12-24 16:53:09,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 16:53:09,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 163 [2023-12-24 16:53:09,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:53:09,533 INFO L225 Difference]: With dead ends: 1060 [2023-12-24 16:53:09,533 INFO L226 Difference]: Without dead ends: 697 [2023-12-24 16:53:09,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-12-24 16:53:09,534 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 41 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 16:53:09,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 311 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 16:53:09,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2023-12-24 16:53:09,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 613. [2023-12-24 16:53:09,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 571 states have (on average 1.1120840630472855) internal successors, (635), 574 states have internal predecessors, (635), 28 states have call successors, (28), 13 states have call predecessors, (28), 13 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-24 16:53:09,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 691 transitions. [2023-12-24 16:53:09,554 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 691 transitions. Word has length 163 [2023-12-24 16:53:09,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:53:09,555 INFO L495 AbstractCegarLoop]: Abstraction has 613 states and 691 transitions. [2023-12-24 16:53:09,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:53:09,555 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 691 transitions. [2023-12-24 16:53:09,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-12-24 16:53:09,557 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:53:09,557 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 16:53:09,578 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 (37)] Forceful destruction successful, exit code 0 [2023-12-24 16:53:09,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /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 16:53:09,763 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:53:09,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:53:09,763 INFO L85 PathProgramCache]: Analyzing trace with hash 762540754, now seen corresponding path program 1 times [2023-12-24 16:53:09,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:53:09,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1483071285] [2023-12-24 16:53:09,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:53:09,764 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 16:53:09,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:53:09,781 INFO L229 MonitoredProcess]: Starting monitored process 38 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 16:53:09,792 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 (38)] Waiting until timeout for monitored process [2023-12-24 16:53:10,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:53:10,028 INFO L262 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 16:53:10,031 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:53:10,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-12-24 16:53:10,103 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 497 trivial. 0 not checked. [2023-12-24 16:53:10,103 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:53:10,103 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:53:10,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1483071285] [2023-12-24 16:53:10,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1483071285] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:53:10,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:53:10,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 16:53:10,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136341498] [2023-12-24 16:53:10,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:53:10,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 16:53:10,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:53:10,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 16:53:10,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 16:53:10,105 INFO L87 Difference]: Start difference. First operand 613 states and 691 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:53:10,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:53:10,413 INFO L93 Difference]: Finished difference Result 1030 states and 1162 transitions. [2023-12-24 16:53:10,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 16:53:10,414 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 163 [2023-12-24 16:53:10,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:53:10,415 INFO L225 Difference]: With dead ends: 1030 [2023-12-24 16:53:10,415 INFO L226 Difference]: Without dead ends: 649 [2023-12-24 16:53:10,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-24 16:53:10,416 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 58 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 16:53:10,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 248 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 16:53:10,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2023-12-24 16:53:10,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 574. [2023-12-24 16:53:10,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 532 states have (on average 1.1109022556390977) internal successors, (591), 535 states have internal predecessors, (591), 28 states have call successors, (28), 13 states have call predecessors, (28), 13 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-24 16:53:10,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 647 transitions. [2023-12-24 16:53:10,433 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 647 transitions. Word has length 163 [2023-12-24 16:53:10,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:53:10,434 INFO L495 AbstractCegarLoop]: Abstraction has 574 states and 647 transitions. [2023-12-24 16:53:10,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:53:10,434 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 647 transitions. [2023-12-24 16:53:10,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-12-24 16:53:10,435 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:53:10,435 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 16:53:10,442 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 (38)] Forceful destruction successful, exit code 0 [2023-12-24 16:53:10,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /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 16:53:10,640 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:53:10,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:53:10,641 INFO L85 PathProgramCache]: Analyzing trace with hash 2109556318, now seen corresponding path program 1 times [2023-12-24 16:53:10,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:53:10,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [56801234] [2023-12-24 16:53:10,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:53:10,641 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 16:53:10,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:53:10,642 INFO L229 MonitoredProcess]: Starting monitored process 39 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 16:53:10,675 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 (39)] Waiting until timeout for monitored process [2023-12-24 16:53:10,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:53:10,888 INFO L262 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 16:53:10,891 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:53:10,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-24 16:53:10,929 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 497 trivial. 0 not checked. [2023-12-24 16:53:10,929 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:53:10,929 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:53:10,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [56801234] [2023-12-24 16:53:10,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [56801234] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:53:10,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:53:10,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 16:53:10,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951759420] [2023-12-24 16:53:10,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:53:10,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 16:53:10,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:53:10,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 16:53:10,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 16:53:10,931 INFO L87 Difference]: Start difference. First operand 574 states and 647 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:53:11,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:53:11,060 INFO L93 Difference]: Finished difference Result 858 states and 968 transitions. [2023-12-24 16:53:11,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 16:53:11,061 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 163 [2023-12-24 16:53:11,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:53:11,062 INFO L225 Difference]: With dead ends: 858 [2023-12-24 16:53:11,062 INFO L226 Difference]: Without dead ends: 482 [2023-12-24 16:53:11,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 160 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 16:53:11,064 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 15 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 16:53:11,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 194 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 16:53:11,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2023-12-24 16:53:11,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2023-12-24 16:53:11,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 440 states have (on average 1.1022727272727273) internal successors, (485), 443 states have internal predecessors, (485), 28 states have call successors, (28), 13 states have call predecessors, (28), 13 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-24 16:53:11,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 541 transitions. [2023-12-24 16:53:11,085 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 541 transitions. Word has length 163 [2023-12-24 16:53:11,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:53:11,085 INFO L495 AbstractCegarLoop]: Abstraction has 482 states and 541 transitions. [2023-12-24 16:53:11,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:53:11,086 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 541 transitions. [2023-12-24 16:53:11,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2023-12-24 16:53:11,086 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:53:11,087 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 16:53:11,102 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 (39)] Forceful destruction successful, exit code 0 [2023-12-24 16:53:11,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /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 16:53:11,292 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:53:11,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:53:11,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1336951680, now seen corresponding path program 1 times [2023-12-24 16:53:11,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:53:11,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [724918186] [2023-12-24 16:53:11,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:53:11,293 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 16:53:11,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:53:11,294 INFO L229 MonitoredProcess]: Starting monitored process 40 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 16:53:11,330 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 (40)] Waiting until timeout for monitored process [2023-12-24 16:53:11,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:53:11,544 INFO L262 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 16:53:11,547 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:53:11,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-24 16:53:11,620 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 497 trivial. 0 not checked. [2023-12-24 16:53:11,620 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:53:11,621 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:53:11,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [724918186] [2023-12-24 16:53:11,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [724918186] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:53:11,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:53:11,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 16:53:11,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53017789] [2023-12-24 16:53:11,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:53:11,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 16:53:11,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:53:11,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 16:53:11,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 16:53:11,623 INFO L87 Difference]: Start difference. First operand 482 states and 541 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:53:11,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:53:11,767 INFO L93 Difference]: Finished difference Result 769 states and 857 transitions. [2023-12-24 16:53:11,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 16:53:11,768 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 164 [2023-12-24 16:53:11,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:53:11,768 INFO L225 Difference]: With dead ends: 769 [2023-12-24 16:53:11,769 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 16:53:11,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 162 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 16:53:11,770 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 45 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 16:53:11,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 291 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 16:53:11,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 16:53:11,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 16:53:11,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 16:53:11,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 16:53:11,771 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 164 [2023-12-24 16:53:11,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:53:11,771 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 16:53:11,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 16:53:11,771 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 16:53:11,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 16:53:11,773 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 16:53:11,794 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 (40)] Forceful destruction successful, exit code 0 [2023-12-24 16:53:11,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /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 16:53:11,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 16:53:19,152 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-24 16:53:19,152 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-24 16:53:19,152 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-24 16:53:19,153 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-24 16:53:19,153 INFO L895 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: (let ((.cse7 (select (select |#memory_int#8| (_ bv11 32)) (_ bv0 32)))) (let ((.cse1 (= (_ bv0 32) |~#var_1_8~0.offset|)) (.cse5 (select (select |#memory_int#9| ~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset)) (.cse2 (= (_ bv0 32) ~var_1_8_Pointer~0.offset)) (.cse3 (= (_ bv11 32) |~#var_1_8~0.base|)) (.cse4 (= (_ bv11 32) ~var_1_8_Pointer~0.base)) (.cse6 (bvsge .cse7 (_ bv1073741822 32)))) (or (let ((.cse0 ((_ sign_extend 24) (_ bv16 8)))) (and (= ((_ extract 7 0) .cse0) ~last_1_var_1_5~0) .cse1 (= .cse0 (select (select |#memory_int#5| |~#var_1_5~0.base|) |~#var_1_5~0.offset|)) .cse2 .cse3 .cse4 (exists ((|v_ULTIMATE.start_step_#t~mem19#1_40| (_ BitVec 8))) (not (bvslt ((_ sign_extend 24) |v_ULTIMATE.start_step_#t~mem19#1_40|) .cse5))) (= ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#6| ~var_1_6_Pointer~0.base) ~var_1_6_Pointer~0.offset))) ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#5| ~var_1_5_Pointer~0.base) ~var_1_5_Pointer~0.offset)))) .cse6)) (and .cse1 (= (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset) ((_ sign_extend 24) (_ bv14 8))) (= .cse7 .cse5) .cse2 (= ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int#7| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset))) (select (select |#memory_int#10| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset)) .cse3 .cse4 .cse6)))) [2023-12-24 16:53:19,153 INFO L899 garLoopResultBuilder]: For program point L85-1(line 85) no Hoare annotation was computed. [2023-12-24 16:53:19,153 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-24 16:53:19,153 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-24 16:53:19,153 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-24 16:53:19,156 INFO L895 garLoopResultBuilder]: At program point L87(line 87) the Hoare annotation is: (let ((.cse7 (select (select |#memory_int#8| (_ bv11 32)) (_ bv0 32)))) (let ((.cse1 (= (_ bv0 32) |~#var_1_8~0.offset|)) (.cse5 (select (select |#memory_int#9| ~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset)) (.cse2 (= (_ bv0 32) ~var_1_8_Pointer~0.offset)) (.cse3 (= (_ bv11 32) |~#var_1_8~0.base|)) (.cse4 (= (_ bv11 32) ~var_1_8_Pointer~0.base)) (.cse6 (bvsge .cse7 (_ bv1073741822 32)))) (or (let ((.cse0 ((_ sign_extend 24) (_ bv16 8)))) (and (= ((_ extract 7 0) .cse0) ~last_1_var_1_5~0) .cse1 (= .cse0 (select (select |#memory_int#5| |~#var_1_5~0.base|) |~#var_1_5~0.offset|)) .cse2 .cse3 .cse4 (exists ((|v_ULTIMATE.start_step_#t~mem19#1_40| (_ BitVec 8))) (not (bvslt ((_ sign_extend 24) |v_ULTIMATE.start_step_#t~mem19#1_40|) .cse5))) .cse6)) (and .cse1 (= (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset) ((_ sign_extend 24) (_ bv14 8))) (= .cse7 .cse5) .cse2 (= ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int#7| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset))) (select (select |#memory_int#10| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset)) .cse3 .cse4 .cse6)))) [2023-12-24 16:53:19,156 INFO L899 garLoopResultBuilder]: For program point L87-1(line 87) no Hoare annotation was computed. [2023-12-24 16:53:19,156 INFO L899 garLoopResultBuilder]: For program point L54(lines 54 58) no Hoare annotation was computed. [2023-12-24 16:53:19,156 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 16:53:19,156 INFO L899 garLoopResultBuilder]: For program point L71(lines 71 77) no Hoare annotation was computed. [2023-12-24 16:53:19,156 INFO L895 garLoopResultBuilder]: At program point L88(line 88) the Hoare annotation is: (let ((.cse7 (select (select |#memory_int#8| (_ bv11 32)) (_ bv0 32)))) (let ((.cse1 (= (_ bv0 32) |~#var_1_8~0.offset|)) (.cse5 (select (select |#memory_int#9| ~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset)) (.cse2 (= (_ bv0 32) ~var_1_8_Pointer~0.offset)) (.cse3 (= (_ bv11 32) |~#var_1_8~0.base|)) (.cse4 (= (_ bv11 32) ~var_1_8_Pointer~0.base)) (.cse6 (bvsge .cse7 (_ bv1073741822 32)))) (or (let ((.cse0 ((_ sign_extend 24) (_ bv16 8)))) (and (= ((_ extract 7 0) .cse0) ~last_1_var_1_5~0) .cse1 (= .cse0 (select (select |#memory_int#5| |~#var_1_5~0.base|) |~#var_1_5~0.offset|)) .cse2 .cse3 .cse4 (exists ((|v_ULTIMATE.start_step_#t~mem19#1_40| (_ BitVec 8))) (not (bvslt ((_ sign_extend 24) |v_ULTIMATE.start_step_#t~mem19#1_40|) .cse5))) .cse6)) (and .cse1 (= (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset) ((_ sign_extend 24) (_ bv14 8))) (= .cse7 .cse5) .cse2 (= ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int#7| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset))) (select (select |#memory_int#10| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset)) .cse3 .cse4 .cse6)))) [2023-12-24 16:53:19,156 INFO L899 garLoopResultBuilder]: For program point L88-1(line 88) no Hoare annotation was computed. [2023-12-24 16:53:19,156 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 78) no Hoare annotation was computed. [2023-12-24 16:53:19,156 INFO L899 garLoopResultBuilder]: For program point L72(lines 72 76) no Hoare annotation was computed. [2023-12-24 16:53:19,156 INFO L895 garLoopResultBuilder]: At program point L105-2(lines 105 111) the Hoare annotation is: (let ((.cse1 (= (_ bv0 32) |~#var_1_8~0.offset|)) (.cse2 (= (_ bv0 32) ~var_1_8_Pointer~0.offset)) (.cse5 (select (select |#memory_int#9| ~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset)) (.cse3 (= (_ bv11 32) |~#var_1_8~0.base|)) (.cse4 (= (_ bv11 32) ~var_1_8_Pointer~0.base)) (.cse6 (bvsge (select (select |#memory_int#8| (_ bv11 32)) (_ bv0 32)) (_ bv1073741822 32)))) (or (let ((.cse0 ((_ sign_extend 24) (_ bv16 8)))) (and (= ((_ extract 7 0) .cse0) ~last_1_var_1_5~0) .cse1 (not (= ((_ extract 7 0) (select (select |#memory_int#3| ~var_1_3_Pointer~0.base) ~var_1_3_Pointer~0.offset)) (_ bv0 8))) (= .cse0 (select (select |#memory_int#5| |~#var_1_5~0.base|) |~#var_1_5~0.offset|)) .cse2 (bvslt ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#4| ~var_1_4_Pointer~0.base) ~var_1_4_Pointer~0.offset))) (_ bv0 32)) .cse3 .cse4 (exists ((|v_ULTIMATE.start_step_#t~mem19#1_40| (_ BitVec 8))) (not (bvslt ((_ sign_extend 24) |v_ULTIMATE.start_step_#t~mem19#1_40|) .cse5))) (= ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#6| ~var_1_6_Pointer~0.base) ~var_1_6_Pointer~0.offset))) ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#5| ~var_1_5_Pointer~0.base) ~var_1_5_Pointer~0.offset)))) .cse6)) (and .cse1 (= (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset) ((_ sign_extend 24) (_ bv14 8))) .cse2 (= ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int#7| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset))) (select (select |#memory_int#10| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset)) (= .cse5 (select (select |#memory_int#8| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset)) .cse3 .cse4 .cse6))) [2023-12-24 16:53:19,157 INFO L899 garLoopResultBuilder]: For program point L105-3(lines 105 111) no Hoare annotation was computed. [2023-12-24 16:53:19,157 INFO L895 garLoopResultBuilder]: At program point L81(line 81) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) |~#var_1_8~0.offset|)) (.cse1 (= (_ bv0 32) ~var_1_8_Pointer~0.offset)) (.cse3 (= (_ bv11 32) |~#var_1_8~0.base|)) (.cse4 (= (_ bv11 32) ~var_1_8_Pointer~0.base)) (.cse2 (select (select |#memory_int#9| ~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset)) (.cse5 (bvsge (select (select |#memory_int#8| (_ bv11 32)) (_ bv0 32)) (_ bv1073741822 32)))) (or (and .cse0 (= (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset) ((_ sign_extend 24) (_ bv14 8))) .cse1 (= ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int#7| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset))) (select (select |#memory_int#10| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset)) (= .cse2 (select (select |#memory_int#8| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset)) .cse3 .cse4 .cse5) (let ((.cse6 ((_ sign_extend 24) (_ bv16 8)))) (and (= ((_ extract 7 0) .cse6) ~last_1_var_1_5~0) .cse0 (= .cse6 (select (select |#memory_int#5| |~#var_1_5~0.base|) |~#var_1_5~0.offset|)) .cse1 (bvslt ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#4| ~var_1_4_Pointer~0.base) ~var_1_4_Pointer~0.offset))) (_ bv0 32)) .cse3 .cse4 (exists ((|v_ULTIMATE.start_step_#t~mem19#1_40| (_ BitVec 8))) (not (bvslt ((_ sign_extend 24) |v_ULTIMATE.start_step_#t~mem19#1_40|) .cse2))) (= ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#6| ~var_1_6_Pointer~0.base) ~var_1_6_Pointer~0.offset))) ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#5| ~var_1_5_Pointer~0.base) ~var_1_5_Pointer~0.offset)))) .cse5)))) [2023-12-24 16:53:19,157 INFO L899 garLoopResultBuilder]: For program point L81-1(line 81) no Hoare annotation was computed. [2023-12-24 16:53:19,157 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 75) no Hoare annotation was computed. [2023-12-24 16:53:19,157 INFO L899 garLoopResultBuilder]: For program point L65(lines 65 69) no Hoare annotation was computed. [2023-12-24 16:53:19,157 INFO L899 garLoopResultBuilder]: For program point L65-2(lines 65 69) no Hoare annotation was computed. [2023-12-24 16:53:19,157 INFO L895 garLoopResultBuilder]: At program point L90(line 90) the Hoare annotation is: (and (= (_ bv0 32) |~#var_1_8~0.offset|) (= (_ bv0 32) ~var_1_8_Pointer~0.offset) (= (_ bv11 32) |~#var_1_8~0.base|) (= (_ bv11 32) ~var_1_8_Pointer~0.base) (= (select (select |#memory_int#8| (_ bv11 32)) (_ bv0 32)) |ULTIMATE.start_updateVariables_#t~mem35#1|)) [2023-12-24 16:53:19,157 INFO L899 garLoopResultBuilder]: For program point L90-1(line 90) no Hoare annotation was computed. [2023-12-24 16:53:19,157 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-24 16:53:19,157 INFO L895 garLoopResultBuilder]: At program point L82(line 82) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) |~#var_1_8~0.offset|)) (.cse1 (= (_ bv0 32) ~var_1_8_Pointer~0.offset)) (.cse3 (= (_ bv11 32) |~#var_1_8~0.base|)) (.cse4 (= (_ bv11 32) ~var_1_8_Pointer~0.base)) (.cse2 (select (select |#memory_int#9| ~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset)) (.cse5 (bvsge (select (select |#memory_int#8| (_ bv11 32)) (_ bv0 32)) (_ bv1073741822 32)))) (or (and .cse0 (= (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset) ((_ sign_extend 24) (_ bv14 8))) .cse1 (= ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int#7| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset))) (select (select |#memory_int#10| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset)) (= .cse2 (select (select |#memory_int#8| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset)) .cse3 .cse4 .cse5) (let ((.cse6 ((_ sign_extend 24) (_ bv16 8)))) (and (= ((_ extract 7 0) .cse6) ~last_1_var_1_5~0) .cse0 (= .cse6 (select (select |#memory_int#5| |~#var_1_5~0.base|) |~#var_1_5~0.offset|)) .cse1 (bvslt ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#4| ~var_1_4_Pointer~0.base) ~var_1_4_Pointer~0.offset))) (_ bv0 32)) .cse3 .cse4 (exists ((|v_ULTIMATE.start_step_#t~mem19#1_40| (_ BitVec 8))) (not (bvslt ((_ sign_extend 24) |v_ULTIMATE.start_step_#t~mem19#1_40|) .cse2))) (= ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#6| ~var_1_6_Pointer~0.base) ~var_1_6_Pointer~0.offset))) ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#5| ~var_1_5_Pointer~0.base) ~var_1_5_Pointer~0.offset)))) .cse5)))) [2023-12-24 16:53:19,157 INFO L899 garLoopResultBuilder]: For program point L82-1(line 82) no Hoare annotation was computed. [2023-12-24 16:53:19,157 INFO L899 garLoopResultBuilder]: For program point L99(line 99) no Hoare annotation was computed. [2023-12-24 16:53:19,157 INFO L899 garLoopResultBuilder]: For program point L99-1(line 99) no Hoare annotation was computed. [2023-12-24 16:53:19,157 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 16:53:19,157 INFO L899 garLoopResultBuilder]: For program point L99-3(line 99) no Hoare annotation was computed. [2023-12-24 16:53:19,158 INFO L899 garLoopResultBuilder]: For program point L99-5(line 99) no Hoare annotation was computed. [2023-12-24 16:53:19,158 INFO L899 garLoopResultBuilder]: For program point L99-6(line 99) no Hoare annotation was computed. [2023-12-24 16:53:19,158 INFO L895 garLoopResultBuilder]: At program point L91(line 91) the Hoare annotation is: (and (= (_ bv0 32) |~#var_1_8~0.offset|) (= (_ bv0 32) ~var_1_8_Pointer~0.offset) (= (_ bv11 32) |~#var_1_8~0.base|) (= (_ bv11 32) ~var_1_8_Pointer~0.base) (bvsge (select (select |#memory_int#8| (_ bv11 32)) (_ bv0 32)) (_ bv1073741822 32))) [2023-12-24 16:53:19,158 INFO L899 garLoopResultBuilder]: For program point L99-8(line 99) no Hoare annotation was computed. [2023-12-24 16:53:19,158 INFO L899 garLoopResultBuilder]: For program point L91-1(line 91) no Hoare annotation was computed. [2023-12-24 16:53:19,158 INFO L899 garLoopResultBuilder]: For program point L99-9(line 99) no Hoare annotation was computed. [2023-12-24 16:53:19,158 INFO L899 garLoopResultBuilder]: For program point L99-10(line 99) no Hoare annotation was computed. [2023-12-24 16:53:19,158 INFO L899 garLoopResultBuilder]: For program point L99-11(line 99) no Hoare annotation was computed. [2023-12-24 16:53:19,158 INFO L899 garLoopResultBuilder]: For program point L99-12(line 99) no Hoare annotation was computed. [2023-12-24 16:53:19,158 INFO L899 garLoopResultBuilder]: For program point L99-14(line 99) no Hoare annotation was computed. [2023-12-24 16:53:19,158 INFO L899 garLoopResultBuilder]: For program point L99-16(line 99) no Hoare annotation was computed. [2023-12-24 16:53:19,158 INFO L899 garLoopResultBuilder]: For program point L50(lines 50 62) no Hoare annotation was computed. [2023-12-24 16:53:19,158 INFO L899 garLoopResultBuilder]: For program point L50-1(lines 50 62) no Hoare annotation was computed. [2023-12-24 16:53:19,158 INFO L899 garLoopResultBuilder]: For program point L99-18(line 99) no Hoare annotation was computed. [2023-12-24 16:53:19,158 INFO L899 garLoopResultBuilder]: For program point L99-20(line 99) no Hoare annotation was computed. [2023-12-24 16:53:19,158 INFO L899 garLoopResultBuilder]: For program point L99-21(line 99) no Hoare annotation was computed. [2023-12-24 16:53:19,158 INFO L899 garLoopResultBuilder]: For program point L99-22(line 99) no Hoare annotation was computed. [2023-12-24 16:53:19,158 INFO L899 garLoopResultBuilder]: For program point L99-23(line 99) no Hoare annotation was computed. [2023-12-24 16:53:19,158 INFO L899 garLoopResultBuilder]: For program point L99-25(line 99) no Hoare annotation was computed. [2023-12-24 16:53:19,158 INFO L899 garLoopResultBuilder]: For program point L99-27(line 99) no Hoare annotation was computed. [2023-12-24 16:53:19,158 INFO L899 garLoopResultBuilder]: For program point L99-28(line 99) no Hoare annotation was computed. [2023-12-24 16:53:19,158 INFO L899 garLoopResultBuilder]: For program point L99-30(line 99) no Hoare annotation was computed. [2023-12-24 16:53:19,158 INFO L899 garLoopResultBuilder]: For program point L99-32(line 99) no Hoare annotation was computed. [2023-12-24 16:53:19,158 INFO L899 garLoopResultBuilder]: For program point L99-33(line 99) no Hoare annotation was computed. [2023-12-24 16:53:19,158 INFO L899 garLoopResultBuilder]: For program point L99-35(line 99) no Hoare annotation was computed. [2023-12-24 16:53:19,159 INFO L899 garLoopResultBuilder]: For program point L99-36(line 99) no Hoare annotation was computed. [2023-12-24 16:53:19,159 INFO L899 garLoopResultBuilder]: For program point L99-38(line 99) no Hoare annotation was computed. [2023-12-24 16:53:19,159 INFO L895 garLoopResultBuilder]: At program point L84(line 84) the Hoare annotation is: (let ((.cse7 (select (select |#memory_int#8| (_ bv11 32)) (_ bv0 32)))) (let ((.cse1 (= (_ bv0 32) |~#var_1_8~0.offset|)) (.cse5 (select (select |#memory_int#9| ~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset)) (.cse2 (= (_ bv0 32) ~var_1_8_Pointer~0.offset)) (.cse3 (= (_ bv11 32) |~#var_1_8~0.base|)) (.cse4 (= (_ bv11 32) ~var_1_8_Pointer~0.base)) (.cse6 (bvsge .cse7 (_ bv1073741822 32)))) (or (let ((.cse0 ((_ sign_extend 24) (_ bv16 8)))) (and (= ((_ extract 7 0) .cse0) ~last_1_var_1_5~0) .cse1 (= .cse0 (select (select |#memory_int#5| |~#var_1_5~0.base|) |~#var_1_5~0.offset|)) .cse2 .cse3 .cse4 (exists ((|v_ULTIMATE.start_step_#t~mem19#1_40| (_ BitVec 8))) (not (bvslt ((_ sign_extend 24) |v_ULTIMATE.start_step_#t~mem19#1_40|) .cse5))) (= ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#6| ~var_1_6_Pointer~0.base) ~var_1_6_Pointer~0.offset))) ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#5| ~var_1_5_Pointer~0.base) ~var_1_5_Pointer~0.offset)))) .cse6)) (and .cse1 (= (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset) ((_ sign_extend 24) (_ bv14 8))) (= .cse7 .cse5) .cse2 (= ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int#7| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset))) (select (select |#memory_int#10| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset)) .cse3 .cse4 .cse6)))) [2023-12-24 16:53:19,159 INFO L899 garLoopResultBuilder]: For program point L84-1(line 84) no Hoare annotation was computed. [2023-12-24 16:53:19,159 INFO L899 garLoopResultBuilder]: For program point L51(lines 51 59) no Hoare annotation was computed. [2023-12-24 16:53:19,159 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2023-12-24 16:53:19,159 INFO L899 garLoopResultBuilder]: For program point L68-2(line 68) no Hoare annotation was computed. [2023-12-24 16:53:19,161 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 16:53:19,163 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 16:53:19,172 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~var_1_3_Pointer~0!base][~var_1_3_Pointer~0!offset] could not be translated [2023-12-24 16:53:19,173 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#var_1_5~0!base][~#var_1_5~0!offset] could not be translated [2023-12-24 16:53:19,173 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_4_Pointer~0!base][~var_1_4_Pointer~0!offset] could not be translated [2023-12-24 16:53:19,173 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_step_#t~mem19#1_40 : bv8 :: !~bvslt~32(~sign_extend~32~16(v_ULTIMATE.start_step_#t~mem19#1_40), #memory_int#9[~var_1_9_Pointer~0!base][~var_1_9_Pointer~0!offset])) could not be translated [2023-12-24 16:53:19,173 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#6[~var_1_6_Pointer~0!base][~var_1_6_Pointer~0!offset] could not be translated [2023-12-24 16:53:19,173 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~var_1_5_Pointer~0!base][~var_1_5_Pointer~0!offset] could not be translated [2023-12-24 16:53:19,173 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#8[11bv32][0bv32] could not be translated [2023-12-24 16:53:19,173 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~var_1_1_Pointer~0!base][~var_1_1_Pointer~0!offset] could not be translated [2023-12-24 16:53:19,173 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#7[~var_1_7_Pointer~0!base][~var_1_7_Pointer~0!offset] could not be translated [2023-12-24 16:53:19,173 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#10[~var_1_10_Pointer~0!base][~var_1_10_Pointer~0!offset] could not be translated [2023-12-24 16:53:19,173 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#9[~var_1_9_Pointer~0!base][~var_1_9_Pointer~0!offset] could not be translated [2023-12-24 16:53:19,173 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#8[~var_1_8_Pointer~0!base][~var_1_8_Pointer~0!offset] could not be translated [2023-12-24 16:53:19,174 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#8[11bv32][0bv32] could not be translated [2023-12-24 16:53:19,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 04:53:19 BoogieIcfgContainer [2023-12-24 16:53:19,174 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 16:53:19,174 INFO L158 Benchmark]: Toolchain (without parser) took 41593.60ms. Allocated memory was 192.9MB in the beginning and 784.3MB in the end (delta: 591.4MB). Free memory was 140.6MB in the beginning and 554.5MB in the end (delta: -414.0MB). Peak memory consumption was 468.3MB. Max. memory is 8.0GB. [2023-12-24 16:53:19,174 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 192.9MB. Free memory is still 139.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 16:53:19,175 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.58ms. Allocated memory is still 192.9MB. Free memory was 140.6MB in the beginning and 126.1MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-24 16:53:19,175 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.78ms. Allocated memory is still 192.9MB. Free memory was 126.1MB in the beginning and 123.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 16:53:19,175 INFO L158 Benchmark]: Boogie Preprocessor took 47.37ms. Allocated memory is still 192.9MB. Free memory was 123.6MB in the beginning and 118.7MB in the end (delta: 4.9MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-24 16:53:19,175 INFO L158 Benchmark]: RCFGBuilder took 577.33ms. Allocated memory was 192.9MB in the beginning and 377.5MB in the end (delta: 184.5MB). Free memory was 118.7MB in the beginning and 324.3MB in the end (delta: -205.6MB). Peak memory consumption was 27.4MB. Max. memory is 8.0GB. [2023-12-24 16:53:19,175 INFO L158 Benchmark]: TraceAbstraction took 40653.36ms. Allocated memory was 377.5MB in the beginning and 784.3MB in the end (delta: 406.8MB). Free memory was 323.8MB in the beginning and 554.5MB in the end (delta: -230.7MB). Peak memory consumption was 466.1MB. Max. memory is 8.0GB. [2023-12-24 16:53:19,175 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.42ms. Allocated memory is still 192.9MB. Free memory is still 139.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 266.58ms. Allocated memory is still 192.9MB. Free memory was 140.6MB in the beginning and 126.1MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.78ms. Allocated memory is still 192.9MB. Free memory was 126.1MB in the beginning and 123.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.37ms. Allocated memory is still 192.9MB. Free memory was 123.6MB in the beginning and 118.7MB in the end (delta: 4.9MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 577.33ms. Allocated memory was 192.9MB in the beginning and 377.5MB in the end (delta: 184.5MB). Free memory was 118.7MB in the beginning and 324.3MB in the end (delta: -205.6MB). Peak memory consumption was 27.4MB. Max. memory is 8.0GB. * TraceAbstraction took 40653.36ms. Allocated memory was 377.5MB in the beginning and 784.3MB in the end (delta: 406.8MB). Free memory was 323.8MB in the beginning and 554.5MB in the end (delta: -230.7MB). Peak memory consumption was 466.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~var_1_3_Pointer~0!base][~var_1_3_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#var_1_5~0!base][~#var_1_5~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_4_Pointer~0!base][~var_1_4_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_step_#t~mem19#1_40 : bv8 :: !~bvslt~32(~sign_extend~32~16(v_ULTIMATE.start_step_#t~mem19#1_40), #memory_int#9[~var_1_9_Pointer~0!base][~var_1_9_Pointer~0!offset])) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#6[~var_1_6_Pointer~0!base][~var_1_6_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~var_1_5_Pointer~0!base][~var_1_5_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#8[11bv32][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~var_1_1_Pointer~0!base][~var_1_1_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#7[~var_1_7_Pointer~0!base][~var_1_7_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#10[~var_1_10_Pointer~0!base][~var_1_10_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#9[~var_1_9_Pointer~0!base][~var_1_9_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#8[~var_1_8_Pointer~0!base][~var_1_8_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#8[11bv32][0bv32] could not be translated * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 40.6s, OverallIterations: 33, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 7.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3809 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3809 mSDsluCounter, 14086 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10764 mSDsCounter, 248 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4014 IncrementalHoareTripleChecker+Invalid, 4262 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 248 mSolverCounterUnsat, 3322 mSDtfsCounter, 4014 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4813 GetRequests, 4366 SyntacticMatches, 2 SemanticMatches, 445 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1582 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=613occurred in iteration=30, InterpolantAutomatonStates: 289, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 33 MinimizatonAttempts, 1567 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 429 PreInvPairs, 466 NumberOfFragments, 824 HoareAnnotationTreeSize, 429 FormulaSimplifications, 3138853 FormulaSimplificationTreeSizeReduction, 4.6s HoareSimplificationTime, 10 FormulaSimplificationsInter, 94042 FormulaSimplificationTreeSizeReductionInter, 2.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.1s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 10.5s InterpolantComputationTime, 3461 NumberOfCodeBlocks, 3461 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 4427 ConstructedInterpolants, 42 QuantifiedInterpolants, 22599 SizeOfPredicates, 379 NumberOfNonLiveVariables, 9910 ConjunctsInSsa, 385 ConjunctsInUnsatCore, 50 InterpolantComputations, 30 PerfectInterpolantSequences, 7339/8912 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2023-12-24 16:53:19,200 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...