/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-a_file-62.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 13:42:07,697 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 13:42:07,778 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 13:42:07,782 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 13:42:07,782 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 13:42:07,815 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 13:42:07,816 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 13:42:07,816 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 13:42:07,816 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 13:42:07,820 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 13:42:07,820 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 13:42:07,821 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 13:42:07,821 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 13:42:07,822 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 13:42:07,822 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 13:42:07,823 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 13:42:07,823 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 13:42:07,823 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 13:42:07,824 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 13:42:07,824 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 13:42:07,824 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 13:42:07,825 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 13:42:07,826 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 13:42:07,826 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 13:42:07,826 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 13:42:07,826 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 13:42:07,826 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 13:42:07,827 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 13:42:07,827 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 13:42:07,827 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 13:42:07,828 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 13:42:07,828 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 13:42:07,828 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 13:42:07,829 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 13:42:07,829 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 13:42:07,829 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 13:42:07,829 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 13:42:07,829 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 13:42:07,830 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 13:42:07,830 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 13:42:07,830 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 13:42:07,830 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 13:42:07,830 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 13:42:07,830 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 13:42:07,831 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 13:42:07,831 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 13:42:07,831 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 13:42:08,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 13:42:08,060 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 13:42:08,062 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 13:42:08,063 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 13:42:08,064 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 13:42:08,065 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-62.i [2023-12-24 13:42:09,186 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 13:42:09,371 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 13:42:09,371 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-62.i [2023-12-24 13:42:09,378 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29a529cee/6a6f8deed40d4cfb89915635389c218b/FLAGca5827b1e [2023-12-24 13:42:09,391 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29a529cee/6a6f8deed40d4cfb89915635389c218b [2023-12-24 13:42:09,393 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 13:42:09,394 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 13:42:09,396 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 13:42:09,396 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 13:42:09,401 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 13:42:09,401 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 01:42:09" (1/1) ... [2023-12-24 13:42:09,402 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ce621d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:42:09, skipping insertion in model container [2023-12-24 13:42:09,402 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 01:42:09" (1/1) ... [2023-12-24 13:42:09,420 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 13:42:09,526 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-62.i[916,929] [2023-12-24 13:42:09,565 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 13:42:09,583 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 13:42:09,592 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-a_file-62.i[916,929] [2023-12-24 13:42:09,620 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 13:42:09,635 INFO L206 MainTranslator]: Completed translation [2023-12-24 13:42:09,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:42:09 WrapperNode [2023-12-24 13:42:09,636 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 13:42:09,637 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 13:42:09,637 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 13:42:09,637 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 13:42:09,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:42:09" (1/1) ... [2023-12-24 13:42:09,652 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:42:09" (1/1) ... [2023-12-24 13:42:09,680 INFO L138 Inliner]: procedures = 33, calls = 111, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 328 [2023-12-24 13:42:09,681 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 13:42:09,681 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 13:42:09,682 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 13:42:09,682 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 13:42:09,695 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:42:09" (1/1) ... [2023-12-24 13:42:09,695 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:42:09" (1/1) ... [2023-12-24 13:42:09,701 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:42:09" (1/1) ... [2023-12-24 13:42:09,725 INFO L175 MemorySlicer]: Split 87 memory accesses to 6 slices as follows [2, 10, 29, 26, 4, 16]. 33 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 3, 3, 1, 2]. The 14 writes are split as follows [0, 1, 4, 6, 1, 2]. [2023-12-24 13:42:09,725 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:42:09" (1/1) ... [2023-12-24 13:42:09,726 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:42:09" (1/1) ... [2023-12-24 13:42:09,741 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:42:09" (1/1) ... [2023-12-24 13:42:09,744 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:42:09" (1/1) ... [2023-12-24 13:42:09,747 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:42:09" (1/1) ... [2023-12-24 13:42:09,748 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:42:09" (1/1) ... [2023-12-24 13:42:09,754 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 13:42:09,754 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 13:42:09,755 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 13:42:09,755 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 13:42:09,755 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:42:09" (1/1) ... [2023-12-24 13:42:09,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 13:42:09,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 13:42:09,790 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 13:42:09,793 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 13:42:09,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 13:42:09,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-12-24 13:42:09,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-12-24 13:42:09,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-12-24 13:42:09,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-12-24 13:42:09,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2023-12-24 13:42:09,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2023-12-24 13:42:09,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2023-12-24 13:42:09,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2023-12-24 13:42:09,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2023-12-24 13:42:09,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2023-12-24 13:42:09,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2023-12-24 13:42:09,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2023-12-24 13:42:09,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 13:42:09,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 13:42:09,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-24 13:42:09,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-24 13:42:09,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-12-24 13:42:09,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2023-12-24 13:42:09,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2023-12-24 13:42:09,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2023-12-24 13:42:09,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2023-12-24 13:42:09,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2023-12-24 13:42:09,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2023-12-24 13:42:09,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2023-12-24 13:42:09,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-24 13:42:09,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-24 13:42:09,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-24 13:42:09,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-12-24 13:42:09,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2023-12-24 13:42:09,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2023-12-24 13:42:09,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2023-12-24 13:42:09,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2023-12-24 13:42:09,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2023-12-24 13:42:09,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2023-12-24 13:42:09,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2023-12-24 13:42:09,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2023-12-24 13:42:09,816 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 13:42:09,816 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 13:42:09,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 13:42:09,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 13:42:09,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-12-24 13:42:09,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-12-24 13:42:09,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2023-12-24 13:42:09,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2023-12-24 13:42:09,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2023-12-24 13:42:09,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2023-12-24 13:42:09,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2023-12-24 13:42:09,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2023-12-24 13:42:09,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2023-12-24 13:42:09,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2023-12-24 13:42:09,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2023-12-24 13:42:09,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2023-12-24 13:42:09,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-24 13:42:09,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-24 13:42:09,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-24 13:42:09,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-12-24 13:42:09,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-12-24 13:42:09,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2023-12-24 13:42:09,959 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 13:42:09,961 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 13:42:10,272 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 13:42:10,303 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 13:42:10,303 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 13:42:10,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 01:42:10 BoogieIcfgContainer [2023-12-24 13:42:10,303 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 13:42:10,305 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 13:42:10,305 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 13:42:10,308 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 13:42:10,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 01:42:09" (1/3) ... [2023-12-24 13:42:10,308 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59ba32cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 01:42:10, skipping insertion in model container [2023-12-24 13:42:10,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:42:09" (2/3) ... [2023-12-24 13:42:10,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59ba32cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 01:42:10, skipping insertion in model container [2023-12-24 13:42:10,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 01:42:10" (3/3) ... [2023-12-24 13:42:10,310 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-62.i [2023-12-24 13:42:10,323 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 13:42:10,323 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 13:42:10,357 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 13:42:10,363 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;@37a18953, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 13:42:10,363 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 13:42:10,366 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 13:42:10,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-24 13:42:10,374 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:42:10,375 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 13:42:10,375 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:42:10,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:42:10,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1944691701, now seen corresponding path program 1 times [2023-12-24 13:42:10,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:42:10,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [588098371] [2023-12-24 13:42:10,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:42:10,394 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 13:42:10,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:42:10,396 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 13:42:10,400 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 13:42:10,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:42:10,605 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 13:42:10,609 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:42:10,633 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 13:42:10,633 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:42:10,634 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:42:10,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [588098371] [2023-12-24 13:42:10,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [588098371] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:42:10,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:42:10,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 13:42:10,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386372701] [2023-12-24 13:42:10,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:42:10,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 13:42:10,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:42:10,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 13:42:10,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 13:42:10,689 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 13:42:10,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:42:10,737 INFO L93 Difference]: Finished difference Result 129 states and 200 transitions. [2023-12-24 13:42:10,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 13:42:10,740 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 13:42:10,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:42:10,748 INFO L225 Difference]: With dead ends: 129 [2023-12-24 13:42:10,748 INFO L226 Difference]: Without dead ends: 64 [2023-12-24 13:42:10,752 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 13:42:10,757 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 13:42:10,758 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 13:42:10,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-12-24 13:42:10,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-12-24 13:42:10,786 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 13:42:10,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 92 transitions. [2023-12-24 13:42:10,789 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 92 transitions. Word has length 68 [2023-12-24 13:42:10,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:42:10,789 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 92 transitions. [2023-12-24 13:42:10,789 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 13:42:10,789 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 92 transitions. [2023-12-24 13:42:10,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-24 13:42:10,792 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:42:10,792 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 13:42:10,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-24 13:42:10,996 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 13:42:10,997 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:42:10,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:42:10,997 INFO L85 PathProgramCache]: Analyzing trace with hash -2005151749, now seen corresponding path program 1 times [2023-12-24 13:42:10,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:42:10,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [565119299] [2023-12-24 13:42:10,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:42:10,998 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 13:42:10,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:42:11,000 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 13:42:11,005 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 13:42:11,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:42:11,156 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 13:42:11,159 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:42:11,224 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 13:42:11,225 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:42:11,225 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:42:11,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [565119299] [2023-12-24 13:42:11,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [565119299] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:42:11,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:42:11,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 13:42:11,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185873313] [2023-12-24 13:42:11,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:42:11,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 13:42:11,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:42:11,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 13:42:11,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-24 13:42:11,228 INFO L87 Difference]: Start difference. First operand 64 states and 92 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 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 13:42:11,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:42:11,384 INFO L93 Difference]: Finished difference Result 151 states and 217 transitions. [2023-12-24 13:42:11,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 13:42:11,385 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 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 13:42:11,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:42:11,391 INFO L225 Difference]: With dead ends: 151 [2023-12-24 13:42:11,391 INFO L226 Difference]: Without dead ends: 88 [2023-12-24 13:42:11,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-12-24 13:42:11,393 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 53 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 13:42:11,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 399 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 13:42:11,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-12-24 13:42:11,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 70. [2023-12-24 13:42:11,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 60 states have (on average 1.3666666666666667) internal successors, (82), 60 states have internal predecessors, (82), 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 13:42:11,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 98 transitions. [2023-12-24 13:42:11,415 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 98 transitions. Word has length 68 [2023-12-24 13:42:11,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:42:11,419 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 98 transitions. [2023-12-24 13:42:11,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 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 13:42:11,419 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2023-12-24 13:42:11,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-24 13:42:11,424 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:42:11,424 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 13:42:11,435 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 13:42:11,625 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 13:42:11,625 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:42:11,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:42:11,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1947893447, now seen corresponding path program 1 times [2023-12-24 13:42:11,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:42:11,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [521289903] [2023-12-24 13:42:11,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:42:11,627 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 13:42:11,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:42:11,628 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 13:42:11,643 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 13:42:11,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:42:11,753 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 13:42:11,757 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:42:11,799 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 13:42:11,799 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:42:11,800 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:42:11,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [521289903] [2023-12-24 13:42:11,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [521289903] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:42:11,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:42:11,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-24 13:42:11,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608288789] [2023-12-24 13:42:11,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:42:11,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 13:42:11,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:42:11,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 13:42:11,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-24 13:42:11,806 INFO L87 Difference]: Start difference. First operand 70 states and 98 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 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 13:42:11,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:42:11,979 INFO L93 Difference]: Finished difference Result 158 states and 218 transitions. [2023-12-24 13:42:11,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-24 13:42:11,980 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 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 13:42:11,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:42:11,981 INFO L225 Difference]: With dead ends: 158 [2023-12-24 13:42:11,981 INFO L226 Difference]: Without dead ends: 89 [2023-12-24 13:42:11,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2023-12-24 13:42:11,983 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 43 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 13:42:11,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 472 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 13:42:11,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-24 13:42:11,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 72. [2023-12-24 13:42:11,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 62 states have (on average 1.3548387096774193) internal successors, (84), 62 states have internal predecessors, (84), 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 13:42:11,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 100 transitions. [2023-12-24 13:42:11,990 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 100 transitions. Word has length 68 [2023-12-24 13:42:11,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:42:11,990 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 100 transitions. [2023-12-24 13:42:11,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 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 13:42:11,990 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 100 transitions. [2023-12-24 13:42:11,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-24 13:42:11,991 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:42:11,992 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 13:42:11,999 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 (4)] Forceful destruction successful, exit code 0 [2023-12-24 13:42:12,196 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 13:42:12,196 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:42:12,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:42:12,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1947833865, now seen corresponding path program 1 times [2023-12-24 13:42:12,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:42:12,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [922726542] [2023-12-24 13:42:12,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:42:12,199 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 13:42:12,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:42:12,200 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 13:42:12,202 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 13:42:12,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:42:12,359 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 13:42:12,362 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:42:12,396 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 14 treesize of output 10 [2023-12-24 13:42:12,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2023-12-24 13:42:12,449 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 40 treesize of output 22 [2023-12-24 13:42:12,463 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 13:42:12,463 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:42:12,463 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:42:12,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [922726542] [2023-12-24 13:42:12,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [922726542] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:42:12,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:42:12,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 13:42:12,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039876646] [2023-12-24 13:42:12,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:42:12,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 13:42:12,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:42:12,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 13:42:12,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 13:42:12,471 INFO L87 Difference]: Start difference. First operand 72 states and 100 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 13:42:12,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:42:12,565 INFO L93 Difference]: Finished difference Result 166 states and 232 transitions. [2023-12-24 13:42:12,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 13:42:12,566 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 13:42:12,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:42:12,567 INFO L225 Difference]: With dead ends: 166 [2023-12-24 13:42:12,567 INFO L226 Difference]: Without dead ends: 95 [2023-12-24 13:42:12,567 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 13:42:12,568 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 90 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 13:42:12,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 224 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 13:42:12,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-12-24 13:42:12,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 70. [2023-12-24 13:42:12,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 60 states have (on average 1.35) internal successors, (81), 60 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 13:42:12,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 97 transitions. [2023-12-24 13:42:12,574 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 97 transitions. Word has length 68 [2023-12-24 13:42:12,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:42:12,575 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 97 transitions. [2023-12-24 13:42:12,575 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 13:42:12,575 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 97 transitions. [2023-12-24 13:42:12,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-24 13:42:12,576 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:42:12,576 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 13:42:12,587 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 13:42:12,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:42:12,780 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:42:12,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:42:12,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1661631908, now seen corresponding path program 1 times [2023-12-24 13:42:12,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:42:12,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1490665958] [2023-12-24 13:42:12,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:42:12,781 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 13:42:12,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:42:12,782 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:42:12,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-24 13:42:12,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:42:12,895 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 13:42:12,899 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:42:12,905 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 14 treesize of output 10 [2023-12-24 13:42:12,935 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 43 treesize of output 25 [2023-12-24 13:42:12,955 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 13:42:12,955 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:42:12,955 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:42:12,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1490665958] [2023-12-24 13:42:12,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1490665958] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:42:12,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:42:12,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 13:42:12,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733427714] [2023-12-24 13:42:12,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:42:12,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 13:42:12,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:42:12,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 13:42:12,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-24 13:42:12,957 INFO L87 Difference]: Start difference. First operand 70 states and 97 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 13:42:13,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:42:13,165 INFO L93 Difference]: Finished difference Result 234 states and 325 transitions. [2023-12-24 13:42:13,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 13:42:13,166 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 13:42:13,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:42:13,167 INFO L225 Difference]: With dead ends: 234 [2023-12-24 13:42:13,167 INFO L226 Difference]: Without dead ends: 165 [2023-12-24 13:42:13,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-12-24 13:42:13,169 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 199 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 13:42:13,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 554 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 13:42:13,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-12-24 13:42:13,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 80. [2023-12-24 13:42:13,175 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 13:42:13,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 111 transitions. [2023-12-24 13:42:13,176 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 111 transitions. Word has length 70 [2023-12-24 13:42:13,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:42:13,176 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 111 transitions. [2023-12-24 13:42:13,176 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 13:42:13,176 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 111 transitions. [2023-12-24 13:42:13,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-24 13:42:13,177 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:42:13,177 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 13:42:13,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 (6)] Ended with exit code 0 [2023-12-24 13:42:13,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:42:13,382 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:42:13,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:42:13,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1362359734, now seen corresponding path program 1 times [2023-12-24 13:42:13,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:42:13,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1840811886] [2023-12-24 13:42:13,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:42:13,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 13:42:13,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:42:13,384 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 13:42:13,384 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 13:42:13,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:42:13,497 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 13:42:13,500 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:42:13,647 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 33 proven. 18 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-12-24 13:42:13,648 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:42:13,738 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 13:42:13,738 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:42:13,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1840811886] [2023-12-24 13:42:13,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1840811886] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 13:42:13,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 13:42:13,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2023-12-24 13:42:13,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539478060] [2023-12-24 13:42:13,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:42:13,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 13:42:13,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:42:13,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 13:42:13,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-12-24 13:42:13,740 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 13:42:13,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:42:13,822 INFO L93 Difference]: Finished difference Result 217 states and 299 transitions. [2023-12-24 13:42:13,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 13:42:13,823 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 13:42:13,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:42:13,824 INFO L225 Difference]: With dead ends: 217 [2023-12-24 13:42:13,824 INFO L226 Difference]: Without dead ends: 138 [2023-12-24 13:42:13,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-12-24 13:42:13,825 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 81 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 13:42:13,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 450 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 13:42:13,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-12-24 13:42:13,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 80. [2023-12-24 13:42:13,830 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 13:42:13,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 110 transitions. [2023-12-24 13:42:13,831 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 110 transitions. Word has length 72 [2023-12-24 13:42:13,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:42:13,831 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 110 transitions. [2023-12-24 13:42:13,831 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 13:42:13,831 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 110 transitions. [2023-12-24 13:42:13,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-24 13:42:13,832 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:42:13,832 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 13:42:13,839 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 13:42:14,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:42:14,033 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:42:14,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:42:14,033 INFO L85 PathProgramCache]: Analyzing trace with hash -686157583, now seen corresponding path program 1 times [2023-12-24 13:42:14,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:42:14,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [147920629] [2023-12-24 13:42:14,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:42:14,034 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 13:42:14,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:42:14,035 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:42:14,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-24 13:42:14,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:42:14,166 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 13:42:14,168 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:42:14,194 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 13:42:14,194 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:42:14,194 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:42:14,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [147920629] [2023-12-24 13:42:14,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [147920629] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:42:14,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:42:14,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 13:42:14,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943639934] [2023-12-24 13:42:14,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:42:14,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 13:42:14,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:42:14,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 13:42:14,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 13:42:14,196 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 13:42:14,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:42:14,241 INFO L93 Difference]: Finished difference Result 175 states and 241 transitions. [2023-12-24 13:42:14,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 13:42:14,241 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 13:42:14,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:42:14,242 INFO L225 Difference]: With dead ends: 175 [2023-12-24 13:42:14,242 INFO L226 Difference]: Without dead ends: 96 [2023-12-24 13:42:14,243 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 13:42:14,243 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 13:42:14,244 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 13:42:14,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-12-24 13:42:14,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 83. [2023-12-24 13:42:14,248 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 13:42:14,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 113 transitions. [2023-12-24 13:42:14,249 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 113 transitions. Word has length 72 [2023-12-24 13:42:14,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:42:14,249 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 113 transitions. [2023-12-24 13:42:14,249 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 13:42:14,249 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 113 transitions. [2023-12-24 13:42:14,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-24 13:42:14,250 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:42:14,250 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 13:42:14,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-24 13:42:14,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:42:14,455 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:42:14,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:42:14,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1885600574, now seen corresponding path program 1 times [2023-12-24 13:42:14,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:42:14,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [385048162] [2023-12-24 13:42:14,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:42:14,456 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 13:42:14,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:42:14,457 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 13:42:14,458 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 13:42:14,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:42:14,562 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 13:42:14,564 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:42:14,742 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 13:42:14,783 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 33 proven. 18 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-12-24 13:42:14,784 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:42:14,869 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 13:42:14,869 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:42:14,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [385048162] [2023-12-24 13:42:14,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [385048162] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 13:42:14,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 13:42:14,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2023-12-24 13:42:14,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995208170] [2023-12-24 13:42:14,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:42:14,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 13:42:14,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:42:14,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 13:42:14,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-12-24 13:42:14,871 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 13:42:14,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:42:14,935 INFO L93 Difference]: Finished difference Result 196 states and 265 transitions. [2023-12-24 13:42:14,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 13:42:14,935 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 13:42:14,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:42:14,936 INFO L225 Difference]: With dead ends: 196 [2023-12-24 13:42:14,936 INFO L226 Difference]: Without dead ends: 114 [2023-12-24 13:42:14,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-12-24 13:42:14,937 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 73 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 13:42:14,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 326 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 13:42:14,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-12-24 13:42:14,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 83. [2023-12-24 13:42:14,941 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 13:42:14,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 112 transitions. [2023-12-24 13:42:14,942 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 112 transitions. Word has length 72 [2023-12-24 13:42:14,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:42:14,942 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 112 transitions. [2023-12-24 13:42:14,942 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 13:42:14,942 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 112 transitions. [2023-12-24 13:42:14,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-24 13:42:14,943 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:42:14,943 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 13:42:14,949 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 13:42:15,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:42:15,150 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:42:15,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:42:15,151 INFO L85 PathProgramCache]: Analyzing trace with hash 772475292, now seen corresponding path program 1 times [2023-12-24 13:42:15,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:42:15,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2002945616] [2023-12-24 13:42:15,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:42:15,151 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 13:42:15,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:42:15,152 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:42:15,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-24 13:42:15,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:42:15,276 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-24 13:42:15,280 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:42:15,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-24 13:42:15,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-24 13:42:15,382 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 8 treesize of output 1 [2023-12-24 13:42:15,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-24 13:42:15,452 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 13:42:15,457 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 7 [2023-12-24 13:42:15,483 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 63 proven. 9 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-24 13:42:15,484 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:42:15,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-12-24 13:42:15,663 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:42:15,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2002945616] [2023-12-24 13:42:15,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2002945616] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 13:42:15,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [853417380] [2023-12-24 13:42:15,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:42:15,664 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 13:42:15,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 13:42:15,714 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 13:42:15,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2023-12-24 13:42:15,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:42:15,918 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-24 13:42:15,921 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:42:15,977 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 13:42:16,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-24 13:42:16,202 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 13:42:16,239 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 63 proven. 9 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-24 13:42:16,239 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:42:16,339 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 26 treesize of output 18 [2023-12-24 13:42:16,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [853417380] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 13:42:16,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 13:42:16,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2023-12-24 13:42:16,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211412472] [2023-12-24 13:42:16,429 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 13:42:16,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-24 13:42:16,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:42:16,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-24 13:42:16,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2023-12-24 13:42:16,431 INFO L87 Difference]: Start difference. First operand 83 states and 112 transitions. Second operand has 15 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 15 states have internal predecessors, (69), 6 states have call successors, (16), 4 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 13:42:17,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:42:17,426 INFO L93 Difference]: Finished difference Result 227 states and 299 transitions. [2023-12-24 13:42:17,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-24 13:42:17,427 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 15 states have internal predecessors, (69), 6 states have call successors, (16), 4 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 13:42:17,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:42:17,428 INFO L225 Difference]: With dead ends: 227 [2023-12-24 13:42:17,428 INFO L226 Difference]: Without dead ends: 145 [2023-12-24 13:42:17,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 178 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=243, Invalid=1017, Unknown=0, NotChecked=0, Total=1260 [2023-12-24 13:42:17,429 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 214 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-24 13:42:17,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 677 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-24 13:42:17,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-12-24 13:42:17,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 138. [2023-12-24 13:42:17,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 124 states have (on average 1.282258064516129) internal successors, (159), 125 states have internal predecessors, (159), 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 13:42:17,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 179 transitions. [2023-12-24 13:42:17,438 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 179 transitions. Word has length 74 [2023-12-24 13:42:17,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:42:17,438 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 179 transitions. [2023-12-24 13:42:17,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 15 states have internal predecessors, (69), 6 states have call successors, (16), 4 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 13:42:17,439 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 179 transitions. [2023-12-24 13:42:17,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-24 13:42:17,440 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:42:17,440 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 13:42:17,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2023-12-24 13:42:17,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-24 13:42:17,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:42:17,845 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:42:17,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:42:17,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1615265287, now seen corresponding path program 1 times [2023-12-24 13:42:17,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:42:17,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1040469570] [2023-12-24 13:42:17,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:42:17,847 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 13:42:17,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:42:17,848 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 13:42:17,853 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 13:42:17,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:42:17,982 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-24 13:42:17,985 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:42:17,993 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 13:42:18,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2023-12-24 13:42:18,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 36 [2023-12-24 13:42:18,478 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:42:18,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 33 [2023-12-24 13:42:18,571 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 53 proven. 15 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-12-24 13:42:18,571 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:42:18,747 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 13:42:18,747 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:42:18,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1040469570] [2023-12-24 13:42:18,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1040469570] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 13:42:18,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 13:42:18,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15] total 20 [2023-12-24 13:42:18,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231651864] [2023-12-24 13:42:18,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:42:18,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-24 13:42:18,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:42:18,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-24 13:42:18,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2023-12-24 13:42:18,749 INFO L87 Difference]: Start difference. First operand 138 states and 179 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 13:42:19,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:42:19,182 INFO L93 Difference]: Finished difference Result 316 states and 408 transitions. [2023-12-24 13:42:19,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-24 13:42:19,183 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 13:42:19,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:42:19,185 INFO L225 Difference]: With dead ends: 316 [2023-12-24 13:42:19,185 INFO L226 Difference]: Without dead ends: 179 [2023-12-24 13:42:19,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=590, Unknown=0, NotChecked=0, Total=702 [2023-12-24 13:42:19,187 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 244 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 13:42:19,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 785 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 13:42:19,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2023-12-24 13:42:19,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 142. [2023-12-24 13:42:19,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 128 states have (on average 1.2734375) internal successors, (163), 129 states have internal predecessors, (163), 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 13:42:19,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 183 transitions. [2023-12-24 13:42:19,194 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 183 transitions. Word has length 75 [2023-12-24 13:42:19,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:42:19,195 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 183 transitions. [2023-12-24 13:42:19,195 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 13:42:19,196 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 183 transitions. [2023-12-24 13:42:19,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-24 13:42:19,196 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:42:19,197 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 13:42:19,201 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 13:42:19,401 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 13:42:19,402 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:42:19,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:42:19,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1668584759, now seen corresponding path program 1 times [2023-12-24 13:42:19,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:42:19,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1378520868] [2023-12-24 13:42:19,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:42:19,403 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 13:42:19,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:42:19,404 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 13:42:19,409 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 13:42:19,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:42:19,535 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-24 13:42:19,543 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:42:19,547 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 8 treesize of output 1 [2023-12-24 13:42:19,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-24 13:42:19,571 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 13:42:19,584 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 13:42:19,584 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:42:19,585 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:42:19,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1378520868] [2023-12-24 13:42:19,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1378520868] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:42:19,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:42:19,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 13:42:19,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673286995] [2023-12-24 13:42:19,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:42:19,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 13:42:19,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:42:19,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 13:42:19,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 13:42:19,586 INFO L87 Difference]: Start difference. First operand 142 states and 183 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 13:42:19,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:42:19,790 INFO L93 Difference]: Finished difference Result 312 states and 402 transitions. [2023-12-24 13:42:19,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 13:42:19,790 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 13:42:19,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:42:19,791 INFO L225 Difference]: With dead ends: 312 [2023-12-24 13:42:19,791 INFO L226 Difference]: Without dead ends: 171 [2023-12-24 13:42:19,792 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 13:42:19,792 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 110 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 13:42:19,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 388 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 13:42:19,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-12-24 13:42:19,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 136. [2023-12-24 13:42:19,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 122 states have (on average 1.2704918032786885) internal successors, (155), 123 states have internal predecessors, (155), 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 13:42:19,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 175 transitions. [2023-12-24 13:42:19,799 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 175 transitions. Word has length 75 [2023-12-24 13:42:19,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:42:19,799 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 175 transitions. [2023-12-24 13:42:19,799 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 13:42:19,799 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 175 transitions. [2023-12-24 13:42:19,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-24 13:42:19,800 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:42:19,800 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 13:42:19,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-24 13:42:20,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:42:20,004 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:42:20,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:42:20,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1396410569, now seen corresponding path program 1 times [2023-12-24 13:42:20,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:42:20,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1618187009] [2023-12-24 13:42:20,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:42:20,005 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 13:42:20,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:42:20,006 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:42:20,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-24 13:42:20,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:42:20,145 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-24 13:42:20,147 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:42:20,152 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 8 treesize of output 1 [2023-12-24 13:42:20,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2023-12-24 13:42:20,175 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 13:42:20,247 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 13:42:20,248 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:42:20,248 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:42:20,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1618187009] [2023-12-24 13:42:20,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1618187009] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:42:20,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:42:20,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 13:42:20,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648257083] [2023-12-24 13:42:20,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:42:20,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 13:42:20,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:42:20,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 13:42:20,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 13:42:20,249 INFO L87 Difference]: Start difference. First operand 136 states and 175 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 13:42:20,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:42:20,559 INFO L93 Difference]: Finished difference Result 310 states and 398 transitions. [2023-12-24 13:42:20,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 13:42:20,560 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 13:42:20,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:42:20,561 INFO L225 Difference]: With dead ends: 310 [2023-12-24 13:42:20,561 INFO L226 Difference]: Without dead ends: 175 [2023-12-24 13:42:20,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 71 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 13:42:20,563 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 86 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 13:42:20,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 370 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 13:42:20,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-12-24 13:42:20,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 136. [2023-12-24 13:42:20,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 122 states have (on average 1.2622950819672132) internal successors, (154), 123 states have internal predecessors, (154), 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 13:42:20,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 174 transitions. [2023-12-24 13:42:20,571 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 174 transitions. Word has length 75 [2023-12-24 13:42:20,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:42:20,571 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 174 transitions. [2023-12-24 13:42:20,571 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 13:42:20,572 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 174 transitions. [2023-12-24 13:42:20,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-24 13:42:20,572 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:42:20,572 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 13:42:20,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-24 13:42:20,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:42:20,777 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:42:20,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:42:20,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1887439477, now seen corresponding path program 1 times [2023-12-24 13:42:20,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:42:20,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [150788282] [2023-12-24 13:42:20,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:42:20,778 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 13:42:20,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:42:20,778 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 13:42:20,779 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 13:42:20,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:42:20,928 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-24 13:42:20,932 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:42:20,944 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 9 [2023-12-24 13:42:20,970 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 13:42:21,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 21 [2023-12-24 13:42:21,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 40 [2023-12-24 13:42:21,391 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:42:21,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 36 [2023-12-24 13:42:21,469 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-12-24 13:42:21,470 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:42:21,470 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:42:21,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [150788282] [2023-12-24 13:42:21,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [150788282] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:42:21,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:42:21,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-24 13:42:21,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219877836] [2023-12-24 13:42:21,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:42:21,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-24 13:42:21,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:42:21,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-24 13:42:21,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2023-12-24 13:42:21,472 INFO L87 Difference]: Start difference. First operand 136 states and 174 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 14 states have internal predecessors, (41), 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 13:42:23,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:42:23,526 INFO L93 Difference]: Finished difference Result 779 states and 985 transitions. [2023-12-24 13:42:23,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-12-24 13:42:23,526 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 14 states have internal predecessors, (41), 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 75 [2023-12-24 13:42:23,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:42:23,529 INFO L225 Difference]: With dead ends: 779 [2023-12-24 13:42:23,529 INFO L226 Difference]: Without dead ends: 644 [2023-12-24 13:42:23,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=423, Invalid=1557, Unknown=0, NotChecked=0, Total=1980 [2023-12-24 13:42:23,531 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 936 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-24 13:42:23,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [936 Valid, 877 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-24 13:42:23,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2023-12-24 13:42:23,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 295. [2023-12-24 13:42:23,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 268 states have (on average 1.2611940298507462) internal successors, (338), 270 states have internal predecessors, (338), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 13:42:23,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 378 transitions. [2023-12-24 13:42:23,561 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 378 transitions. Word has length 75 [2023-12-24 13:42:23,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:42:23,562 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 378 transitions. [2023-12-24 13:42:23,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 14 states have internal predecessors, (41), 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 13:42:23,562 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 378 transitions. [2023-12-24 13:42:23,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-24 13:42:23,563 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:42:23,563 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 13:42:23,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-12-24 13:42:23,767 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 13:42:23,767 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:42:23,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:42:23,768 INFO L85 PathProgramCache]: Analyzing trace with hash -292261228, now seen corresponding path program 1 times [2023-12-24 13:42:23,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:42:23,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1905852303] [2023-12-24 13:42:23,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:42:23,769 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 13:42:23,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:42:23,770 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 13:42:23,770 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 13:42:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:42:23,878 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 13:42:23,879 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:42:23,993 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 13:42:24,013 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 33 proven. 18 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-12-24 13:42:24,013 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:42:24,083 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 13:42:24,083 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:42:24,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1905852303] [2023-12-24 13:42:24,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1905852303] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 13:42:24,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 13:42:24,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2023-12-24 13:42:24,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878603109] [2023-12-24 13:42:24,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:42:24,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 13:42:24,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:42:24,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 13:42:24,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-12-24 13:42:24,085 INFO L87 Difference]: Start difference. First operand 295 states and 378 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 13:42:24,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:42:24,148 INFO L93 Difference]: Finished difference Result 655 states and 840 transitions. [2023-12-24 13:42:24,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 13:42:24,149 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 13:42:24,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:42:24,151 INFO L225 Difference]: With dead ends: 655 [2023-12-24 13:42:24,151 INFO L226 Difference]: Without dead ends: 361 [2023-12-24 13:42:24,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-12-24 13:42:24,152 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 42 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 13:42:24,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 307 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 13:42:24,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2023-12-24 13:42:24,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 295. [2023-12-24 13:42:24,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 268 states have (on average 1.25) internal successors, (335), 270 states have internal predecessors, (335), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 13:42:24,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 375 transitions. [2023-12-24 13:42:24,166 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 375 transitions. Word has length 75 [2023-12-24 13:42:24,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:42:24,166 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 375 transitions. [2023-12-24 13:42:24,166 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 13:42:24,167 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 375 transitions. [2023-12-24 13:42:24,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-24 13:42:24,167 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:42:24,168 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 13:42:24,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-12-24 13:42:24,371 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 13:42:24,371 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:42:24,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:42:24,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1103962290, now seen corresponding path program 1 times [2023-12-24 13:42:24,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:42:24,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2114615345] [2023-12-24 13:42:24,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:42:24,372 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 13:42:24,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:42:24,374 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 13:42:24,377 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 13:42:24,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:42:24,486 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 13:42:24,488 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:42:24,625 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 13:42:24,641 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 33 proven. 18 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-12-24 13:42:24,641 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:42:24,722 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 13:42:24,722 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:42:24,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2114615345] [2023-12-24 13:42:24,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2114615345] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 13:42:24,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 13:42:24,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2023-12-24 13:42:24,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696577743] [2023-12-24 13:42:24,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:42:24,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 13:42:24,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:42:24,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 13:42:24,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-12-24 13:42:24,724 INFO L87 Difference]: Start difference. First operand 295 states and 375 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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 13:42:24,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:42:24,794 INFO L93 Difference]: Finished difference Result 745 states and 956 transitions. [2023-12-24 13:42:24,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 13:42:24,795 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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 76 [2023-12-24 13:42:24,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:42:24,796 INFO L225 Difference]: With dead ends: 745 [2023-12-24 13:42:24,796 INFO L226 Difference]: Without dead ends: 451 [2023-12-24 13:42:24,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-12-24 13:42:24,798 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 111 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 265 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 13:42:24,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 265 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 13:42:24,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2023-12-24 13:42:24,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 305. [2023-12-24 13:42:24,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 278 states have (on average 1.2410071942446044) internal successors, (345), 280 states have internal predecessors, (345), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 13:42:24,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 385 transitions. [2023-12-24 13:42:24,812 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 385 transitions. Word has length 76 [2023-12-24 13:42:24,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:42:24,813 INFO L495 AbstractCegarLoop]: Abstraction has 305 states and 385 transitions. [2023-12-24 13:42:24,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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 13:42:24,813 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 385 transitions. [2023-12-24 13:42:24,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-24 13:42:24,814 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:42:24,814 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 13:42:24,822 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 13:42:25,018 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 13:42:25,018 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:42:25,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:42:25,019 INFO L85 PathProgramCache]: Analyzing trace with hash 342453205, now seen corresponding path program 1 times [2023-12-24 13:42:25,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:42:25,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [339588863] [2023-12-24 13:42:25,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:42:25,020 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 13:42:25,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:42:25,021 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 13:42:25,056 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 13:42:25,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:42:25,162 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-24 13:42:25,164 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:42:25,174 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 9 [2023-12-24 13:42:25,302 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 13:42:25,325 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 13:42:25,326 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:42:25,326 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:42:25,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [339588863] [2023-12-24 13:42:25,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [339588863] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:42:25,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:42:25,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 13:42:25,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392225857] [2023-12-24 13:42:25,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:42:25,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 13:42:25,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:42:25,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 13:42:25,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-24 13:42:25,327 INFO L87 Difference]: Start difference. First operand 305 states and 385 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 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 13:42:25,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:42:25,861 INFO L93 Difference]: Finished difference Result 697 states and 874 transitions. [2023-12-24 13:42:25,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 13:42:25,861 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 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 76 [2023-12-24 13:42:25,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:42:25,863 INFO L225 Difference]: With dead ends: 697 [2023-12-24 13:42:25,863 INFO L226 Difference]: Without dead ends: 393 [2023-12-24 13:42:25,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-12-24 13:42:25,865 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 169 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-24 13:42:25,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 348 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-24 13:42:25,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2023-12-24 13:42:25,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 288. [2023-12-24 13:42:25,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 263 states have (on average 1.2129277566539924) internal successors, (319), 264 states have internal predecessors, (319), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-24 13:42:25,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 355 transitions. [2023-12-24 13:42:25,879 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 355 transitions. Word has length 76 [2023-12-24 13:42:25,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:42:25,880 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 355 transitions. [2023-12-24 13:42:25,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 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 13:42:25,881 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 355 transitions. [2023-12-24 13:42:25,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-24 13:42:25,882 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:42:25,882 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 13:42:25,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-12-24 13:42:26,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:42:26,086 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:42:26,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:42:26,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1636270173, now seen corresponding path program 1 times [2023-12-24 13:42:26,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:42:26,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1542996675] [2023-12-24 13:42:26,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:42:26,088 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 13:42:26,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:42:26,089 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:42:26,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-12-24 13:42:26,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:42:26,219 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-24 13:42:26,221 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:42:26,234 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 13:42:26,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2023-12-24 13:42:26,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2023-12-24 13:42:26,470 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:42:26,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 27 [2023-12-24 13:42:26,555 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-12-24 13:42:26,556 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:42:26,556 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:42:26,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1542996675] [2023-12-24 13:42:26,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1542996675] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:42:26,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:42:26,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-24 13:42:26,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772351612] [2023-12-24 13:42:26,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:42:26,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 13:42:26,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:42:26,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 13:42:26,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-12-24 13:42:26,557 INFO L87 Difference]: Start difference. First operand 288 states and 355 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 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 13:42:27,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:42:27,463 INFO L93 Difference]: Finished difference Result 825 states and 1019 transitions. [2023-12-24 13:42:27,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-24 13:42:27,464 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 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 76 [2023-12-24 13:42:27,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:42:27,466 INFO L225 Difference]: With dead ends: 825 [2023-12-24 13:42:27,466 INFO L226 Difference]: Without dead ends: 538 [2023-12-24 13:42:27,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2023-12-24 13:42:27,467 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 277 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-24 13:42:27,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 969 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-24 13:42:27,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2023-12-24 13:42:27,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 274. [2023-12-24 13:42:27,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 249 states have (on average 1.2208835341365463) internal successors, (304), 250 states have internal predecessors, (304), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-24 13:42:27,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 340 transitions. [2023-12-24 13:42:27,498 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 340 transitions. Word has length 76 [2023-12-24 13:42:27,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:42:27,498 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 340 transitions. [2023-12-24 13:42:27,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 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 13:42:27,498 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 340 transitions. [2023-12-24 13:42:27,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-24 13:42:27,499 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:42:27,499 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 13:42:27,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-12-24 13:42:27,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:42:27,704 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:42:27,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:42:27,704 INFO L85 PathProgramCache]: Analyzing trace with hash -2094073389, now seen corresponding path program 1 times [2023-12-24 13:42:27,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:42:27,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [323300836] [2023-12-24 13:42:27,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:42:27,705 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 13:42:27,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:42:27,706 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 13:42:27,707 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 13:42:27,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:42:27,829 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-24 13:42:27,831 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:42:27,834 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 13:42:27,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2023-12-24 13:42:27,885 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:42:27,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 30 [2023-12-24 13:42:27,921 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 13:42:27,922 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:42:27,922 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:42:27,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [323300836] [2023-12-24 13:42:27,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [323300836] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:42:27,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:42:27,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-24 13:42:27,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259420896] [2023-12-24 13:42:27,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:42:27,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 13:42:27,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:42:27,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 13:42:27,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-24 13:42:27,924 INFO L87 Difference]: Start difference. First operand 274 states and 340 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 13:42:28,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:42:28,271 INFO L93 Difference]: Finished difference Result 853 states and 1069 transitions. [2023-12-24 13:42:28,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-24 13:42:28,276 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 13:42:28,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:42:28,279 INFO L225 Difference]: With dead ends: 853 [2023-12-24 13:42:28,279 INFO L226 Difference]: Without dead ends: 580 [2023-12-24 13:42:28,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=202, Invalid=500, Unknown=0, NotChecked=0, Total=702 [2023-12-24 13:42:28,281 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 400 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 13:42:28,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 663 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 13:42:28,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2023-12-24 13:42:28,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 419. [2023-12-24 13:42:28,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 374 states have (on average 1.1978609625668448) internal successors, (448), 378 states have internal predecessors, (448), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-24 13:42:28,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 512 transitions. [2023-12-24 13:42:28,305 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 512 transitions. Word has length 78 [2023-12-24 13:42:28,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:42:28,306 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 512 transitions. [2023-12-24 13:42:28,306 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 13:42:28,306 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 512 transitions. [2023-12-24 13:42:28,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-24 13:42:28,306 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:42:28,307 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 13:42:28,312 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 13:42:28,511 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 13:42:28,511 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:42:28,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:42:28,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1875218671, now seen corresponding path program 1 times [2023-12-24 13:42:28,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:42:28,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2030488939] [2023-12-24 13:42:28,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:42:28,512 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 13:42:28,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:42:28,513 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 13:42:28,514 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 13:42:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:42:28,637 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-24 13:42:28,639 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:42:28,742 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:42:28,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 19 [2023-12-24 13:42:28,765 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 13:42:28,765 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:42:28,765 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:42:28,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2030488939] [2023-12-24 13:42:28,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2030488939] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:42:28,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:42:28,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-24 13:42:28,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286910808] [2023-12-24 13:42:28,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:42:28,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 13:42:28,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:42:28,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 13:42:28,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-24 13:42:28,766 INFO L87 Difference]: Start difference. First operand 419 states and 512 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 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 13:42:29,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:42:29,049 INFO L93 Difference]: Finished difference Result 962 states and 1177 transitions. [2023-12-24 13:42:29,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 13:42:29,050 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 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 13:42:29,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:42:29,052 INFO L225 Difference]: With dead ends: 962 [2023-12-24 13:42:29,052 INFO L226 Difference]: Without dead ends: 568 [2023-12-24 13:42:29,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-24 13:42:29,053 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 91 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 13:42:29,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 557 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 13:42:29,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2023-12-24 13:42:29,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 417. [2023-12-24 13:42:29,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 374 states have (on average 1.1844919786096257) internal successors, (443), 377 states have internal predecessors, (443), 30 states have call successors, (30), 12 states have call predecessors, (30), 12 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2023-12-24 13:42:29,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 503 transitions. [2023-12-24 13:42:29,092 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 503 transitions. Word has length 78 [2023-12-24 13:42:29,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:42:29,093 INFO L495 AbstractCegarLoop]: Abstraction has 417 states and 503 transitions. [2023-12-24 13:42:29,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 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 13:42:29,093 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 503 transitions. [2023-12-24 13:42:29,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-12-24 13:42:29,094 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:42:29,094 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 13:42:29,099 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 13:42:29,298 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 13:42:29,298 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:42:29,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:42:29,299 INFO L85 PathProgramCache]: Analyzing trace with hash -606322452, now seen corresponding path program 1 times [2023-12-24 13:42:29,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:42:29,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [231309238] [2023-12-24 13:42:29,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:42:29,300 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 13:42:29,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:42:29,301 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 13:42:29,334 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 13:42:29,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:42:29,448 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-24 13:42:29,450 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:42:29,454 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 1 [2023-12-24 13:42:29,455 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 13:42:29,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2023-12-24 13:42:29,527 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 57 treesize of output 45 [2023-12-24 13:42:29,541 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 13:42:29,541 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:42:29,541 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:42:29,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [231309238] [2023-12-24 13:42:29,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [231309238] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:42:29,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:42:29,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 13:42:29,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99935048] [2023-12-24 13:42:29,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:42:29,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 13:42:29,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:42:29,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 13:42:29,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 13:42:29,542 INFO L87 Difference]: Start difference. First operand 417 states and 503 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 13:42:29,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:42:29,661 INFO L93 Difference]: Finished difference Result 443 states and 536 transitions. [2023-12-24 13:42:29,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 13:42:29,661 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 13:42:29,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:42:29,663 INFO L225 Difference]: With dead ends: 443 [2023-12-24 13:42:29,663 INFO L226 Difference]: Without dead ends: 441 [2023-12-24 13:42:29,663 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 13:42:29,664 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 63 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 13:42:29,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 330 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 13:42:29,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2023-12-24 13:42:29,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 433. [2023-12-24 13:42:29,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 387 states have (on average 1.178294573643411) internal successors, (456), 390 states have internal predecessors, (456), 32 states have call successors, (32), 13 states have call predecessors, (32), 13 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-24 13:42:29,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 520 transitions. [2023-12-24 13:42:29,689 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 520 transitions. Word has length 80 [2023-12-24 13:42:29,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:42:29,689 INFO L495 AbstractCegarLoop]: Abstraction has 433 states and 520 transitions. [2023-12-24 13:42:29,690 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 13:42:29,690 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 520 transitions. [2023-12-24 13:42:29,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-12-24 13:42:29,690 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:42:29,690 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 13:42:29,696 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 13:42:29,895 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 13:42:29,895 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:42:29,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:42:29,895 INFO L85 PathProgramCache]: Analyzing trace with hash -606262870, now seen corresponding path program 1 times [2023-12-24 13:42:29,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:42:29,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [643326285] [2023-12-24 13:42:29,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:42:29,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 13:42:29,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:42:29,897 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 13:42:29,897 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 13:42:30,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:42:30,027 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-24 13:42:30,029 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:42:30,032 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 8 treesize of output 1 [2023-12-24 13:42:30,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2023-12-24 13:42:30,095 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 13:42:30,095 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:42:30,095 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:42:30,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [643326285] [2023-12-24 13:42:30,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [643326285] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:42:30,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:42:30,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 13:42:30,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625560057] [2023-12-24 13:42:30,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:42:30,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 13:42:30,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:42:30,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 13:42:30,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 13:42:30,096 INFO L87 Difference]: Start difference. First operand 433 states and 520 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 13:42:30,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:42:30,197 INFO L93 Difference]: Finished difference Result 845 states and 1012 transitions. [2023-12-24 13:42:30,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 13:42:30,197 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 13:42:30,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:42:30,198 INFO L225 Difference]: With dead ends: 845 [2023-12-24 13:42:30,198 INFO L226 Difference]: Without dead ends: 445 [2023-12-24 13:42:30,199 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 13:42:30,200 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 47 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 13:42:30,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 302 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 13:42:30,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2023-12-24 13:42:30,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2023-12-24 13:42:30,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 396 states have (on average 1.1641414141414141) internal successors, (461), 399 states have internal predecessors, (461), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-24 13:42:30,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 525 transitions. [2023-12-24 13:42:30,226 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 525 transitions. Word has length 80 [2023-12-24 13:42:30,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:42:30,226 INFO L495 AbstractCegarLoop]: Abstraction has 445 states and 525 transitions. [2023-12-24 13:42:30,226 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 13:42:30,227 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 525 transitions. [2023-12-24 13:42:30,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-12-24 13:42:30,227 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:42:30,227 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 13:42:30,232 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 (23)] Ended with exit code 0 [2023-12-24 13:42:30,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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 13:42:30,432 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:42:30,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:42:30,432 INFO L85 PathProgramCache]: Analyzing trace with hash -549004568, now seen corresponding path program 1 times [2023-12-24 13:42:30,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:42:30,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1341527569] [2023-12-24 13:42:30,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:42:30,433 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 13:42:30,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:42:30,434 INFO L229 MonitoredProcess]: Starting monitored process 24 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 13:42:30,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-12-24 13:42:30,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:42:30,612 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-24 13:42:30,615 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:42:30,624 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 9 [2023-12-24 13:42:30,670 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 1 [2023-12-24 13:42:30,754 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 8 treesize of output 1 [2023-12-24 13:42:30,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2023-12-24 13:42:30,885 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:42:30,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 37 [2023-12-24 13:42:31,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 31 [2023-12-24 13:42:31,274 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 63 proven. 9 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-24 13:42:31,274 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:42:31,456 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 13:42:31,456 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:42:31,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1341527569] [2023-12-24 13:42:31,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1341527569] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 13:42:31,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 13:42:31,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 14 [2023-12-24 13:42:31,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535555448] [2023-12-24 13:42:31,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:42:31,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 13:42:31,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:42:31,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 13:42:31,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-12-24 13:42:31,458 INFO L87 Difference]: Start difference. First operand 445 states and 525 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 13:42:31,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:42:31,868 INFO L93 Difference]: Finished difference Result 1119 states and 1322 transitions. [2023-12-24 13:42:31,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 13:42:31,870 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 13:42:31,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:42:31,872 INFO L225 Difference]: With dead ends: 1119 [2023-12-24 13:42:31,872 INFO L226 Difference]: Without dead ends: 707 [2023-12-24 13:42:31,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 145 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2023-12-24 13:42:31,874 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 66 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 13:42:31,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 346 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 13:42:31,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2023-12-24 13:42:31,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 638. [2023-12-24 13:42:31,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 589 states have (on average 1.1646859083191852) internal successors, (686), 592 states have internal predecessors, (686), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-24 13:42:31,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 750 transitions. [2023-12-24 13:42:31,904 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 750 transitions. Word has length 80 [2023-12-24 13:42:31,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:42:31,904 INFO L495 AbstractCegarLoop]: Abstraction has 638 states and 750 transitions. [2023-12-24 13:42:31,904 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 13:42:31,904 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 750 transitions. [2023-12-24 13:42:31,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-12-24 13:42:31,905 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:42:31,905 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 13:42:31,910 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 (24)] Forceful destruction successful, exit code 0 [2023-12-24 13:42:32,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 13:42:32,109 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:42:32,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:42:32,110 INFO L85 PathProgramCache]: Analyzing trace with hash 847893285, now seen corresponding path program 1 times [2023-12-24 13:42:32,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:42:32,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2006211761] [2023-12-24 13:42:32,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:42:32,110 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 13:42:32,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:42:32,111 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 13:42:32,112 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 13:42:32,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:42:32,237 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 13:42:32,240 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:42:32,391 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 33 proven. 18 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-12-24 13:42:32,391 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:42:32,455 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 13:42:32,455 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:42:32,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2006211761] [2023-12-24 13:42:32,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2006211761] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 13:42:32,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 13:42:32,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2023-12-24 13:42:32,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762109359] [2023-12-24 13:42:32,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:42:32,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 13:42:32,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:42:32,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 13:42:32,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-12-24 13:42:32,456 INFO L87 Difference]: Start difference. First operand 638 states and 750 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 13:42:32,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:42:32,536 INFO L93 Difference]: Finished difference Result 1357 states and 1596 transitions. [2023-12-24 13:42:32,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 13:42:32,537 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 13:42:32,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:42:32,539 INFO L225 Difference]: With dead ends: 1357 [2023-12-24 13:42:32,539 INFO L226 Difference]: Without dead ends: 752 [2023-12-24 13:42:32,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-12-24 13:42:32,541 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 126 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 13:42:32,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 288 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 13:42:32,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2023-12-24 13:42:32,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 548. [2023-12-24 13:42:32,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 499 states have (on average 1.1523046092184368) internal successors, (575), 502 states have internal predecessors, (575), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-24 13:42:32,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 639 transitions. [2023-12-24 13:42:32,569 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 639 transitions. Word has length 81 [2023-12-24 13:42:32,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:42:32,569 INFO L495 AbstractCegarLoop]: Abstraction has 548 states and 639 transitions. [2023-12-24 13:42:32,569 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 13:42:32,569 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 639 transitions. [2023-12-24 13:42:32,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-12-24 13:42:32,570 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:42:32,570 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 13:42:32,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 (25)] Forceful destruction successful, exit code 0 [2023-12-24 13:42:32,774 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 13:42:32,775 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:42:32,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:42:32,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1067300445, now seen corresponding path program 1 times [2023-12-24 13:42:32,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:42:32,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [28693224] [2023-12-24 13:42:32,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:42:32,776 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 13:42:32,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:42:32,777 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 13:42:32,778 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 13:42:32,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:42:32,904 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 13:42:32,907 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:42:32,920 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 9 [2023-12-24 13:42:32,945 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 13:42:33,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 19 [2023-12-24 13:42:33,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 19 [2023-12-24 13:42:33,217 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 28 treesize of output 16 [2023-12-24 13:42:33,234 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-12-24 13:42:33,234 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:42:33,234 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:42:33,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [28693224] [2023-12-24 13:42:33,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [28693224] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:42:33,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:42:33,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-24 13:42:33,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123554384] [2023-12-24 13:42:33,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:42:33,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 13:42:33,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:42:33,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 13:42:33,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-24 13:42:33,236 INFO L87 Difference]: Start difference. First operand 548 states and 639 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 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 13:42:33,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:42:33,823 INFO L93 Difference]: Finished difference Result 1224 states and 1421 transitions. [2023-12-24 13:42:33,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-24 13:42:33,823 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 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 82 [2023-12-24 13:42:33,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:42:33,825 INFO L225 Difference]: With dead ends: 1224 [2023-12-24 13:42:33,826 INFO L226 Difference]: Without dead ends: 709 [2023-12-24 13:42:33,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2023-12-24 13:42:33,827 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 325 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-24 13:42:33,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 406 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-24 13:42:33,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2023-12-24 13:42:33,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 623. [2023-12-24 13:42:33,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 574 states have (on average 1.146341463414634) internal successors, (658), 577 states have internal predecessors, (658), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-24 13:42:33,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 722 transitions. [2023-12-24 13:42:33,860 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 722 transitions. Word has length 82 [2023-12-24 13:42:33,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:42:33,860 INFO L495 AbstractCegarLoop]: Abstraction has 623 states and 722 transitions. [2023-12-24 13:42:33,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 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 13:42:33,861 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 722 transitions. [2023-12-24 13:42:33,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-12-24 13:42:33,862 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:42:33,862 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 13:42:33,869 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 13:42:34,066 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 13:42:34,067 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:42:34,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:42:34,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1832706834, now seen corresponding path program 1 times [2023-12-24 13:42:34,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:42:34,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1366820051] [2023-12-24 13:42:34,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:42:34,067 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 13:42:34,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:42:34,068 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 13:42:34,069 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 13:42:34,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:42:34,184 INFO L262 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-24 13:42:34,189 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:42:34,220 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 9 [2023-12-24 13:42:34,283 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 13:42:34,300 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 13:42:34,301 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:42:34,301 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:42:34,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1366820051] [2023-12-24 13:42:34,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1366820051] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:42:34,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:42:34,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 13:42:34,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553475241] [2023-12-24 13:42:34,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:42:34,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 13:42:34,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:42:34,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 13:42:34,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-24 13:42:34,302 INFO L87 Difference]: Start difference. First operand 623 states and 722 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 13:42:34,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:42:34,587 INFO L93 Difference]: Finished difference Result 1179 states and 1368 transitions. [2023-12-24 13:42:34,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 13:42:34,587 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 13:42:34,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:42:34,589 INFO L225 Difference]: With dead ends: 1179 [2023-12-24 13:42:34,589 INFO L226 Difference]: Without dead ends: 589 [2023-12-24 13:42:34,590 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 13:42:34,590 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 136 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 13:42:34,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 391 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 13:42:34,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2023-12-24 13:42:34,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 556. [2023-12-24 13:42:34,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 507 states have (on average 1.1459566074950691) internal successors, (581), 510 states have internal predecessors, (581), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-24 13:42:34,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 645 transitions. [2023-12-24 13:42:34,618 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 645 transitions. Word has length 82 [2023-12-24 13:42:34,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:42:34,618 INFO L495 AbstractCegarLoop]: Abstraction has 556 states and 645 transitions. [2023-12-24 13:42:34,618 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 13:42:34,618 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 645 transitions. [2023-12-24 13:42:34,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-12-24 13:42:34,619 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:42:34,619 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 13:42:34,623 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 13:42:34,823 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 13:42:34,823 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:42:34,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:42:34,824 INFO L85 PathProgramCache]: Analyzing trace with hash -10337099, now seen corresponding path program 1 times [2023-12-24 13:42:34,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:42:34,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [684595892] [2023-12-24 13:42:34,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:42:34,824 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 13:42:34,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:42:34,825 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 13:42:34,826 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 13:42:35,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:42:35,016 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-24 13:42:35,019 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:42:35,033 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 9 [2023-12-24 13:42:35,062 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 1 [2023-12-24 13:42:35,143 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 8 treesize of output 1 [2023-12-24 13:42:35,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2023-12-24 13:42:35,310 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:42:35,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 53 [2023-12-24 13:42:35,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 52 [2023-12-24 13:42:35,765 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 63 proven. 9 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-24 13:42:35,765 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:42:35,958 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 13:42:35,958 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:42:35,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [684595892] [2023-12-24 13:42:35,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [684595892] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 13:42:35,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 13:42:35,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 16 [2023-12-24 13:42:35,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300144576] [2023-12-24 13:42:35,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:42:35,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 13:42:35,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:42:35,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 13:42:35,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2023-12-24 13:42:35,960 INFO L87 Difference]: Start difference. First operand 556 states and 645 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 13:42:36,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:42:36,473 INFO L93 Difference]: Finished difference Result 1155 states and 1340 transitions. [2023-12-24 13:42:36,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-24 13:42:36,475 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 13:42:36,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:42:36,476 INFO L225 Difference]: With dead ends: 1155 [2023-12-24 13:42:36,476 INFO L226 Difference]: Without dead ends: 632 [2023-12-24 13:42:36,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 149 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2023-12-24 13:42:36,478 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 73 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 13:42:36,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 414 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 13:42:36,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2023-12-24 13:42:36,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 562. [2023-12-24 13:42:36,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 513 states have (on average 1.1481481481481481) internal successors, (589), 516 states have internal predecessors, (589), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-24 13:42:36,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 653 transitions. [2023-12-24 13:42:36,506 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 653 transitions. Word has length 83 [2023-12-24 13:42:36,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:42:36,506 INFO L495 AbstractCegarLoop]: Abstraction has 562 states and 653 transitions. [2023-12-24 13:42:36,506 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 13:42:36,506 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 653 transitions. [2023-12-24 13:42:36,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-24 13:42:36,507 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:42:36,507 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 13:42:36,511 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 13:42:36,711 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 13:42:36,712 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:42:36,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:42:36,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1104038769, now seen corresponding path program 1 times [2023-12-24 13:42:36,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:42:36,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1501652364] [2023-12-24 13:42:36,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:42:36,713 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 13:42:36,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:42:36,714 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 13:42:36,715 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 13:42:36,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:42:36,836 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 13:42:36,837 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:42:36,852 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 9 [2023-12-24 13:42:36,930 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 13:42:36,948 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 13:42:36,948 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:42:36,948 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:42:36,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1501652364] [2023-12-24 13:42:36,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1501652364] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:42:36,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:42:36,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 13:42:36,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378470489] [2023-12-24 13:42:36,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:42:36,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 13:42:36,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:42:36,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 13:42:36,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-24 13:42:36,950 INFO L87 Difference]: Start difference. First operand 562 states and 653 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 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 13:42:37,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:42:37,262 INFO L93 Difference]: Finished difference Result 1113 states and 1291 transitions. [2023-12-24 13:42:37,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 13:42:37,262 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 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 13:42:37,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:42:37,264 INFO L225 Difference]: With dead ends: 1113 [2023-12-24 13:42:37,264 INFO L226 Difference]: Without dead ends: 584 [2023-12-24 13:42:37,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-12-24 13:42:37,265 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 93 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 13:42:37,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 395 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 13:42:37,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2023-12-24 13:42:37,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 562. [2023-12-24 13:42:37,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 513 states have (on average 1.1442495126705654) internal successors, (587), 516 states have internal predecessors, (587), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-24 13:42:37,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 651 transitions. [2023-12-24 13:42:37,292 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 651 transitions. Word has length 85 [2023-12-24 13:42:37,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:42:37,292 INFO L495 AbstractCegarLoop]: Abstraction has 562 states and 651 transitions. [2023-12-24 13:42:37,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 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 13:42:37,292 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 651 transitions. [2023-12-24 13:42:37,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-24 13:42:37,294 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:42:37,294 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, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:42:37,300 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 13:42:37,498 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 13:42:37,498 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:42:37,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:42:37,499 INFO L85 PathProgramCache]: Analyzing trace with hash 2124939651, now seen corresponding path program 1 times [2023-12-24 13:42:37,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:42:37,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [630967815] [2023-12-24 13:42:37,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:42:37,500 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 13:42:37,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:42:37,501 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 13:42:37,502 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 13:42:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:42:37,723 INFO L262 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-24 13:42:37,726 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:42:37,730 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 13:42:37,732 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 1 [2023-12-24 13:42:37,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2023-12-24 13:42:37,808 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:42:37,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 23 [2023-12-24 13:42:37,866 INFO L134 CoverageAnalysis]: Checked inductivity of 517 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2023-12-24 13:42:37,866 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:42:37,866 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:42:37,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [630967815] [2023-12-24 13:42:37,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [630967815] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:42:37,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:42:37,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-24 13:42:37,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804590613] [2023-12-24 13:42:37,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:42:37,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-24 13:42:37,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:42:37,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-24 13:42:37,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-12-24 13:42:37,868 INFO L87 Difference]: Start difference. First operand 562 states and 651 transitions. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 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 13:42:38,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:42:38,192 INFO L93 Difference]: Finished difference Result 1057 states and 1230 transitions. [2023-12-24 13:42:38,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 13:42:38,192 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 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 154 [2023-12-24 13:42:38,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:42:38,194 INFO L225 Difference]: With dead ends: 1057 [2023-12-24 13:42:38,194 INFO L226 Difference]: Without dead ends: 724 [2023-12-24 13:42:38,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2023-12-24 13:42:38,195 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 161 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 13:42:38,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 760 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 13:42:38,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2023-12-24 13:42:38,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 532. [2023-12-24 13:42:38,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 483 states have (on average 1.1428571428571428) internal successors, (552), 486 states have internal predecessors, (552), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-24 13:42:38,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 616 transitions. [2023-12-24 13:42:38,223 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 616 transitions. Word has length 154 [2023-12-24 13:42:38,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:42:38,223 INFO L495 AbstractCegarLoop]: Abstraction has 532 states and 616 transitions. [2023-12-24 13:42:38,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 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 13:42:38,223 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 616 transitions. [2023-12-24 13:42:38,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-12-24 13:42:38,225 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:42:38,225 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:42:38,230 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 (30)] Ended with exit code 0 [2023-12-24 13:42:38,430 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 13:42:38,431 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:42:38,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:42:38,431 INFO L85 PathProgramCache]: Analyzing trace with hash -60835539, now seen corresponding path program 1 times [2023-12-24 13:42:38,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:42:38,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [810972803] [2023-12-24 13:42:38,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:42:38,432 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 13:42:38,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:42:38,433 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 13:42:38,433 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 13:42:38,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:42:38,615 INFO L262 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 13:42:38,618 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:42:38,726 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 288 proven. 18 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2023-12-24 13:42:38,726 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:42:38,782 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 498 trivial. 0 not checked. [2023-12-24 13:42:38,782 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:42:38,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [810972803] [2023-12-24 13:42:38,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [810972803] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 13:42:38,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 13:42:38,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2023-12-24 13:42:38,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141736758] [2023-12-24 13:42:38,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:42:38,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 13:42:38,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:42:38,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 13:42:38,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-12-24 13:42:38,783 INFO L87 Difference]: Start difference. First operand 532 states and 616 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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 13:42:38,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:42:38,858 INFO L93 Difference]: Finished difference Result 922 states and 1080 transitions. [2023-12-24 13:42:38,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 13:42:38,859 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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 157 [2023-12-24 13:42:38,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:42:38,861 INFO L225 Difference]: With dead ends: 922 [2023-12-24 13:42:38,861 INFO L226 Difference]: Without dead ends: 619 [2023-12-24 13:42:38,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-12-24 13:42:38,862 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 47 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 388 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 13:42:38,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 388 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 13:42:38,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2023-12-24 13:42:38,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 534. [2023-12-24 13:42:38,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 485 states have (on average 1.1422680412371133) internal successors, (554), 488 states have internal predecessors, (554), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-24 13:42:38,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 618 transitions. [2023-12-24 13:42:38,890 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 618 transitions. Word has length 157 [2023-12-24 13:42:38,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:42:38,890 INFO L495 AbstractCegarLoop]: Abstraction has 534 states and 618 transitions. [2023-12-24 13:42:38,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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 13:42:38,890 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 618 transitions. [2023-12-24 13:42:38,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-12-24 13:42:38,892 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:42:38,892 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:42:38,898 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 (31)] Forceful destruction successful, exit code 0 [2023-12-24 13:42:39,098 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 13:42:39,098 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:42:39,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:42:39,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1204075, now seen corresponding path program 1 times [2023-12-24 13:42:39,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:42:39,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [21051713] [2023-12-24 13:42:39,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:42:39,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 13:42:39,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:42:39,100 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 13:42:39,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 (32)] Waiting until timeout for monitored process [2023-12-24 13:42:39,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:42:39,308 INFO L262 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 13:42:39,311 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:42:39,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 13:42:39,350 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 497 trivial. 0 not checked. [2023-12-24 13:42:39,350 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:42:39,350 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:42:39,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [21051713] [2023-12-24 13:42:39,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [21051713] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:42:39,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:42:39,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 13:42:39,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646706449] [2023-12-24 13:42:39,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:42:39,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 13:42:39,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:42:39,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 13:42:39,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 13:42:39,353 INFO L87 Difference]: Start difference. First operand 534 states and 618 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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 13:42:39,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:42:39,532 INFO L93 Difference]: Finished difference Result 759 states and 883 transitions. [2023-12-24 13:42:39,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 13:42:39,533 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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 157 [2023-12-24 13:42:39,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:42:39,535 INFO L225 Difference]: With dead ends: 759 [2023-12-24 13:42:39,535 INFO L226 Difference]: Without dead ends: 454 [2023-12-24 13:42:39,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 154 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 13:42:39,537 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 12 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 13:42:39,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 189 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 13:42:39,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2023-12-24 13:42:39,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 454. [2023-12-24 13:42:39,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 405 states have (on average 1.125925925925926) internal successors, (456), 408 states have internal predecessors, (456), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-24 13:42:39,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 520 transitions. [2023-12-24 13:42:39,563 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 520 transitions. Word has length 157 [2023-12-24 13:42:39,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:42:39,565 INFO L495 AbstractCegarLoop]: Abstraction has 454 states and 520 transitions. [2023-12-24 13:42:39,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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 13:42:39,565 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 520 transitions. [2023-12-24 13:42:39,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-12-24 13:42:39,566 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:42:39,567 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:42:39,575 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 (32)] Forceful destruction successful, exit code 0 [2023-12-24 13:42:39,772 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 13:42:39,772 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:42:39,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:42:39,772 INFO L85 PathProgramCache]: Analyzing trace with hash 220071448, now seen corresponding path program 1 times [2023-12-24 13:42:39,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:42:39,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1576082479] [2023-12-24 13:42:39,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:42:39,773 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 13:42:39,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:42:39,774 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 13:42:39,775 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 13:42:39,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:42:39,954 INFO L262 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 13:42:39,957 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:42:40,125 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 13:42:40,145 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 288 proven. 18 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2023-12-24 13:42:40,145 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:42:40,257 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2023-12-24 13:42:40,257 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:42:40,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1576082479] [2023-12-24 13:42:40,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1576082479] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 13:42:40,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 13:42:40,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2023-12-24 13:42:40,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27074003] [2023-12-24 13:42:40,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:42:40,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 13:42:40,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:42:40,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 13:42:40,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-12-24 13:42:40,259 INFO L87 Difference]: Start difference. First operand 454 states and 520 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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 13:42:40,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:42:40,332 INFO L93 Difference]: Finished difference Result 796 states and 914 transitions. [2023-12-24 13:42:40,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 13:42:40,332 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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 159 [2023-12-24 13:42:40,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:42:40,334 INFO L225 Difference]: With dead ends: 796 [2023-12-24 13:42:40,334 INFO L226 Difference]: Without dead ends: 571 [2023-12-24 13:42:40,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-12-24 13:42:40,335 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 69 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 13:42:40,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 228 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 13:42:40,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2023-12-24 13:42:40,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 468. [2023-12-24 13:42:40,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 419 states have (on average 1.1288782816229117) internal successors, (473), 422 states have internal predecessors, (473), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-24 13:42:40,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 537 transitions. [2023-12-24 13:42:40,361 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 537 transitions. Word has length 159 [2023-12-24 13:42:40,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:42:40,361 INFO L495 AbstractCegarLoop]: Abstraction has 468 states and 537 transitions. [2023-12-24 13:42:40,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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 13:42:40,361 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 537 transitions. [2023-12-24 13:42:40,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-12-24 13:42:40,363 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:42:40,363 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:42:40,369 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 13:42:40,568 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 13:42:40,569 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:42:40,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:42:40,569 INFO L85 PathProgramCache]: Analyzing trace with hash 921136026, now seen corresponding path program 1 times [2023-12-24 13:42:40,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:42:40,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2082679025] [2023-12-24 13:42:40,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:42:40,570 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 13:42:40,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:42:40,571 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 13:42:40,592 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 13:42:40,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:42:40,765 INFO L262 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 13:42:40,768 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:42:40,783 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 13:42:40,795 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 514 trivial. 0 not checked. [2023-12-24 13:42:40,795 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:42:40,795 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:42:40,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2082679025] [2023-12-24 13:42:40,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2082679025] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:42:40,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:42:40,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 13:42:40,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827069175] [2023-12-24 13:42:40,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:42:40,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 13:42:40,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:42:40,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 13:42:40,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 13:42:40,797 INFO L87 Difference]: Start difference. First operand 468 states and 537 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 13:42:40,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:42:40,883 INFO L93 Difference]: Finished difference Result 697 states and 801 transitions. [2023-12-24 13:42:40,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 13:42:40,884 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 159 [2023-12-24 13:42:40,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:42:40,884 INFO L225 Difference]: With dead ends: 697 [2023-12-24 13:42:40,884 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 13:42:40,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 157 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 13:42:40,885 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 16 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 13:42:40,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 186 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 13:42:40,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 13:42:40,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 13:42:40,886 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 13:42:40,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 13:42:40,886 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 159 [2023-12-24 13:42:40,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:42:40,886 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 13:42:40,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 13:42:40,886 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 13:42:40,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 13:42:40,888 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 13:42:40,893 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 (34)] Ended with exit code 0 [2023-12-24 13:42:41,089 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 13:42:41,091 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 13:43:55,309 WARN L293 SmtUtils]: Spent 1.23m on a formula simplification. DAG size of input: 201 DAG size of output: 556 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 13:44:04,005 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-24 13:44:04,005 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-24 13:44:04,006 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-24 13:44:04,006 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-24 13:44:04,006 INFO L899 garLoopResultBuilder]: For program point L60(lines 60 64) no Hoare annotation was computed. [2023-12-24 13:44:04,006 INFO L899 garLoopResultBuilder]: For program point L60-2(lines 60 64) no Hoare annotation was computed. [2023-12-24 13:44:04,008 INFO L895 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: (let ((.cse4 (select |#memory_int#3| |~#signed_long_int_Array_0~0.base|))) (let ((.cse0 (bvsge (select .cse4 (_ bv4 32)) (_ bv1073741822 32))) (.cse2 (= (_ bv0 32) |~#signed_long_int_Array_0~0.offset|)) (.cse3 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet28#1_32| (_ BitVec 8))) (= (select (select |#memory_int#2| |~#signed_char_Array_0~0.base|) |~#signed_char_Array_0~0.offset|) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet28#1_32|))))) (or (let ((.cse1 ((_ sign_extend 24) (_ bv16 8)))) (and .cse0 (= .cse1 (select (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|) (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) .cse2 .cse3 (= ((_ extract 7 0) .cse1) ~last_1_unsigned_char_Array_0_1_~0))) (and .cse0 .cse2 (= ((_ sign_extend 16) ((_ extract 15 0) (select .cse4 (_ bv8 32)))) (select (select |#memory_int#4| |~#signed_short_int_Array_0~0.base|) |~#signed_short_int_Array_0~0.offset|)) .cse3)))) [2023-12-24 13:44:04,008 INFO L899 garLoopResultBuilder]: For program point L85-1(line 85) no Hoare annotation was computed. [2023-12-24 13:44:04,008 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-24 13:44:04,008 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-24 13:44:04,008 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-24 13:44:04,012 INFO L895 garLoopResultBuilder]: At program point L77(line 77) the Hoare annotation is: (let ((.cse8 (select (select |#memory_int#2| |~#signed_char_Array_0~0.base|) |~#signed_char_Array_0~0.offset|)) (.cse9 (select |#memory_int#3| |~#signed_long_int_Array_0~0.base|))) (let ((.cse2 (bvsge (select .cse9 (_ bv4 32)) (_ bv1073741822 32))) (.cse4 (select .cse9 |~#signed_long_int_Array_0~0.offset|)) (.cse6 (= (_ bv0 32) |~#signed_long_int_Array_0~0.offset|)) (.cse7 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet28#1_32| (_ BitVec 8))) (= .cse8 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet28#1_32|))))) (or (let ((.cse1 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (select .cse1 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse3 ((_ sign_extend 24) ((_ extract 7 0) .cse8))) (.cse5 ((_ sign_extend 24) (_ bv16 8)))) (and (= .cse0 ((_ sign_extend 24) ((_ extract 7 0) (select .cse1 |~#unsigned_char_Array_0~0.offset|)))) .cse2 (bvslt .cse3 .cse4) (= .cse5 .cse0) (not (bvsle ((_ zero_extend 24) ~last_1_unsigned_char_Array_0_1_~0) .cse3)) .cse6 .cse7 (= ((_ extract 7 0) .cse5) ~last_1_unsigned_char_Array_0_1_~0)))) (and (= ((_ sign_extend 16) ((_ extract 15 0) (select .cse9 (bvadd (_ bv8 32) |~#signed_long_int_Array_0~0.offset|)))) (select (select |#memory_int#4| |~#signed_short_int_Array_0~0.base|) |~#signed_short_int_Array_0~0.offset|)) .cse2 (= (select .cse9 (bvadd (_ bv4 32) |~#signed_long_int_Array_0~0.offset|)) .cse4) .cse6 .cse7)))) [2023-12-24 13:44:04,012 INFO L899 garLoopResultBuilder]: For program point L77-1(line 77) no Hoare annotation was computed. [2023-12-24 13:44:04,012 INFO L899 garLoopResultBuilder]: For program point L94(line 94) no Hoare annotation was computed. [2023-12-24 13:44:04,012 INFO L899 garLoopResultBuilder]: For program point L94-1(line 94) no Hoare annotation was computed. [2023-12-24 13:44:04,012 INFO L899 garLoopResultBuilder]: For program point L94-3(line 94) no Hoare annotation was computed. [2023-12-24 13:44:04,012 INFO L899 garLoopResultBuilder]: For program point L94-5(line 94) no Hoare annotation was computed. [2023-12-24 13:44:04,012 INFO L899 garLoopResultBuilder]: For program point L94-6(line 94) no Hoare annotation was computed. [2023-12-24 13:44:04,013 INFO L895 garLoopResultBuilder]: At program point L86(line 86) the Hoare annotation is: (let ((.cse4 (select |#memory_int#3| |~#signed_long_int_Array_0~0.base|))) (let ((.cse0 (bvsge (select .cse4 (_ bv4 32)) (_ bv1073741822 32))) (.cse2 (= (_ bv0 32) |~#signed_long_int_Array_0~0.offset|)) (.cse3 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet28#1_32| (_ BitVec 8))) (= (select (select |#memory_int#2| |~#signed_char_Array_0~0.base|) |~#signed_char_Array_0~0.offset|) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet28#1_32|))))) (or (let ((.cse1 ((_ sign_extend 24) (_ bv16 8)))) (and .cse0 (= .cse1 (select (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|) (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) .cse2 .cse3 (= ((_ extract 7 0) .cse1) ~last_1_unsigned_char_Array_0_1_~0))) (and .cse0 .cse2 (= ((_ sign_extend 16) ((_ extract 15 0) (select .cse4 (_ bv8 32)))) (select (select |#memory_int#4| |~#signed_short_int_Array_0~0.base|) |~#signed_short_int_Array_0~0.offset|)) .cse3)))) [2023-12-24 13:44:04,013 INFO L899 garLoopResultBuilder]: For program point L94-8(line 94) no Hoare annotation was computed. [2023-12-24 13:44:04,013 INFO L899 garLoopResultBuilder]: For program point L86-1(line 86) no Hoare annotation was computed. [2023-12-24 13:44:04,013 INFO L899 garLoopResultBuilder]: For program point L94-9(line 94) no Hoare annotation was computed. [2023-12-24 13:44:04,013 INFO L899 garLoopResultBuilder]: For program point L94-10(line 94) no Hoare annotation was computed. [2023-12-24 13:44:04,013 INFO L899 garLoopResultBuilder]: For program point L94-11(line 94) no Hoare annotation was computed. [2023-12-24 13:44:04,013 INFO L899 garLoopResultBuilder]: For program point L94-12(line 94) no Hoare annotation was computed. [2023-12-24 13:44:04,013 INFO L899 garLoopResultBuilder]: For program point L94-14(line 94) no Hoare annotation was computed. [2023-12-24 13:44:04,013 INFO L899 garLoopResultBuilder]: For program point L94-16(line 94) no Hoare annotation was computed. [2023-12-24 13:44:04,013 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 57) no Hoare annotation was computed. [2023-12-24 13:44:04,013 INFO L899 garLoopResultBuilder]: For program point L45-1(lines 45 57) no Hoare annotation was computed. [2023-12-24 13:44:04,013 INFO L899 garLoopResultBuilder]: For program point L94-18(line 94) no Hoare annotation was computed. [2023-12-24 13:44:04,013 INFO L899 garLoopResultBuilder]: For program point L94-20(line 94) no Hoare annotation was computed. [2023-12-24 13:44:04,013 INFO L899 garLoopResultBuilder]: For program point L94-21(line 94) no Hoare annotation was computed. [2023-12-24 13:44:04,013 INFO L899 garLoopResultBuilder]: For program point L94-22(line 94) no Hoare annotation was computed. [2023-12-24 13:44:04,014 INFO L899 garLoopResultBuilder]: For program point L94-23(line 94) no Hoare annotation was computed. [2023-12-24 13:44:04,014 INFO L899 garLoopResultBuilder]: For program point L94-25(line 94) no Hoare annotation was computed. [2023-12-24 13:44:04,014 INFO L899 garLoopResultBuilder]: For program point L94-27(line 94) no Hoare annotation was computed. [2023-12-24 13:44:04,014 INFO L899 garLoopResultBuilder]: For program point L94-28(line 94) no Hoare annotation was computed. [2023-12-24 13:44:04,014 INFO L899 garLoopResultBuilder]: For program point L94-30(line 94) no Hoare annotation was computed. [2023-12-24 13:44:04,014 INFO L899 garLoopResultBuilder]: For program point L94-32(line 94) no Hoare annotation was computed. [2023-12-24 13:44:04,014 INFO L899 garLoopResultBuilder]: For program point L94-33(line 94) no Hoare annotation was computed. [2023-12-24 13:44:04,014 INFO L899 garLoopResultBuilder]: For program point L94-35(line 94) no Hoare annotation was computed. [2023-12-24 13:44:04,014 INFO L899 garLoopResultBuilder]: For program point L94-36(line 94) no Hoare annotation was computed. [2023-12-24 13:44:04,014 INFO L899 garLoopResultBuilder]: For program point L94-38(line 94) no Hoare annotation was computed. [2023-12-24 13:44:04,014 INFO L895 garLoopResultBuilder]: At program point L79(line 79) the Hoare annotation is: (let ((.cse6 (select |#memory_int#3| |~#signed_long_int_Array_0~0.base|))) (let ((.cse7 (select .cse6 (_ bv4 32)))) (let ((.cse2 (bvsge .cse7 (_ bv1073741822 32))) (.cse4 (= (_ bv0 32) |~#signed_long_int_Array_0~0.offset|)) (.cse5 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet28#1_32| (_ BitVec 8))) (= (select (select |#memory_int#2| |~#signed_char_Array_0~0.base|) |~#signed_char_Array_0~0.offset|) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet28#1_32|))))) (or (let ((.cse1 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (select .cse1 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse3 ((_ sign_extend 24) (_ bv16 8)))) (and (= .cse0 ((_ sign_extend 24) ((_ extract 7 0) (select .cse1 |~#unsigned_char_Array_0~0.offset|)))) .cse2 (= .cse3 .cse0) .cse4 .cse5 (= ((_ extract 7 0) .cse3) ~last_1_unsigned_char_Array_0_1_~0)))) (and .cse2 (= (select .cse6 (_ bv0 32)) .cse7) .cse4 (= ((_ sign_extend 16) ((_ extract 15 0) (select .cse6 (_ bv8 32)))) (select (select |#memory_int#4| |~#signed_short_int_Array_0~0.base|) |~#signed_short_int_Array_0~0.offset|)) .cse5))))) [2023-12-24 13:44:04,014 INFO L899 garLoopResultBuilder]: For program point L79-1(line 79) no Hoare annotation was computed. [2023-12-24 13:44:04,014 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 54) no Hoare annotation was computed. [2023-12-24 13:44:04,014 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 13:44:04,014 INFO L899 garLoopResultBuilder]: For program point L63(line 63) no Hoare annotation was computed. [2023-12-24 13:44:04,014 INFO L899 garLoopResultBuilder]: For program point L63-2(line 63) no Hoare annotation was computed. [2023-12-24 13:44:04,015 INFO L895 garLoopResultBuilder]: At program point L80(line 80) the Hoare annotation is: (let ((.cse6 (select |#memory_int#3| |~#signed_long_int_Array_0~0.base|))) (let ((.cse7 (select .cse6 (_ bv4 32)))) (let ((.cse2 (bvsge .cse7 (_ bv1073741822 32))) (.cse4 (= (_ bv0 32) |~#signed_long_int_Array_0~0.offset|)) (.cse5 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet28#1_32| (_ BitVec 8))) (= (select (select |#memory_int#2| |~#signed_char_Array_0~0.base|) |~#signed_char_Array_0~0.offset|) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet28#1_32|))))) (or (let ((.cse1 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (select .cse1 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse3 ((_ sign_extend 24) (_ bv16 8)))) (and (= .cse0 ((_ sign_extend 24) ((_ extract 7 0) (select .cse1 |~#unsigned_char_Array_0~0.offset|)))) .cse2 (= .cse3 .cse0) .cse4 .cse5 (= ((_ extract 7 0) .cse3) ~last_1_unsigned_char_Array_0_1_~0)))) (and .cse2 (= (select .cse6 (_ bv0 32)) .cse7) .cse4 (= ((_ sign_extend 16) ((_ extract 15 0) (select .cse6 (_ bv8 32)))) (select (select |#memory_int#4| |~#signed_short_int_Array_0~0.base|) |~#signed_short_int_Array_0~0.offset|)) .cse5))))) [2023-12-24 13:44:04,015 INFO L899 garLoopResultBuilder]: For program point L80-1(line 80) no Hoare annotation was computed. [2023-12-24 13:44:04,015 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-24 13:44:04,015 INFO L895 garLoopResultBuilder]: At program point L82(line 82) the Hoare annotation is: (let ((.cse1 (select |#memory_int#3| |~#signed_long_int_Array_0~0.base|))) (let ((.cse0 (= (_ bv0 32) |~#signed_long_int_Array_0~0.offset|)) (.cse2 (= |ULTIMATE.start_updateVariables_#t~mem32#1| (select .cse1 (_ bv4 32)))) (.cse3 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet28#1_32| (_ BitVec 8))) (= (select (select |#memory_int#2| |~#signed_char_Array_0~0.base|) |~#signed_char_Array_0~0.offset|) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet28#1_32|))))) (or (and .cse0 (= ((_ sign_extend 16) ((_ extract 15 0) (select .cse1 (_ bv8 32)))) (select (select |#memory_int#4| |~#signed_short_int_Array_0~0.base|) |~#signed_short_int_Array_0~0.offset|)) .cse2 .cse3) (let ((.cse5 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|))) (let ((.cse4 (select .cse5 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse6 ((_ sign_extend 24) (_ bv16 8)))) (and (= .cse4 ((_ sign_extend 24) ((_ extract 7 0) (select .cse5 |~#unsigned_char_Array_0~0.offset|)))) (= .cse6 .cse4) .cse0 .cse2 .cse3 (= ((_ extract 7 0) .cse6) ~last_1_unsigned_char_Array_0_1_~0))))))) [2023-12-24 13:44:04,015 INFO L899 garLoopResultBuilder]: For program point L82-1(line 82) no Hoare annotation was computed. [2023-12-24 13:44:04,015 INFO L899 garLoopResultBuilder]: For program point L49(lines 49 53) no Hoare annotation was computed. [2023-12-24 13:44:04,015 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 72) no Hoare annotation was computed. [2023-12-24 13:44:04,015 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 13:44:04,015 INFO L895 garLoopResultBuilder]: At program point L83(line 83) the Hoare annotation is: (let ((.cse6 (select |#memory_int#3| |~#signed_long_int_Array_0~0.base|))) (let ((.cse2 (bvsge (select .cse6 (_ bv4 32)) (_ bv1073741822 32))) (.cse4 (= (_ bv0 32) |~#signed_long_int_Array_0~0.offset|)) (.cse5 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet28#1_32| (_ BitVec 8))) (= (select (select |#memory_int#2| |~#signed_char_Array_0~0.base|) |~#signed_char_Array_0~0.offset|) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet28#1_32|))))) (or (let ((.cse1 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (select .cse1 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse3 ((_ sign_extend 24) (_ bv16 8)))) (and (= .cse0 ((_ sign_extend 24) ((_ extract 7 0) (select .cse1 |~#unsigned_char_Array_0~0.offset|)))) .cse2 (= .cse3 .cse0) .cse4 .cse5 (= ((_ extract 7 0) .cse3) ~last_1_unsigned_char_Array_0_1_~0)))) (and .cse2 .cse4 (= ((_ sign_extend 16) ((_ extract 15 0) (select .cse6 (_ bv8 32)))) (select (select |#memory_int#4| |~#signed_short_int_Array_0~0.base|) |~#signed_short_int_Array_0~0.offset|)) .cse5)))) [2023-12-24 13:44:04,016 INFO L899 garLoopResultBuilder]: For program point L83-1(line 83) no Hoare annotation was computed. [2023-12-24 13:44:04,016 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 73) no Hoare annotation was computed. [2023-12-24 13:44:04,016 INFO L899 garLoopResultBuilder]: For program point L67(lines 67 71) no Hoare annotation was computed. [2023-12-24 13:44:04,016 INFO L895 garLoopResultBuilder]: At program point L100-2(lines 100 106) the Hoare annotation is: (let ((.cse8 (select (select |#memory_int#2| |~#signed_char_Array_0~0.base|) |~#signed_char_Array_0~0.offset|)) (.cse9 (select |#memory_int#3| |~#signed_long_int_Array_0~0.base|))) (let ((.cse2 (bvsge (select .cse9 (_ bv4 32)) (_ bv1073741822 32))) (.cse4 (select .cse9 |~#signed_long_int_Array_0~0.offset|)) (.cse6 (= (_ bv0 32) |~#signed_long_int_Array_0~0.offset|)) (.cse7 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet28#1_32| (_ BitVec 8))) (= .cse8 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet28#1_32|))))) (or (let ((.cse1 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (select .cse1 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse3 ((_ sign_extend 24) ((_ extract 7 0) .cse8))) (.cse5 ((_ sign_extend 24) (_ bv16 8)))) (and (= .cse0 ((_ sign_extend 24) ((_ extract 7 0) (select .cse1 |~#unsigned_char_Array_0~0.offset|)))) .cse2 (bvslt .cse3 .cse4) (= .cse5 .cse0) (not (= ((_ extract 7 0) (select (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|) |~#BOOL_unsigned_char_Array_0~0.offset|)) (_ bv0 8))) (not (bvsle ((_ zero_extend 24) ~last_1_unsigned_char_Array_0_1_~0) .cse3)) .cse6 .cse7 (= ((_ extract 7 0) .cse5) ~last_1_unsigned_char_Array_0_1_~0)))) (and (= ((_ sign_extend 16) ((_ extract 15 0) (select .cse9 (bvadd (_ bv8 32) |~#signed_long_int_Array_0~0.offset|)))) (select (select |#memory_int#4| |~#signed_short_int_Array_0~0.base|) |~#signed_short_int_Array_0~0.offset|)) .cse2 (= (select .cse9 (bvadd (_ bv4 32) |~#signed_long_int_Array_0~0.offset|)) .cse4) .cse6 .cse7)))) [2023-12-24 13:44:04,016 INFO L899 garLoopResultBuilder]: For program point L100-3(lines 100 106) no Hoare annotation was computed. [2023-12-24 13:44:04,016 INFO L895 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: (let ((.cse8 (select (select |#memory_int#2| |~#signed_char_Array_0~0.base|) |~#signed_char_Array_0~0.offset|)) (.cse9 (select |#memory_int#3| |~#signed_long_int_Array_0~0.base|))) (let ((.cse2 (bvsge (select .cse9 (_ bv4 32)) (_ bv1073741822 32))) (.cse4 (select .cse9 |~#signed_long_int_Array_0~0.offset|)) (.cse6 (= (_ bv0 32) |~#signed_long_int_Array_0~0.offset|)) (.cse7 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet28#1_32| (_ BitVec 8))) (= .cse8 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet28#1_32|))))) (or (let ((.cse1 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (select .cse1 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse3 ((_ sign_extend 24) ((_ extract 7 0) .cse8))) (.cse5 ((_ sign_extend 24) (_ bv16 8)))) (and (= .cse0 ((_ sign_extend 24) ((_ extract 7 0) (select .cse1 |~#unsigned_char_Array_0~0.offset|)))) .cse2 (bvslt .cse3 .cse4) (= .cse5 .cse0) (not (bvsle ((_ zero_extend 24) ~last_1_unsigned_char_Array_0_1_~0) .cse3)) .cse6 .cse7 (= ((_ extract 7 0) .cse5) ~last_1_unsigned_char_Array_0_1_~0)))) (and (= ((_ sign_extend 16) ((_ extract 15 0) (select .cse9 (bvadd (_ bv8 32) |~#signed_long_int_Array_0~0.offset|)))) (select (select |#memory_int#4| |~#signed_short_int_Array_0~0.base|) |~#signed_short_int_Array_0~0.offset|)) .cse2 (= (select .cse9 (bvadd (_ bv4 32) |~#signed_long_int_Array_0~0.offset|)) .cse4) .cse6 .cse7)))) [2023-12-24 13:44:04,016 INFO L899 garLoopResultBuilder]: For program point L76-1(line 76) no Hoare annotation was computed. [2023-12-24 13:44:04,016 INFO L899 garLoopResultBuilder]: For program point L68(lines 68 70) no Hoare annotation was computed. [2023-12-24 13:44:04,018 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] [2023-12-24 13:44:04,020 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 13:44:04,028 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_char_Array_0~0!base][~bvadd~32(~#unsigned_char_Array_0~0!offset, 1bv32)] could not be translated [2023-12-24 13:44:04,028 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_char_Array_0~0!base][~#unsigned_char_Array_0~0!offset] could not be translated [2023-12-24 13:44:04,033 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#signed_long_int_Array_0~0!base][4bv32] could not be translated [2023-12-24 13:44:04,033 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#signed_char_Array_0~0!base][~#signed_char_Array_0~0!offset] could not be translated [2023-12-24 13:44:04,034 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#signed_long_int_Array_0~0!base][~#signed_long_int_Array_0~0!offset] could not be translated [2023-12-24 13:44:04,034 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_char_Array_0~0!base][~bvadd~32(~#unsigned_char_Array_0~0!offset, 1bv32)] could not be translated [2023-12-24 13:44:04,034 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated [2023-12-24 13:44:04,035 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#signed_char_Array_0~0!base][~#signed_char_Array_0~0!offset] could not be translated [2023-12-24 13:44:04,035 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet28#1_32 : bv8 :: #memory_int#2[~#signed_char_Array_0~0!base][~#signed_char_Array_0~0!offset] == ~sign_extend~32~16(v_ULTIMATE.start_updateVariables_#t~nondet28#1_32)) could not be translated [2023-12-24 13:44:04,035 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#signed_long_int_Array_0~0!base][~bvadd~32(8bv32, ~#signed_long_int_Array_0~0!offset)] could not be translated [2023-12-24 13:44:04,035 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~#signed_short_int_Array_0~0!base][~#signed_short_int_Array_0~0!offset] could not be translated [2023-12-24 13:44:04,035 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#signed_long_int_Array_0~0!base][4bv32] could not be translated [2023-12-24 13:44:04,035 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#signed_long_int_Array_0~0!base][~bvadd~32(4bv32, ~#signed_long_int_Array_0~0!offset)] could not be translated [2023-12-24 13:44:04,035 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#signed_long_int_Array_0~0!base][~#signed_long_int_Array_0~0!offset] could not be translated [2023-12-24 13:44:04,035 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet28#1_32 : bv8 :: #memory_int#2[~#signed_char_Array_0~0!base][~#signed_char_Array_0~0!offset] == ~sign_extend~32~16(v_ULTIMATE.start_updateVariables_#t~nondet28#1_32)) could not be translated [2023-12-24 13:44:04,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 01:44:04 BoogieIcfgContainer [2023-12-24 13:44:04,036 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 13:44:04,036 INFO L158 Benchmark]: Toolchain (without parser) took 114642.45ms. Allocated memory was 263.2MB in the beginning and 659.6MB in the end (delta: 396.4MB). Free memory was 210.8MB in the beginning and 408.2MB in the end (delta: -197.4MB). Peak memory consumption was 386.3MB. Max. memory is 8.0GB. [2023-12-24 13:44:04,036 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 202.4MB. Free memory is still 152.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 13:44:04,037 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.08ms. Allocated memory is still 263.2MB. Free memory was 210.8MB in the beginning and 196.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-24 13:44:04,037 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.16ms. Allocated memory is still 263.2MB. Free memory was 196.1MB in the beginning and 193.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-24 13:44:04,037 INFO L158 Benchmark]: Boogie Preprocessor took 72.34ms. Allocated memory is still 263.2MB. Free memory was 193.0MB in the beginning and 188.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-24 13:44:04,037 INFO L158 Benchmark]: RCFGBuilder took 548.98ms. Allocated memory is still 263.2MB. Free memory was 188.6MB in the beginning and 211.7MB in the end (delta: -23.2MB). Peak memory consumption was 22.7MB. Max. memory is 8.0GB. [2023-12-24 13:44:04,037 INFO L158 Benchmark]: TraceAbstraction took 113730.83ms. Allocated memory was 263.2MB in the beginning and 659.6MB in the end (delta: 396.4MB). Free memory was 211.2MB in the beginning and 408.2MB in the end (delta: -197.0MB). Peak memory consumption was 385.6MB. Max. memory is 8.0GB. [2023-12-24 13:44:04,038 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.43ms. Allocated memory is still 202.4MB. Free memory is still 152.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 240.08ms. Allocated memory is still 263.2MB. Free memory was 210.8MB in the beginning and 196.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.16ms. Allocated memory is still 263.2MB. Free memory was 196.1MB in the beginning and 193.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 72.34ms. Allocated memory is still 263.2MB. Free memory was 193.0MB in the beginning and 188.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 548.98ms. Allocated memory is still 263.2MB. Free memory was 188.6MB in the beginning and 211.7MB in the end (delta: -23.2MB). Peak memory consumption was 22.7MB. Max. memory is 8.0GB. * TraceAbstraction took 113730.83ms. Allocated memory was 263.2MB in the beginning and 659.6MB in the end (delta: 396.4MB). Free memory was 211.2MB in the beginning and 408.2MB in the end (delta: -197.0MB). Peak memory consumption was 385.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_char_Array_0~0!base][~bvadd~32(~#unsigned_char_Array_0~0!offset, 1bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_char_Array_0~0!base][~#unsigned_char_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#signed_long_int_Array_0~0!base][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#signed_char_Array_0~0!base][~#signed_char_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#signed_long_int_Array_0~0!base][~#signed_long_int_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_char_Array_0~0!base][~bvadd~32(~#unsigned_char_Array_0~0!offset, 1bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#signed_char_Array_0~0!base][~#signed_char_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet28#1_32 : bv8 :: #memory_int#2[~#signed_char_Array_0~0!base][~#signed_char_Array_0~0!offset] == ~sign_extend~32~16(v_ULTIMATE.start_updateVariables_#t~nondet28#1_32)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#signed_long_int_Array_0~0!base][~bvadd~32(8bv32, ~#signed_long_int_Array_0~0!offset)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~#signed_short_int_Array_0~0!base][~#signed_short_int_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#signed_long_int_Array_0~0!base][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#signed_long_int_Array_0~0!base][~bvadd~32(4bv32, ~#signed_long_int_Array_0~0!offset)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#signed_long_int_Array_0~0!base][~#signed_long_int_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet28#1_32 : bv8 :: #memory_int#2[~#signed_char_Array_0~0!base][~#signed_char_Array_0~0!offset] == ~sign_extend~32~16(v_ULTIMATE.start_updateVariables_#t~nondet28#1_32)) 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: 113.7s, OverallIterations: 32, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 82.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4518 SdHoareTripleChecker+Valid, 6.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4513 mSDsluCounter, 13661 SdHoareTripleChecker+Invalid, 5.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10531 mSDsCounter, 245 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4609 IncrementalHoareTripleChecker+Invalid, 4854 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 245 mSolverCounterUnsat, 3130 mSDtfsCounter, 4609 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4008 GetRequests, 3620 SyntacticMatches, 5 SemanticMatches, 383 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1340 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=638occurred in iteration=22, InterpolantAutomatonStates: 305, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 32 MinimizatonAttempts, 2479 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 523 PreInvPairs, 560 NumberOfFragments, 875 HoareAnnotationTreeSize, 523 FormulaSimplifications, 11406660 FormulaSimplificationTreeSizeReduction, 74.9s HoareSimplificationTime, 10 FormulaSimplificationsInter, 502705 FormulaSimplificationTreeSizeReductionInter, 8.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 2904 NumberOfCodeBlocks, 2904 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 3791 ConstructedInterpolants, 219 QuantifiedInterpolants, 18845 SizeOfPredicates, 250 NumberOfNonLiveVariables, 6968 ConjunctsInSsa, 362 ConjunctsInUnsatCore, 43 InterpolantComputations, 31 PerfectInterpolantSequences, 7504/7681 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: 100]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2023-12-24 13:44:04,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...