/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-18.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 12:57:35,059 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 12:57:35,094 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 12:57:35,097 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 12:57:35,097 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 12:57:35,110 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 12:57:35,110 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 12:57:35,111 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 12:57:35,111 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 12:57:35,111 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 12:57:35,111 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 12:57:35,112 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 12:57:35,112 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 12:57:35,112 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 12:57:35,112 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 12:57:35,113 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 12:57:35,113 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 12:57:35,113 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 12:57:35,113 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 12:57:35,114 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 12:57:35,114 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 12:57:35,114 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 12:57:35,114 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 12:57:35,115 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 12:57:35,115 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 12:57:35,115 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 12:57:35,115 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 12:57:35,116 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 12:57:35,116 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 12:57:35,116 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 12:57:35,116 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 12:57:35,117 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 12:57:35,117 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 12:57:35,117 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 12:57:35,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 12:57:35,117 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 12:57:35,118 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 12:57:35,118 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 12:57:35,118 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 12:57:35,118 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 12:57:35,119 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 12:57:35,119 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 12:57:35,119 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 12:57:35,119 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 12:57:35,120 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 12:57:35,120 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 12:57:35,120 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 12:57:35,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 12:57:35,286 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 12:57:35,288 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 12:57:35,288 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 12:57:35,289 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 12:57:35,291 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-18.i [2023-12-24 12:57:36,296 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 12:57:36,416 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 12:57:36,417 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-18.i [2023-12-24 12:57:36,423 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b45b402fe/767efa0e29d44518b2c5817105bc4425/FLAG3d2a9f03e [2023-12-24 12:57:36,431 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b45b402fe/767efa0e29d44518b2c5817105bc4425 [2023-12-24 12:57:36,433 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 12:57:36,434 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 12:57:36,435 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 12:57:36,435 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 12:57:36,438 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 12:57:36,438 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 12:57:36" (1/1) ... [2023-12-24 12:57:36,439 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fb900ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:57:36, skipping insertion in model container [2023-12-24 12:57:36,439 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 12:57:36" (1/1) ... [2023-12-24 12:57:36,460 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 12:57:36,551 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-18.i[916,929] [2023-12-24 12:57:36,582 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 12:57:36,592 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 12:57:36,600 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-18.i[916,929] [2023-12-24 12:57:36,625 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 12:57:36,641 INFO L206 MainTranslator]: Completed translation [2023-12-24 12:57:36,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:57:36 WrapperNode [2023-12-24 12:57:36,641 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 12:57:36,642 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 12:57:36,642 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 12:57:36,642 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 12:57:36,650 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:57:36" (1/1) ... [2023-12-24 12:57:36,673 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:57:36" (1/1) ... [2023-12-24 12:57:36,703 INFO L138 Inliner]: procedures = 36, calls = 143, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 440 [2023-12-24 12:57:36,704 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 12:57:36,704 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 12:57:36,704 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 12:57:36,704 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 12:57:36,716 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:57:36" (1/1) ... [2023-12-24 12:57:36,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:57:36" (1/1) ... [2023-12-24 12:57:36,721 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:57:36" (1/1) ... [2023-12-24 12:57:36,742 INFO L175 MemorySlicer]: Split 115 memory accesses to 6 slices as follows [2, 6, 29, 22, 46, 10]. 40 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 3, 2, 3, 1]. The 13 writes are split as follows [0, 1, 4, 2, 4, 2]. [2023-12-24 12:57:36,742 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:57:36" (1/1) ... [2023-12-24 12:57:36,742 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:57:36" (1/1) ... [2023-12-24 12:57:36,757 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:57:36" (1/1) ... [2023-12-24 12:57:36,760 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:57:36" (1/1) ... [2023-12-24 12:57:36,762 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:57:36" (1/1) ... [2023-12-24 12:57:36,764 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:57:36" (1/1) ... [2023-12-24 12:57:36,769 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 12:57:36,769 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 12:57:36,769 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 12:57:36,769 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 12:57:36,770 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:57:36" (1/1) ... [2023-12-24 12:57:36,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 12:57:36,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 12:57:36,796 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 12:57:36,813 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 12:57:36,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 12:57:36,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-12-24 12:57:36,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-12-24 12:57:36,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-12-24 12:57:36,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-12-24 12:57:36,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2023-12-24 12:57:36,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2023-12-24 12:57:36,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2023-12-24 12:57:36,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2023-12-24 12:57:36,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2023-12-24 12:57:36,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2023-12-24 12:57:36,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2023-12-24 12:57:36,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2023-12-24 12:57:36,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 12:57:36,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 12:57:36,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-24 12:57:36,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-24 12:57:36,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-12-24 12:57:36,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2023-12-24 12:57:36,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2023-12-24 12:57:36,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2023-12-24 12:57:36,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2023-12-24 12:57:36,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2023-12-24 12:57:36,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2023-12-24 12:57:36,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2023-12-24 12:57:36,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2023-12-24 12:57:36,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2023-12-24 12:57:36,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2023-12-24 12:57:36,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2023-12-24 12:57:36,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2023-12-24 12:57:36,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2023-12-24 12:57:36,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-24 12:57:36,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-24 12:57:36,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-24 12:57:36,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-12-24 12:57:36,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2023-12-24 12:57:36,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2023-12-24 12:57:36,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2023-12-24 12:57:36,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2023-12-24 12:57:36,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2023-12-24 12:57:36,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2023-12-24 12:57:36,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2023-12-24 12:57:36,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2023-12-24 12:57:36,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2023-12-24 12:57:36,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2023-12-24 12:57:36,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2023-12-24 12:57:36,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2023-12-24 12:57:36,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2023-12-24 12:57:36,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2023-12-24 12:57:36,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2023-12-24 12:57:36,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2023-12-24 12:57:36,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2023-12-24 12:57:36,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2023-12-24 12:57:36,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2023-12-24 12:57:36,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2023-12-24 12:57:36,829 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 12:57:36,829 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 12:57:36,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 12:57:36,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 12:57:36,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-12-24 12:57:36,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-12-24 12:57:36,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2023-12-24 12:57:36,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2023-12-24 12:57:36,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2023-12-24 12:57:36,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2023-12-24 12:57:36,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2023-12-24 12:57:36,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2023-12-24 12:57:36,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2023-12-24 12:57:36,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2023-12-24 12:57:36,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2023-12-24 12:57:36,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2023-12-24 12:57:36,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-24 12:57:36,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-24 12:57:36,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-24 12:57:36,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-12-24 12:57:36,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-12-24 12:57:36,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2023-12-24 12:57:36,986 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 12:57:36,988 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 12:57:37,717 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 12:57:37,739 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 12:57:37,740 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 12:57:37,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 12:57:37 BoogieIcfgContainer [2023-12-24 12:57:37,740 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 12:57:37,741 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 12:57:37,741 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 12:57:37,743 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 12:57:37,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 12:57:36" (1/3) ... [2023-12-24 12:57:37,752 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fd5b1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 12:57:37, skipping insertion in model container [2023-12-24 12:57:37,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:57:36" (2/3) ... [2023-12-24 12:57:37,752 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fd5b1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 12:57:37, skipping insertion in model container [2023-12-24 12:57:37,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 12:57:37" (3/3) ... [2023-12-24 12:57:37,753 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-18.i [2023-12-24 12:57:37,764 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 12:57:37,764 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 12:57:37,796 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 12:57:37,800 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;@3691e7f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 12:57:37,800 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 12:57:37,803 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 70 states have (on average 1.4714285714285715) internal successors, (103), 71 states have internal predecessors, (103), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-24 12:57:37,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-24 12:57:37,811 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:57:37,811 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:37,811 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:57:37,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:57:37,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1840276238, now seen corresponding path program 1 times [2023-12-24 12:57:37,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:57:37,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [45880059] [2023-12-24 12:57:37,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:57:37,823 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 12:57:37,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:57:37,829 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 12:57:37,840 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 12:57:38,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:57:38,098 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 12:57:38,103 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:57:38,137 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2023-12-24 12:57:38,137 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 12:57:38,137 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:57:38,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [45880059] [2023-12-24 12:57:38,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [45880059] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 12:57:38,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 12:57:38,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 12:57:38,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228058511] [2023-12-24 12:57:38,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:57:38,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 12:57:38,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:57:38,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 12:57:38,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 12:57:38,163 INFO L87 Difference]: Start difference. First operand has 85 states, 70 states have (on average 1.4714285714285715) internal successors, (103), 71 states have internal predecessors, (103), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-24 12:57:38,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:57:38,212 INFO L93 Difference]: Finished difference Result 167 states and 264 transitions. [2023-12-24 12:57:38,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 12:57:38,214 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 98 [2023-12-24 12:57:38,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:57:38,219 INFO L225 Difference]: With dead ends: 167 [2023-12-24 12:57:38,219 INFO L226 Difference]: Without dead ends: 83 [2023-12-24 12:57:38,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 97 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 12:57:38,230 INFO L413 NwaCegarLoop]: 118 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, 118 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 12:57:38,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 12:57:38,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-12-24 12:57:38,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-12-24 12:57:38,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 69 states have (on average 1.4202898550724639) internal successors, (98), 69 states have internal predecessors, (98), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-24 12:57:38,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 122 transitions. [2023-12-24 12:57:38,265 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 122 transitions. Word has length 98 [2023-12-24 12:57:38,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:57:38,266 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 122 transitions. [2023-12-24 12:57:38,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-24 12:57:38,266 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 122 transitions. [2023-12-24 12:57:38,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-24 12:57:38,273 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:57:38,274 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:38,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-24 12:57:38,474 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 12:57:38,475 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:57:38,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:57:38,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1929259934, now seen corresponding path program 1 times [2023-12-24 12:57:38,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:57:38,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1913862646] [2023-12-24 12:57:38,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:57:38,476 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 12:57:38,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:57:38,477 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 12:57:38,478 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 12:57:38,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:57:38,665 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 12:57:38,668 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:57:38,710 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2023-12-24 12:57:38,711 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 12:57:38,711 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:57:38,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1913862646] [2023-12-24 12:57:38,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1913862646] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 12:57:38,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 12:57:38,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 12:57:38,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007137271] [2023-12-24 12:57:38,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:57:38,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 12:57:38,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:57:38,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 12:57:38,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 12:57:38,714 INFO L87 Difference]: Start difference. First operand 83 states and 122 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-24 12:57:38,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:57:38,785 INFO L93 Difference]: Finished difference Result 171 states and 252 transitions. [2023-12-24 12:57:38,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 12:57:38,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 98 [2023-12-24 12:57:38,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:57:38,788 INFO L225 Difference]: With dead ends: 171 [2023-12-24 12:57:38,788 INFO L226 Difference]: Without dead ends: 89 [2023-12-24 12:57:38,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 95 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 12:57:38,791 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 10 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 12:57:38,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 346 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 12:57:38,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-24 12:57:38,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2023-12-24 12:57:38,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 71 states have (on average 1.408450704225352) internal successors, (100), 71 states have internal predecessors, (100), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-24 12:57:38,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 124 transitions. [2023-12-24 12:57:38,797 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 124 transitions. Word has length 98 [2023-12-24 12:57:38,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:57:38,798 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 124 transitions. [2023-12-24 12:57:38,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-24 12:57:38,798 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 124 transitions. [2023-12-24 12:57:38,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-24 12:57:38,799 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:57:38,799 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:38,807 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 12:57:38,999 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 12:57:39,000 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:57:39,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:57:39,000 INFO L85 PathProgramCache]: Analyzing trace with hash -486576416, now seen corresponding path program 1 times [2023-12-24 12:57:39,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:57:39,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [402527846] [2023-12-24 12:57:39,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:57:39,001 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 12:57:39,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:57:39,002 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 12:57:39,004 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 12:57:39,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:57:39,187 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 12:57:39,194 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:57:39,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2023-12-24 12:57:39,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-24 12:57:39,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-24 12:57:39,457 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2023-12-24 12:57:39,457 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 12:57:39,570 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:57:39,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [402527846] [2023-12-24 12:57:39,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [402527846] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 12:57:39,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1233610569] [2023-12-24 12:57:39,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:57:39,571 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 12:57:39,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 12:57:39,605 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 12:57:39,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2023-12-24 12:57:39,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:57:39,973 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-24 12:57:39,977 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:57:40,075 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 12:57:40,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-12-24 12:57:40,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2023-12-24 12:57:40,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-24 12:57:40,580 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 149 proven. 15 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-12-24 12:57:40,580 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 12:57:40,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1233610569] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 12:57:40,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 12:57:40,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2023-12-24 12:57:40,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108319091] [2023-12-24 12:57:40,613 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 12:57:40,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-24 12:57:40,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:57:40,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-24 12:57:40,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2023-12-24 12:57:40,616 INFO L87 Difference]: Start difference. First operand 85 states and 124 transitions. Second operand has 14 states, 12 states have (on average 6.583333333333333) internal successors, (79), 13 states have internal predecessors, (79), 6 states have call successors, (24), 5 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2023-12-24 12:57:42,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:57:42,654 INFO L93 Difference]: Finished difference Result 265 states and 380 transitions. [2023-12-24 12:57:42,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-24 12:57:42,655 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.583333333333333) internal successors, (79), 13 states have internal predecessors, (79), 6 states have call successors, (24), 5 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) Word has length 98 [2023-12-24 12:57:42,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:57:42,656 INFO L225 Difference]: With dead ends: 265 [2023-12-24 12:57:42,657 INFO L226 Difference]: Without dead ends: 181 [2023-12-24 12:57:42,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 221 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=224, Invalid=768, Unknown=0, NotChecked=0, Total=992 [2023-12-24 12:57:42,658 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 385 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-24 12:57:42,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 771 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-24 12:57:42,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-12-24 12:57:42,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 175. [2023-12-24 12:57:42,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 146 states have (on average 1.3904109589041096) internal successors, (203), 146 states have internal predecessors, (203), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-24 12:57:42,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 251 transitions. [2023-12-24 12:57:42,674 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 251 transitions. Word has length 98 [2023-12-24 12:57:42,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:57:42,675 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 251 transitions. [2023-12-24 12:57:42,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.583333333333333) internal successors, (79), 13 states have internal predecessors, (79), 6 states have call successors, (24), 5 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2023-12-24 12:57:42,675 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 251 transitions. [2023-12-24 12:57:42,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-24 12:57:42,676 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:57:42,676 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:42,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-24 12:57:42,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2023-12-24 12:57:43,096 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,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 12:57:43,096 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:57:43,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:57:43,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1497693666, now seen corresponding path program 1 times [2023-12-24 12:57:43,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:57:43,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [5581310] [2023-12-24 12:57:43,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:57:43,098 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 12:57:43,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:57:43,099 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 12:57:43,100 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 12:57:43,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:57:43,278 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-24 12:57:43,281 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:57:43,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2023-12-24 12:57:43,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-24 12:57:43,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-24 12:57:43,552 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2023-12-24 12:57:43,552 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 12:57:43,725 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:57:43,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [5581310] [2023-12-24 12:57:43,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [5581310] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 12:57:43,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [278474060] [2023-12-24 12:57:43,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:57:43,726 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 12:57:43,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 12:57:43,727 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 12:57:43,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2023-12-24 12:57:44,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:57:44,116 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-24 12:57:44,119 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:57:44,218 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 12:57:44,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-12-24 12:57:44,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2023-12-24 12:57:44,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-24 12:57:44,716 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 149 proven. 15 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-12-24 12:57:44,716 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 12:57:44,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [278474060] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 12:57:44,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 12:57:44,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 15 [2023-12-24 12:57:44,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974352529] [2023-12-24 12:57:44,750 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 12:57:44,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-24 12:57:44,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:57:44,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-24 12:57:44,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2023-12-24 12:57:44,751 INFO L87 Difference]: Start difference. First operand 175 states and 251 transitions. Second operand has 15 states, 13 states have (on average 6.076923076923077) internal successors, (79), 14 states have internal predecessors, (79), 6 states have call successors, (24), 5 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2023-12-24 12:57:47,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:57:47,517 INFO L93 Difference]: Finished difference Result 269 states and 381 transitions. [2023-12-24 12:57:47,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-24 12:57:47,518 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.076923076923077) internal successors, (79), 14 states have internal predecessors, (79), 6 states have call successors, (24), 5 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) Word has length 98 [2023-12-24 12:57:47,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:57:47,519 INFO L225 Difference]: With dead ends: 269 [2023-12-24 12:57:47,519 INFO L226 Difference]: Without dead ends: 181 [2023-12-24 12:57:47,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 218 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=242, Invalid=948, Unknown=0, NotChecked=0, Total=1190 [2023-12-24 12:57:47,520 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 508 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-12-24 12:57:47,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 1001 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-12-24 12:57:47,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-12-24 12:57:47,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 175. [2023-12-24 12:57:47,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 146 states have (on average 1.3835616438356164) internal successors, (202), 146 states have internal predecessors, (202), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-24 12:57:47,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 250 transitions. [2023-12-24 12:57:47,537 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 250 transitions. Word has length 98 [2023-12-24 12:57:47,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:57:47,537 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 250 transitions. [2023-12-24 12:57:47,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.076923076923077) internal successors, (79), 14 states have internal predecessors, (79), 6 states have call successors, (24), 5 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2023-12-24 12:57:47,538 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 250 transitions. [2023-12-24 12:57:47,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-24 12:57:47,538 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:57:47,539 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:47,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2023-12-24 12:57:47,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-24 12:57:47,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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 12:57:47,947 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:57:47,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:57:47,948 INFO L85 PathProgramCache]: Analyzing trace with hash 173868325, now seen corresponding path program 1 times [2023-12-24 12:57:47,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:57:47,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1100907483] [2023-12-24 12:57:47,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:57:47,948 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 12:57:47,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:57:47,949 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 12:57:47,950 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 12:57:48,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:57:48,144 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-24 12:57:48,146 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:57:48,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2023-12-24 12:57:48,308 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 19 [2023-12-24 12:57:48,345 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-24 12:57:48,345 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 12:57:48,345 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:57:48,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1100907483] [2023-12-24 12:57:48,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1100907483] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 12:57:48,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 12:57:48,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-24 12:57:48,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251928494] [2023-12-24 12:57:48,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:57:48,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-24 12:57:48,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:57:48,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-24 12:57:48,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-24 12:57:48,347 INFO L87 Difference]: Start difference. First operand 175 states and 250 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-24 12:57:50,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:57:50,156 INFO L93 Difference]: Finished difference Result 399 states and 572 transitions. [2023-12-24 12:57:50,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 12:57:50,157 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 99 [2023-12-24 12:57:50,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:57:50,158 INFO L225 Difference]: With dead ends: 399 [2023-12-24 12:57:50,158 INFO L226 Difference]: Without dead ends: 225 [2023-12-24 12:57:50,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2023-12-24 12:57:50,159 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 225 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-24 12:57:50,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 462 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-24 12:57:50,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2023-12-24 12:57:50,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 181. [2023-12-24 12:57:50,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 152 states have (on average 1.368421052631579) internal successors, (208), 152 states have internal predecessors, (208), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-24 12:57:50,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 256 transitions. [2023-12-24 12:57:50,173 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 256 transitions. Word has length 99 [2023-12-24 12:57:50,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:57:50,173 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 256 transitions. [2023-12-24 12:57:50,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-24 12:57:50,173 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 256 transitions. [2023-12-24 12:57:50,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-24 12:57:50,174 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:57:50,174 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:50,192 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 12:57:50,379 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 12:57:50,379 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:57:50,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:57:50,380 INFO L85 PathProgramCache]: Analyzing trace with hash 566895335, now seen corresponding path program 1 times [2023-12-24 12:57:50,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:57:50,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1636394226] [2023-12-24 12:57:50,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:57:50,380 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 12:57:50,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:57:50,381 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 12:57:50,403 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 12:57:50,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:57:50,545 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 12:57:50,548 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:57:50,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2023-12-24 12:57:50,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-24 12:57:50,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-24 12:57:50,778 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2023-12-24 12:57:50,778 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 12:57:50,895 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:57:50,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1636394226] [2023-12-24 12:57:50,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1636394226] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 12:57:50,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1178215381] [2023-12-24 12:57:50,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:57:50,895 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 12:57:50,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 12:57:50,896 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 12:57:50,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2023-12-24 12:57:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:57:51,278 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-24 12:57:51,282 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:57:51,371 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 12:57:51,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-12-24 12:57:51,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2023-12-24 12:57:51,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-24 12:57:51,724 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2023-12-24 12:57:51,725 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 12:57:51,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1178215381] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 12:57:51,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 12:57:51,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-12-24 12:57:51,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507818081] [2023-12-24 12:57:51,764 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 12:57:51,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-24 12:57:51,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:57:51,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-24 12:57:51,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2023-12-24 12:57:51,765 INFO L87 Difference]: Start difference. First operand 181 states and 256 transitions. Second operand has 13 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 13 states have internal predecessors, (80), 6 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2023-12-24 12:57:54,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:57:54,055 INFO L93 Difference]: Finished difference Result 275 states and 384 transitions. [2023-12-24 12:57:54,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-24 12:57:54,056 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 13 states have internal predecessors, (80), 6 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) Word has length 99 [2023-12-24 12:57:54,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:57:54,057 INFO L225 Difference]: With dead ends: 275 [2023-12-24 12:57:54,057 INFO L226 Difference]: Without dead ends: 185 [2023-12-24 12:57:54,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 226 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=202, Invalid=728, Unknown=0, NotChecked=0, Total=930 [2023-12-24 12:57:54,058 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 335 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-24 12:57:54,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 1019 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-24 12:57:54,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2023-12-24 12:57:54,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 179. [2023-12-24 12:57:54,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 150 states have (on average 1.36) internal successors, (204), 150 states have internal predecessors, (204), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-24 12:57:54,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 252 transitions. [2023-12-24 12:57:54,070 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 252 transitions. Word has length 99 [2023-12-24 12:57:54,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:57:54,070 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 252 transitions. [2023-12-24 12:57:54,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 13 states have internal predecessors, (80), 6 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2023-12-24 12:57:54,070 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 252 transitions. [2023-12-24 12:57:54,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-24 12:57:54,071 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:57:54,071 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:54,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-24 12:57:54,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2023-12-24 12:57:54,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 12:57:54,476 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:57:54,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:57:54,477 INFO L85 PathProgramCache]: Analyzing trace with hash -14698680, now seen corresponding path program 1 times [2023-12-24 12:57:54,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:57:54,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [773444863] [2023-12-24 12:57:54,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:57:54,477 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 12:57:54,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:57:54,478 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 12:57:54,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-24 12:57:54,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:57:54,642 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 12:57:54,644 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:57:54,826 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-24 12:57:54,827 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 12:57:54,827 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:57:54,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [773444863] [2023-12-24 12:57:54,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [773444863] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 12:57:54,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 12:57:54,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 12:57:54,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018247605] [2023-12-24 12:57:54,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:57:54,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 12:57:54,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:57:54,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 12:57:54,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 12:57:54,828 INFO L87 Difference]: Start difference. First operand 179 states and 252 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-24 12:57:55,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:57:55,578 INFO L93 Difference]: Finished difference Result 357 states and 501 transitions. [2023-12-24 12:57:55,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 12:57:55,579 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 100 [2023-12-24 12:57:55,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:57:55,580 INFO L225 Difference]: With dead ends: 357 [2023-12-24 12:57:55,580 INFO L226 Difference]: Without dead ends: 179 [2023-12-24 12:57:55,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 97 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 12:57:55,581 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 67 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-24 12:57:55,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 355 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-24 12:57:55,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2023-12-24 12:57:55,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2023-12-24 12:57:55,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 148 states have (on average 1.3513513513513513) internal successors, (200), 148 states have internal predecessors, (200), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-24 12:57:55,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 248 transitions. [2023-12-24 12:57:55,592 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 248 transitions. Word has length 100 [2023-12-24 12:57:55,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:57:55,592 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 248 transitions. [2023-12-24 12:57:55,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-24 12:57:55,593 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 248 transitions. [2023-12-24 12:57:55,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-24 12:57:55,593 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:57:55,593 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:55,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-24 12:57:55,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 12:57:55,799 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:57:55,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:57:55,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1283699455, now seen corresponding path program 1 times [2023-12-24 12:57:55,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:57:55,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [748722091] [2023-12-24 12:57:55,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:57:55,800 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 12:57:55,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:57:55,801 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 12:57:55,801 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 12:57:55,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:57:55,975 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 12:57:55,977 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:57:56,185 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-24 12:57:56,186 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 12:57:56,186 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:57:56,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [748722091] [2023-12-24 12:57:56,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [748722091] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 12:57:56,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 12:57:56,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 12:57:56,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577645325] [2023-12-24 12:57:56,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:57:56,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 12:57:56,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:57:56,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 12:57:56,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 12:57:56,187 INFO L87 Difference]: Start difference. First operand 177 states and 248 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-24 12:57:57,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:57:57,057 INFO L93 Difference]: Finished difference Result 353 states and 493 transitions. [2023-12-24 12:57:57,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 12:57:57,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 101 [2023-12-24 12:57:57,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:57:57,060 INFO L225 Difference]: With dead ends: 353 [2023-12-24 12:57:57,060 INFO L226 Difference]: Without dead ends: 177 [2023-12-24 12:57:57,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 98 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 12:57:57,062 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 91 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-24 12:57:57,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 379 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-24 12:57:57,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-12-24 12:57:57,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 89. [2023-12-24 12:57:57,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 74 states have (on average 1.337837837837838) internal successors, (99), 74 states have internal predecessors, (99), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-24 12:57:57,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 123 transitions. [2023-12-24 12:57:57,075 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 123 transitions. Word has length 101 [2023-12-24 12:57:57,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:57:57,078 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 123 transitions. [2023-12-24 12:57:57,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-24 12:57:57,078 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 123 transitions. [2023-12-24 12:57:57,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-24 12:57:57,079 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:57:57,079 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:57,090 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 12:57:57,288 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 12:57:57,288 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:57:57,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:57:57,289 INFO L85 PathProgramCache]: Analyzing trace with hash 21285011, now seen corresponding path program 1 times [2023-12-24 12:57:57,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:57:57,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [383961024] [2023-12-24 12:57:57,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:57:57,289 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 12:57:57,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:57:57,290 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 12:57:57,312 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 12:57:57,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:57:57,455 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 12:57:57,457 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:57:57,480 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-24 12:57:57,481 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 12:57:57,481 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:57:57,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [383961024] [2023-12-24 12:57:57,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [383961024] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 12:57:57,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 12:57:57,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 12:57:57,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744613572] [2023-12-24 12:57:57,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:57:57,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 12:57:57,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:57:57,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 12:57:57,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 12:57:57,482 INFO L87 Difference]: Start difference. First operand 89 states and 123 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-24 12:57:57,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:57:57,555 INFO L93 Difference]: Finished difference Result 194 states and 270 transitions. [2023-12-24 12:57:57,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 12:57:57,556 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 101 [2023-12-24 12:57:57,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:57:57,557 INFO L225 Difference]: With dead ends: 194 [2023-12-24 12:57:57,557 INFO L226 Difference]: Without dead ends: 106 [2023-12-24 12:57:57,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 97 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 12:57:57,557 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 62 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 12:57:57,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 431 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 12:57:57,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-12-24 12:57:57,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 92. [2023-12-24 12:57:57,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 77 states have (on average 1.3246753246753247) internal successors, (102), 77 states have internal predecessors, (102), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-24 12:57:57,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 126 transitions. [2023-12-24 12:57:57,564 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 126 transitions. Word has length 101 [2023-12-24 12:57:57,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:57:57,564 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 126 transitions. [2023-12-24 12:57:57,564 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-24 12:57:57,565 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 126 transitions. [2023-12-24 12:57:57,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-24 12:57:57,565 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:57:57,565 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:57,574 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 12:57:57,774 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 12:57:57,774 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:57:57,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:57:57,775 INFO L85 PathProgramCache]: Analyzing trace with hash -83708696, now seen corresponding path program 1 times [2023-12-24 12:57:57,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:57:57,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2140188810] [2023-12-24 12:57:57,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:57:57,775 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 12:57:57,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:57:57,776 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 12:57:57,777 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 12:57:57,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:57:57,939 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 12:57:57,940 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:57:57,963 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-24 12:57:57,964 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 12:57:57,964 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:57:57,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2140188810] [2023-12-24 12:57:57,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2140188810] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 12:57:57,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 12:57:57,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 12:57:57,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333202343] [2023-12-24 12:57:57,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:57:57,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 12:57:57,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:57:57,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 12:57:57,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 12:57:57,966 INFO L87 Difference]: Start difference. First operand 92 states and 126 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-24 12:57:58,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:57:58,052 INFO L93 Difference]: Finished difference Result 192 states and 264 transitions. [2023-12-24 12:57:58,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 12:57:58,054 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2023-12-24 12:57:58,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:57:58,055 INFO L225 Difference]: With dead ends: 192 [2023-12-24 12:57:58,055 INFO L226 Difference]: Without dead ends: 101 [2023-12-24 12:57:58,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 99 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 12:57:58,056 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 44 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 12:57:58,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 422 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 12:57:58,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-12-24 12:57:58,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2023-12-24 12:57:58,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 80 states have (on average 1.3125) internal successors, (105), 80 states have internal predecessors, (105), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-24 12:57:58,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 129 transitions. [2023-12-24 12:57:58,062 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 129 transitions. Word has length 103 [2023-12-24 12:57:58,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:57:58,062 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 129 transitions. [2023-12-24 12:57:58,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-24 12:57:58,063 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 129 transitions. [2023-12-24 12:57:58,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-24 12:57:58,063 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:57:58,063 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:58,070 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 12:57:58,263 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 12:57:58,264 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:57:58,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:57:58,264 INFO L85 PathProgramCache]: Analyzing trace with hash 453102254, now seen corresponding path program 1 times [2023-12-24 12:57:58,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:57:58,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1247057630] [2023-12-24 12:57:58,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:57:58,265 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 12:57:58,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:57:58,266 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 12:57:58,271 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 12:57:58,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:57:58,439 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-24 12:57:58,441 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:57:58,545 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 35 treesize of output 23 [2023-12-24 12:57:58,549 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 49 treesize of output 25 [2023-12-24 12:57:58,585 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-24 12:57:58,585 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 12:57:58,585 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:57:58,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1247057630] [2023-12-24 12:57:58,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1247057630] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 12:57:58,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 12:57:58,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 12:57:58,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420419620] [2023-12-24 12:57:58,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:57:58,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 12:57:58,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:57:58,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 12:57:58,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-24 12:57:58,586 INFO L87 Difference]: Start difference. First operand 95 states and 129 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-24 12:57:59,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:57:59,622 INFO L93 Difference]: Finished difference Result 247 states and 334 transitions. [2023-12-24 12:57:59,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 12:57:59,623 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2023-12-24 12:57:59,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:57:59,623 INFO L225 Difference]: With dead ends: 247 [2023-12-24 12:57:59,624 INFO L226 Difference]: Without dead ends: 153 [2023-12-24 12:57:59,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-24 12:57:59,624 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 95 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-24 12:57:59,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 347 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-24 12:57:59,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-12-24 12:57:59,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 150. [2023-12-24 12:57:59,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 128 states have (on average 1.3046875) internal successors, (167), 129 states have internal predecessors, (167), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-24 12:57:59,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 203 transitions. [2023-12-24 12:57:59,634 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 203 transitions. Word has length 103 [2023-12-24 12:57:59,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:57:59,635 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 203 transitions. [2023-12-24 12:57:59,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-24 12:57:59,635 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 203 transitions. [2023-12-24 12:57:59,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-24 12:57:59,635 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:57:59,635 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:59,643 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 (15)] Ended with exit code 0 [2023-12-24 12:57:59,840 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 12:57:59,841 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:57:59,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:57:59,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1260948422, now seen corresponding path program 1 times [2023-12-24 12:57:59,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:57:59,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [699777227] [2023-12-24 12:57:59,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:57:59,841 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 12:57:59,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:57:59,842 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 12:57:59,844 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 12:58:00,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:58:00,017 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 12:58:00,019 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:58:00,311 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 12:58:01,501 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-24 12:58:01,501 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 12:58:01,501 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:58:01,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [699777227] [2023-12-24 12:58:01,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [699777227] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 12:58:01,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 12:58:01,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 12:58:01,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127556663] [2023-12-24 12:58:01,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:58:01,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 12:58:01,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:58:01,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 12:58:01,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-24 12:58:01,503 INFO L87 Difference]: Start difference. First operand 150 states and 203 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-24 12:58:05,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 12:58:09,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 12:58:13,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 12:58:15,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 12:58:17,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 12:58:18,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 12:58:24,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 12:58:27,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 12:58:31,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 12:58:33,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:58:33,487 INFO L93 Difference]: Finished difference Result 722 states and 970 transitions. [2023-12-24 12:58:33,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-24 12:58:33,488 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2023-12-24 12:58:33,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:58:33,490 INFO L225 Difference]: With dead ends: 722 [2023-12-24 12:58:33,490 INFO L226 Difference]: Without dead ends: 573 [2023-12-24 12:58:33,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=66, Invalid=143, Unknown=1, NotChecked=0, Total=210 [2023-12-24 12:58:33,491 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 379 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 35 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.3s IncrementalHoareTripleChecker+Time [2023-12-24 12:58:33,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 691 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 292 Invalid, 3 Unknown, 0 Unchecked, 29.3s Time] [2023-12-24 12:58:33,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2023-12-24 12:58:33,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 433. [2023-12-24 12:58:33,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 380 states have (on average 1.2947368421052632) internal successors, (492), 384 states have internal predecessors, (492), 44 states have call successors, (44), 8 states have call predecessors, (44), 8 states have return successors, (44), 40 states have call predecessors, (44), 44 states have call successors, (44) [2023-12-24 12:58:33,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 580 transitions. [2023-12-24 12:58:33,517 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 580 transitions. Word has length 105 [2023-12-24 12:58:33,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:58:33,517 INFO L495 AbstractCegarLoop]: Abstraction has 433 states and 580 transitions. [2023-12-24 12:58:33,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-24 12:58:33,518 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 580 transitions. [2023-12-24 12:58:33,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-24 12:58:33,518 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:58:33,518 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:58:33,530 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 12:58:33,723 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 12:58:33,724 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:58:33,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:58:33,724 INFO L85 PathProgramCache]: Analyzing trace with hash 481311932, now seen corresponding path program 1 times [2023-12-24 12:58:33,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:58:33,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1601870615] [2023-12-24 12:58:33,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:58:33,725 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 12:58:33,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:58:33,725 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 12:58:33,726 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 12:58:33,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:58:33,907 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-24 12:58:33,909 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:58:33,914 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 12:58:34,004 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-24 12:58:34,005 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 12:58:34,005 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:58:34,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1601870615] [2023-12-24 12:58:34,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1601870615] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 12:58:34,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 12:58:34,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 12:58:34,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657761856] [2023-12-24 12:58:34,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:58:34,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 12:58:34,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:58:34,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 12:58:34,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-24 12:58:34,006 INFO L87 Difference]: Start difference. First operand 433 states and 580 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-24 12:58:34,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:58:34,856 INFO L93 Difference]: Finished difference Result 568 states and 758 transitions. [2023-12-24 12:58:34,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 12:58:34,860 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2023-12-24 12:58:34,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:58:34,863 INFO L225 Difference]: With dead ends: 568 [2023-12-24 12:58:34,863 INFO L226 Difference]: Without dead ends: 566 [2023-12-24 12:58:34,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-24 12:58:34,867 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 86 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-24 12:58:34,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 625 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-24 12:58:34,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2023-12-24 12:58:34,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 469. [2023-12-24 12:58:34,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 416 states have (on average 1.2932692307692308) internal successors, (538), 420 states have internal predecessors, (538), 44 states have call successors, (44), 8 states have call predecessors, (44), 8 states have return successors, (44), 40 states have call predecessors, (44), 44 states have call successors, (44) [2023-12-24 12:58:34,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 626 transitions. [2023-12-24 12:58:34,917 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 626 transitions. Word has length 105 [2023-12-24 12:58:34,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:58:34,917 INFO L495 AbstractCegarLoop]: Abstraction has 469 states and 626 transitions. [2023-12-24 12:58:34,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-24 12:58:34,917 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 626 transitions. [2023-12-24 12:58:34,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-24 12:58:34,918 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:58:34,918 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:58:34,928 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 12:58:35,123 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 12:58:35,124 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:58:35,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:58:35,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1283151059, now seen corresponding path program 1 times [2023-12-24 12:58:35,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:58:35,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1347879664] [2023-12-24 12:58:35,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:58:35,124 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 12:58:35,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:58:35,125 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 12:58:35,126 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 12:58:35,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:58:35,314 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 12:58:35,316 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:58:35,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 22 treesize of output 10 [2023-12-24 12:58:35,475 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2023-12-24 12:58:35,475 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 12:58:35,588 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:58:35,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1347879664] [2023-12-24 12:58:35,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1347879664] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 12:58:35,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [332135642] [2023-12-24 12:58:35,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:58:35,588 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 12:58:35,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 12:58:35,589 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 12:58:35,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2023-12-24 12:58:36,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:58:36,230 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-24 12:58:36,232 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:58:36,320 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 12:58:36,778 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 14 [2023-12-24 12:58:36,800 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 149 proven. 15 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-12-24 12:58:36,800 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 12:58:36,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [332135642] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 12:58:36,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 12:58:36,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2023-12-24 12:58:36,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096845575] [2023-12-24 12:58:36,865 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 12:58:36,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-24 12:58:36,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:58:36,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-24 12:58:36,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2023-12-24 12:58:36,866 INFO L87 Difference]: Start difference. First operand 469 states and 626 transitions. Second operand has 13 states, 11 states have (on average 8.181818181818182) internal successors, (90), 12 states have internal predecessors, (90), 6 states have call successors, (24), 5 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2023-12-24 12:58:38,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:58:38,348 INFO L93 Difference]: Finished difference Result 754 states and 994 transitions. [2023-12-24 12:58:38,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 12:58:38,352 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 8.181818181818182) internal successors, (90), 12 states have internal predecessors, (90), 6 states have call successors, (24), 5 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) Word has length 105 [2023-12-24 12:58:38,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:58:38,366 INFO L225 Difference]: With dead ends: 754 [2023-12-24 12:58:38,366 INFO L226 Difference]: Without dead ends: 286 [2023-12-24 12:58:38,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 249 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2023-12-24 12:58:38,368 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 147 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-24 12:58:38,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 402 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-24 12:58:38,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2023-12-24 12:58:38,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 276. [2023-12-24 12:58:38,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 240 states have (on average 1.2416666666666667) internal successors, (298), 241 states have internal predecessors, (298), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-24 12:58:38,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 354 transitions. [2023-12-24 12:58:38,401 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 354 transitions. Word has length 105 [2023-12-24 12:58:38,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:58:38,402 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 354 transitions. [2023-12-24 12:58:38,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 8.181818181818182) internal successors, (90), 12 states have internal predecessors, (90), 6 states have call successors, (24), 5 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2023-12-24 12:58:38,402 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 354 transitions. [2023-12-24 12:58:38,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-24 12:58:38,402 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:58:38,403 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:58:38,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Forceful destruction successful, exit code 0 [2023-12-24 12:58:38,618 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 12:58:38,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 12:58:38,816 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:58:38,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:58:38,817 INFO L85 PathProgramCache]: Analyzing trace with hash -926659019, now seen corresponding path program 1 times [2023-12-24 12:58:38,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:58:38,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1796838970] [2023-12-24 12:58:38,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:58:38,817 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 12:58:38,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:58:38,819 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 12:58:38,848 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 12:58:39,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:58:39,030 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-24 12:58:39,032 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:58:39,055 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 12:58:39,612 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:58:39,612 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 12:58:39,654 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2023-12-24 12:58:39,654 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 12:58:40,214 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:58:40,215 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 45 treesize of output 25 [2023-12-24 12:58:40,354 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:58:40,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1796838970] [2023-12-24 12:58:40,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1796838970] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 12:58:40,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1275417592] [2023-12-24 12:58:40,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:58:40,355 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 12:58:40,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 12:58:40,356 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 12:58:40,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2023-12-24 12:58:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:58:40,838 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-24 12:58:40,841 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:58:40,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-24 12:58:41,232 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 12:58:42,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:58:42,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 19 [2023-12-24 12:58:42,173 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2023-12-24 12:58:42,173 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 12:58:42,685 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 19 [2023-12-24 12:58:43,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1275417592] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 12:58:43,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 12:58:43,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2023-12-24 12:58:43,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676115616] [2023-12-24 12:58:43,190 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 12:58:43,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-24 12:58:43,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:58:43,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-24 12:58:43,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=670, Unknown=0, NotChecked=0, Total=812 [2023-12-24 12:58:43,192 INFO L87 Difference]: Start difference. First operand 276 states and 354 transitions. Second operand has 19 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 18 states have internal predecessors, (103), 6 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2023-12-24 12:58:50,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:58:50,539 INFO L93 Difference]: Finished difference Result 790 states and 1005 transitions. [2023-12-24 12:58:50,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-24 12:58:50,540 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 18 states have internal predecessors, (103), 6 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) Word has length 106 [2023-12-24 12:58:50,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:58:50,543 INFO L225 Difference]: With dead ends: 790 [2023-12-24 12:58:50,543 INFO L226 Difference]: Without dead ends: 515 [2023-12-24 12:58:50,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 310 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=491, Invalid=1765, Unknown=0, NotChecked=0, Total=2256 [2023-12-24 12:58:50,546 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 323 mSDsluCounter, 1321 mSDsCounter, 0 mSdLazyCounter, 1152 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 1428 SdHoareTripleChecker+Invalid, 1217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2023-12-24 12:58:50,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 1428 Invalid, 1217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1152 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2023-12-24 12:58:50,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2023-12-24 12:58:50,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 396. [2023-12-24 12:58:50,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 344 states have (on average 1.2267441860465116) internal successors, (422), 345 states have internal predecessors, (422), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-24 12:58:50,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 502 transitions. [2023-12-24 12:58:50,574 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 502 transitions. Word has length 106 [2023-12-24 12:58:50,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:58:50,574 INFO L495 AbstractCegarLoop]: Abstraction has 396 states and 502 transitions. [2023-12-24 12:58:50,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 18 states have internal predecessors, (103), 6 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2023-12-24 12:58:50,574 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 502 transitions. [2023-12-24 12:58:50,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-24 12:58:50,575 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:58:50,575 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:58:50,583 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 12:58:50,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2023-12-24 12:58:50,981 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,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 12:58:50,981 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:58:50,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:58:50,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1174203222, now seen corresponding path program 1 times [2023-12-24 12:58:50,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:58:50,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1067242217] [2023-12-24 12:58:50,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:58:50,982 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 12:58:50,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:58:50,983 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 12:58:50,984 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 12:58:51,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:58:51,222 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-24 12:58:51,224 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:58:51,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 40 [2023-12-24 12:58:51,758 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:58:51,758 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 74 treesize of output 36 [2023-12-24 12:58:51,880 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-24 12:58:51,880 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 12:58:51,880 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:58:51,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1067242217] [2023-12-24 12:58:51,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1067242217] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 12:58:51,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 12:58:51,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 12:58:51,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072080641] [2023-12-24 12:58:51,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:58:51,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 12:58:51,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:58:51,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 12:58:51,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-24 12:58:51,881 INFO L87 Difference]: Start difference. First operand 396 states and 502 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-24 12:58:55,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:58:55,756 INFO L93 Difference]: Finished difference Result 930 states and 1166 transitions. [2023-12-24 12:58:55,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 12:58:55,757 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2023-12-24 12:58:55,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:58:55,761 INFO L225 Difference]: With dead ends: 930 [2023-12-24 12:58:55,761 INFO L226 Difference]: Without dead ends: 535 [2023-12-24 12:58:55,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-12-24 12:58:55,762 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 193 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-12-24 12:58:55,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 639 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2023-12-24 12:58:55,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2023-12-24 12:58:55,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 450. [2023-12-24 12:58:55,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 398 states have (on average 1.2010050251256281) internal successors, (478), 399 states have internal predecessors, (478), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-24 12:58:55,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 558 transitions. [2023-12-24 12:58:55,791 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 558 transitions. Word has length 107 [2023-12-24 12:58:55,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:58:55,792 INFO L495 AbstractCegarLoop]: Abstraction has 450 states and 558 transitions. [2023-12-24 12:58:55,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-24 12:58:55,792 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 558 transitions. [2023-12-24 12:58:55,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-24 12:58:55,792 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:58:55,792 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:58:55,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2023-12-24 12:58:55,999 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 12:58:55,999 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:58:56,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:58:56,000 INFO L85 PathProgramCache]: Analyzing trace with hash 549259549, now seen corresponding path program 1 times [2023-12-24 12:58:56,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:58:56,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1594457929] [2023-12-24 12:58:56,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:58:56,000 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 12:58:56,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:58:56,001 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 12:58:56,006 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 12:58:56,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:58:56,201 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 12:58:56,206 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:58:56,216 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 12:58:56,346 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-24 12:58:56,346 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 12:58:56,347 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:58:56,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1594457929] [2023-12-24 12:58:56,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1594457929] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 12:58:56,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 12:58:56,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-24 12:58:56,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481055235] [2023-12-24 12:58:56,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:58:56,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 12:58:56,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:58:56,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 12:58:56,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-24 12:58:56,348 INFO L87 Difference]: Start difference. First operand 450 states and 558 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-24 12:58:57,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:58:57,248 INFO L93 Difference]: Finished difference Result 513 states and 638 transitions. [2023-12-24 12:58:57,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 12:58:57,270 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2023-12-24 12:58:57,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:58:57,272 INFO L225 Difference]: With dead ends: 513 [2023-12-24 12:58:57,272 INFO L226 Difference]: Without dead ends: 511 [2023-12-24 12:58:57,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-12-24 12:58:57,273 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 80 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-24 12:58:57,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 712 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-24 12:58:57,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2023-12-24 12:58:57,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 465. [2023-12-24 12:58:57,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 413 states have (on average 1.1985472154963681) internal successors, (495), 414 states have internal predecessors, (495), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-24 12:58:57,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 575 transitions. [2023-12-24 12:58:57,299 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 575 transitions. Word has length 108 [2023-12-24 12:58:57,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:58:57,299 INFO L495 AbstractCegarLoop]: Abstraction has 465 states and 575 transitions. [2023-12-24 12:58:57,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-24 12:58:57,300 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 575 transitions. [2023-12-24 12:58:57,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-24 12:58:57,300 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:58:57,300 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:58:57,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2023-12-24 12:58:57,506 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 12:58:57,507 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:58:57,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:58:57,507 INFO L85 PathProgramCache]: Analyzing trace with hash 860855363, now seen corresponding path program 1 times [2023-12-24 12:58:57,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:58:57,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1670601169] [2023-12-24 12:58:57,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:58:57,508 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 12:58:57,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:58:57,508 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 12:58:57,509 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 12:58:57,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:58:57,716 INFO L262 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-24 12:58:57,719 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:58:58,802 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2023-12-24 12:58:58,803 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 12:58:59,004 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-24 12:58:59,004 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:58:59,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1670601169] [2023-12-24 12:58:59,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1670601169] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 12:58:59,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 12:58:59,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2023-12-24 12:58:59,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179734472] [2023-12-24 12:58:59,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:58:59,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 12:58:59,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:58:59,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 12:58:59,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-12-24 12:58:59,006 INFO L87 Difference]: Start difference. First operand 465 states and 575 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-24 12:59:00,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:59:00,121 INFO L93 Difference]: Finished difference Result 1114 states and 1367 transitions. [2023-12-24 12:59:00,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 12:59:00,122 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2023-12-24 12:59:00,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:59:00,123 INFO L225 Difference]: With dead ends: 1114 [2023-12-24 12:59:00,123 INFO L226 Difference]: Without dead ends: 650 [2023-12-24 12:59:00,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-12-24 12:59:00,124 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 32 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-24 12:59:00,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 470 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-24 12:59:00,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2023-12-24 12:59:00,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 640. [2023-12-24 12:59:00,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 576 states have (on average 1.1788194444444444) internal successors, (679), 581 states have internal predecessors, (679), 48 states have call successors, (48), 15 states have call predecessors, (48), 15 states have return successors, (48), 43 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-24 12:59:00,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 775 transitions. [2023-12-24 12:59:00,160 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 775 transitions. Word has length 110 [2023-12-24 12:59:00,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:59:00,160 INFO L495 AbstractCegarLoop]: Abstraction has 640 states and 775 transitions. [2023-12-24 12:59:00,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-24 12:59:00,161 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 775 transitions. [2023-12-24 12:59:00,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-24 12:59:00,161 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:59:00,161 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:59:00,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2023-12-24 12:59:00,367 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 12:59:00,367 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:59:00,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:59:00,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1510883899, now seen corresponding path program 1 times [2023-12-24 12:59:00,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:59:00,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [300615311] [2023-12-24 12:59:00,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:59:00,368 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 12:59:00,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:59:00,369 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 12:59:00,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-12-24 12:59:00,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:59:00,558 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-24 12:59:00,560 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:59:00,832 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 53 proven. 30 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2023-12-24 12:59:00,832 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 12:59:00,949 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-24 12:59:00,949 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:59:00,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [300615311] [2023-12-24 12:59:00,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [300615311] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 12:59:00,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 12:59:00,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2023-12-24 12:59:00,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807050188] [2023-12-24 12:59:00,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:59:00,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 12:59:00,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:59:00,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 12:59:00,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-12-24 12:59:00,950 INFO L87 Difference]: Start difference. First operand 640 states and 775 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-24 12:59:02,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:59:02,024 INFO L93 Difference]: Finished difference Result 1364 states and 1639 transitions. [2023-12-24 12:59:02,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 12:59:02,025 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2023-12-24 12:59:02,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:59:02,027 INFO L225 Difference]: With dead ends: 1364 [2023-12-24 12:59:02,027 INFO L226 Difference]: Without dead ends: 725 [2023-12-24 12:59:02,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 210 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 12:59:02,028 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 24 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-24 12:59:02,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 469 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-24 12:59:02,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2023-12-24 12:59:02,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 704. [2023-12-24 12:59:02,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 640 states have (on average 1.1609375) internal successors, (743), 645 states have internal predecessors, (743), 48 states have call successors, (48), 15 states have call predecessors, (48), 15 states have return successors, (48), 43 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-24 12:59:02,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 839 transitions. [2023-12-24 12:59:02,093 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 839 transitions. Word has length 110 [2023-12-24 12:59:02,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:59:02,093 INFO L495 AbstractCegarLoop]: Abstraction has 704 states and 839 transitions. [2023-12-24 12:59:02,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-24 12:59:02,094 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 839 transitions. [2023-12-24 12:59:02,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-24 12:59:02,094 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:59:02,094 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:59:02,104 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 12:59:02,302 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 12:59:02,302 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:59:02,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:59:02,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1179554549, now seen corresponding path program 1 times [2023-12-24 12:59:02,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:59:02,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1653071826] [2023-12-24 12:59:02,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:59:02,303 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 12:59:02,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:59:02,304 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 12:59:02,305 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 12:59:02,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:59:02,533 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-24 12:59:02,536 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:59:02,541 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 12:59:02,544 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 12:59:02,557 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 21 treesize of output 21 [2023-12-24 12:59:02,655 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:59:02,655 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 37 treesize of output 17 [2023-12-24 12:59:02,757 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-24 12:59:02,757 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 12:59:02,757 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:59:02,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1653071826] [2023-12-24 12:59:02,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1653071826] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 12:59:02,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 12:59:02,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-24 12:59:02,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052573349] [2023-12-24 12:59:02,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:59:02,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-24 12:59:02,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:59:02,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-24 12:59:02,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-12-24 12:59:02,758 INFO L87 Difference]: Start difference. First operand 704 states and 839 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-24 12:59:03,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:59:03,624 INFO L93 Difference]: Finished difference Result 1848 states and 2219 transitions. [2023-12-24 12:59:03,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-24 12:59:03,624 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2023-12-24 12:59:03,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:59:03,627 INFO L225 Difference]: With dead ends: 1848 [2023-12-24 12:59:03,627 INFO L226 Difference]: Without dead ends: 1345 [2023-12-24 12:59:03,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2023-12-24 12:59:03,629 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 212 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-24 12:59:03,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 1238 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-24 12:59:03,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2023-12-24 12:59:03,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1149. [2023-12-24 12:59:03,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 1057 states have (on average 1.1665089877010406) internal successors, (1233), 1066 states have internal predecessors, (1233), 68 states have call successors, (68), 23 states have call predecessors, (68), 23 states have return successors, (68), 59 states have call predecessors, (68), 68 states have call successors, (68) [2023-12-24 12:59:03,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1369 transitions. [2023-12-24 12:59:03,695 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1369 transitions. Word has length 110 [2023-12-24 12:59:03,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:59:03,695 INFO L495 AbstractCegarLoop]: Abstraction has 1149 states and 1369 transitions. [2023-12-24 12:59:03,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-24 12:59:03,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1369 transitions. [2023-12-24 12:59:03,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-24 12:59:03,696 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:59:03,696 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:59:03,707 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 12:59:03,902 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 12:59:03,903 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:59:03,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:59:03,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1859612919, now seen corresponding path program 1 times [2023-12-24 12:59:03,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:59:03,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [83079219] [2023-12-24 12:59:03,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:59:03,903 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 12:59:03,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:59:03,904 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 12:59:03,905 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 12:59:04,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:59:04,123 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 12:59:04,125 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:59:04,129 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 12:59:04,133 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 12:59:04,161 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:59:04,161 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 37 treesize of output 24 [2023-12-24 12:59:04,210 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:59:04,210 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 36 treesize of output 16 [2023-12-24 12:59:04,231 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-24 12:59:04,232 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 12:59:04,232 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:59:04,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [83079219] [2023-12-24 12:59:04,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [83079219] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 12:59:04,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 12:59:04,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 12:59:04,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815302798] [2023-12-24 12:59:04,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:59:04,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 12:59:04,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:59:04,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 12:59:04,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 12:59:04,233 INFO L87 Difference]: Start difference. First operand 1149 states and 1369 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-24 12:59:04,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:59:04,569 INFO L93 Difference]: Finished difference Result 2546 states and 3043 transitions. [2023-12-24 12:59:04,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 12:59:04,570 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2023-12-24 12:59:04,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:59:04,574 INFO L225 Difference]: With dead ends: 2546 [2023-12-24 12:59:04,574 INFO L226 Difference]: Without dead ends: 1679 [2023-12-24 12:59:04,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 106 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 12:59:04,575 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 101 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 12:59:04,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 591 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 12:59:04,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2023-12-24 12:59:04,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 1287. [2023-12-24 12:59:04,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1287 states, 1195 states have (on average 1.1673640167364017) internal successors, (1395), 1204 states have internal predecessors, (1395), 68 states have call successors, (68), 23 states have call predecessors, (68), 23 states have return successors, (68), 59 states have call predecessors, (68), 68 states have call successors, (68) [2023-12-24 12:59:04,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 1531 transitions. [2023-12-24 12:59:04,649 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 1531 transitions. Word has length 110 [2023-12-24 12:59:04,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:59:04,649 INFO L495 AbstractCegarLoop]: Abstraction has 1287 states and 1531 transitions. [2023-12-24 12:59:04,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-24 12:59:04,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1531 transitions. [2023-12-24 12:59:04,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-24 12:59:04,650 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:59:04,650 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:59:04,662 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 (27)] Forceful destruction successful, exit code 0 [2023-12-24 12:59:04,860 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 12:59:04,860 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:59:04,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:59:04,861 INFO L85 PathProgramCache]: Analyzing trace with hash 670081459, now seen corresponding path program 1 times [2023-12-24 12:59:04,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:59:04,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [307932020] [2023-12-24 12:59:04,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:59:04,861 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 12:59:04,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:59:04,862 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 12:59:04,876 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 12:59:05,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:59:05,112 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 12:59:05,114 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:59:05,118 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 12:59:05,120 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 12:59:05,149 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:59:05,149 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 38 treesize of output 25 [2023-12-24 12:59:05,204 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:59:05,204 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 37 treesize of output 17 [2023-12-24 12:59:05,233 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-24 12:59:05,233 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 12:59:05,233 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:59:05,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [307932020] [2023-12-24 12:59:05,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [307932020] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 12:59:05,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 12:59:05,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 12:59:05,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19474488] [2023-12-24 12:59:05,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:59:05,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 12:59:05,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:59:05,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 12:59:05,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 12:59:05,234 INFO L87 Difference]: Start difference. First operand 1287 states and 1531 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-24 12:59:05,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:59:05,644 INFO L93 Difference]: Finished difference Result 2686 states and 3220 transitions. [2023-12-24 12:59:05,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 12:59:05,656 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2023-12-24 12:59:05,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:59:05,660 INFO L225 Difference]: With dead ends: 2686 [2023-12-24 12:59:05,660 INFO L226 Difference]: Without dead ends: 1681 [2023-12-24 12:59:05,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 106 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 12:59:05,662 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 104 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 12:59:05,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 467 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 12:59:05,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1681 states. [2023-12-24 12:59:05,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1681 to 1326. [2023-12-24 12:59:05,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1326 states, 1229 states have (on average 1.1635475996745321) internal successors, (1430), 1237 states have internal predecessors, (1430), 70 states have call successors, (70), 26 states have call predecessors, (70), 26 states have return successors, (70), 62 states have call predecessors, (70), 70 states have call successors, (70) [2023-12-24 12:59:05,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 1570 transitions. [2023-12-24 12:59:05,731 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 1570 transitions. Word has length 110 [2023-12-24 12:59:05,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:59:05,731 INFO L495 AbstractCegarLoop]: Abstraction has 1326 states and 1570 transitions. [2023-12-24 12:59:05,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-24 12:59:05,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 1570 transitions. [2023-12-24 12:59:05,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-24 12:59:05,732 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:59:05,732 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:59:05,743 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 (28)] Forceful destruction successful, exit code 0 [2023-12-24 12:59:05,938 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 12:59:05,939 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:59:05,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:59:05,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1350139829, now seen corresponding path program 1 times [2023-12-24 12:59:05,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:59:05,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1364438240] [2023-12-24 12:59:05,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:59:05,939 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 12:59:05,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:59:05,940 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 12:59:05,975 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 12:59:06,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:59:06,233 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-24 12:59:06,235 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:59:06,240 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 12:59:06,325 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 34 treesize of output 27 [2023-12-24 12:59:06,549 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:59:06,550 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 46 treesize of output 22 [2023-12-24 12:59:06,657 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2023-12-24 12:59:06,658 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 12:59:06,658 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:59:06,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1364438240] [2023-12-24 12:59:06,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1364438240] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 12:59:06,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 12:59:06,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-24 12:59:06,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117646396] [2023-12-24 12:59:06,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:59:06,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-24 12:59:06,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:59:06,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-24 12:59:06,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-24 12:59:06,659 INFO L87 Difference]: Start difference. First operand 1326 states and 1570 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-24 12:59:08,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:59:08,038 INFO L93 Difference]: Finished difference Result 2732 states and 3254 transitions. [2023-12-24 12:59:08,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-24 12:59:08,049 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2023-12-24 12:59:08,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:59:08,052 INFO L225 Difference]: With dead ends: 2732 [2023-12-24 12:59:08,052 INFO L226 Difference]: Without dead ends: 1732 [2023-12-24 12:59:08,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2023-12-24 12:59:08,054 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 277 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 1146 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-24 12:59:08,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 1146 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-24 12:59:08,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1732 states. [2023-12-24 12:59:08,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1732 to 1558. [2023-12-24 12:59:08,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1558 states, 1427 states have (on average 1.1632796075683252) internal successors, (1660), 1439 states have internal predecessors, (1660), 94 states have call successors, (94), 36 states have call predecessors, (94), 36 states have return successors, (94), 82 states have call predecessors, (94), 94 states have call successors, (94) [2023-12-24 12:59:08,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 1848 transitions. [2023-12-24 12:59:08,130 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 1848 transitions. Word has length 110 [2023-12-24 12:59:08,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:59:08,130 INFO L495 AbstractCegarLoop]: Abstraction has 1558 states and 1848 transitions. [2023-12-24 12:59:08,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-24 12:59:08,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 1848 transitions. [2023-12-24 12:59:08,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2023-12-24 12:59:08,133 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:59:08,133 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 12:59:08,139 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 12:59:08,338 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 12:59:08,339 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:59:08,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:59:08,339 INFO L85 PathProgramCache]: Analyzing trace with hash 362859096, now seen corresponding path program 1 times [2023-12-24 12:59:08,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:59:08,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1364415966] [2023-12-24 12:59:08,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:59:08,340 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 12:59:08,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:59:08,340 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 12:59:08,341 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 12:59:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:59:08,637 INFO L262 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 12:59:08,641 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:59:08,798 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 12:59:08,967 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 12:59:09,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-24 12:59:09,615 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 12:59:09,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1157 backedges. 467 proven. 320 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2023-12-24 12:59:09,667 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 12:59:09,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1157 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 1135 trivial. 0 not checked. [2023-12-24 12:59:09,847 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:59:09,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1364415966] [2023-12-24 12:59:09,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1364415966] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 12:59:09,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 12:59:09,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2023-12-24 12:59:09,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078156408] [2023-12-24 12:59:09,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:59:09,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 12:59:09,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:59:09,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 12:59:09,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2023-12-24 12:59:09,849 INFO L87 Difference]: Start difference. First operand 1558 states and 1848 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-24 12:59:12,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:59:12,735 INFO L93 Difference]: Finished difference Result 2278 states and 2709 transitions. [2023-12-24 12:59:12,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 12:59:12,736 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 209 [2023-12-24 12:59:12,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:59:12,739 INFO L225 Difference]: With dead ends: 2278 [2023-12-24 12:59:12,739 INFO L226 Difference]: Without dead ends: 1648 [2023-12-24 12:59:12,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 404 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-12-24 12:59:12,740 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 87 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-12-24 12:59:12,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 263 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-12-24 12:59:12,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2023-12-24 12:59:12,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1516. [2023-12-24 12:59:12,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1516 states, 1385 states have (on average 1.1566787003610108) internal successors, (1602), 1397 states have internal predecessors, (1602), 94 states have call successors, (94), 36 states have call predecessors, (94), 36 states have return successors, (94), 82 states have call predecessors, (94), 94 states have call successors, (94) [2023-12-24 12:59:12,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1516 states and 1790 transitions. [2023-12-24 12:59:12,817 INFO L78 Accepts]: Start accepts. Automaton has 1516 states and 1790 transitions. Word has length 209 [2023-12-24 12:59:12,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:59:12,818 INFO L495 AbstractCegarLoop]: Abstraction has 1516 states and 1790 transitions. [2023-12-24 12:59:12,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-24 12:59:12,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 1790 transitions. [2023-12-24 12:59:12,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2023-12-24 12:59:12,820 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:59:12,820 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 12:59:12,830 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 12:59:13,027 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 12:59:13,027 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:59:13,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:59:13,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1714867724, now seen corresponding path program 1 times [2023-12-24 12:59:13,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:59:13,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1539095767] [2023-12-24 12:59:13,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:59:13,028 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 12:59:13,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:59:13,029 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 12:59:13,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 (31)] Waiting until timeout for monitored process [2023-12-24 12:59:13,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:59:13,388 INFO L262 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-24 12:59:13,392 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:59:13,549 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 12:59:13,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-12-24 12:59:13,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-24 12:59:35,143 WARN L293 SmtUtils]: Spent 10.77s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 13:00:41,906 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 52 treesize of output 40 [2023-12-24 13:00:41,934 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:00:41,934 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 74 treesize of output 36 [2023-12-24 13:00:51,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1159 backedges. 465 proven. 324 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2023-12-24 13:00:51,989 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:01:34,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1159 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 1137 trivial. 0 not checked. [2023-12-24 13:01:34,079 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:01:34,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1539095767] [2023-12-24 13:01:34,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1539095767] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 13:01:34,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 13:01:34,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2023-12-24 13:01:34,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383906612] [2023-12-24 13:01:34,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:01:34,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 13:01:34,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:01:34,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 13:01:34,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=168, Unknown=6, NotChecked=0, Total=210 [2023-12-24 13:01:34,080 INFO L87 Difference]: Start difference. First operand 1516 states and 1790 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-24 13:01:44,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:01:45,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:02:05,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:02:23,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:02:26,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:02:30,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:02:33,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:02:33,204 INFO L93 Difference]: Finished difference Result 2234 states and 2647 transitions. [2023-12-24 13:02:33,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 13:02:33,241 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 211 [2023-12-24 13:02:33,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:02:33,245 INFO L225 Difference]: With dead ends: 2234 [2023-12-24 13:02:33,245 INFO L226 Difference]: Without dead ends: 1632 [2023-12-24 13:02:33,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 73.7s TimeCoverageRelationStatistics Valid=41, Invalid=193, Unknown=6, NotChecked=0, Total=240 [2023-12-24 13:02:33,246 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 54 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 50.8s IncrementalHoareTripleChecker+Time [2023-12-24 13:02:33,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 292 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 50.8s Time] [2023-12-24 13:02:33,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1632 states. [2023-12-24 13:02:33,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1632 to 1332. [2023-12-24 13:02:33,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1332 states, 1201 states have (on average 1.1565362198168194) internal successors, (1389), 1213 states have internal predecessors, (1389), 94 states have call successors, (94), 36 states have call predecessors, (94), 36 states have return successors, (94), 82 states have call predecessors, (94), 94 states have call successors, (94) [2023-12-24 13:02:33,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332 states to 1332 states and 1577 transitions. [2023-12-24 13:02:33,321 INFO L78 Accepts]: Start accepts. Automaton has 1332 states and 1577 transitions. Word has length 211 [2023-12-24 13:02:33,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:02:33,321 INFO L495 AbstractCegarLoop]: Abstraction has 1332 states and 1577 transitions. [2023-12-24 13:02:33,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-24 13:02:33,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states and 1577 transitions. [2023-12-24 13:02:33,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2023-12-24 13:02:33,323 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:02:33,323 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:02:33,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Ended with exit code 0 [2023-12-24 13:02:33,531 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:02:33,531 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:02:33,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:02:33,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1565950562, now seen corresponding path program 1 times [2023-12-24 13:02:33,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:02:33,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [252809904] [2023-12-24 13:02:33,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:02:33,532 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:02:33,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:02:33,533 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:02:33,534 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:02:33,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:02:33,888 INFO L262 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-24 13:02:33,891 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:02:34,242 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:02:34,559 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:02:34,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-24 13:02:37,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:02:37,871 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 62 treesize of output 32 [2023-12-24 13:02:38,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1157 backedges. 728 proven. 217 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2023-12-24 13:02:38,082 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:02:39,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1157 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 1135 trivial. 0 not checked. [2023-12-24 13:02:39,630 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:02:39,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [252809904] [2023-12-24 13:02:39,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [252809904] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 13:02:39,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 13:02:39,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [17] total 21 [2023-12-24 13:02:39,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419272294] [2023-12-24 13:02:39,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:02:39,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 13:02:39,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:02:39,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 13:02:39,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2023-12-24 13:02:39,631 INFO L87 Difference]: Start difference. First operand 1332 states and 1577 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-24 13:02:47,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:02:47,474 INFO L93 Difference]: Finished difference Result 2484 states and 2928 transitions. [2023-12-24 13:02:47,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 13:02:47,479 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 212 [2023-12-24 13:02:47,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:02:47,491 INFO L225 Difference]: With dead ends: 2484 [2023-12-24 13:02:47,491 INFO L226 Difference]: Without dead ends: 1478 [2023-12-24 13:02:47,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 405 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2023-12-24 13:02:47,493 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 68 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2023-12-24 13:02:47,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 527 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2023-12-24 13:02:47,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2023-12-24 13:02:47,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 1288. [2023-12-24 13:02:47,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1288 states, 1157 states have (on average 1.1434745030250648) internal successors, (1323), 1169 states have internal predecessors, (1323), 94 states have call successors, (94), 36 states have call predecessors, (94), 36 states have return successors, (94), 82 states have call predecessors, (94), 94 states have call successors, (94) [2023-12-24 13:02:47,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1511 transitions. [2023-12-24 13:02:47,582 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1511 transitions. Word has length 212 [2023-12-24 13:02:47,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:02:47,582 INFO L495 AbstractCegarLoop]: Abstraction has 1288 states and 1511 transitions. [2023-12-24 13:02:47,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-24 13:02:47,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1511 transitions. [2023-12-24 13:02:47,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2023-12-24 13:02:47,584 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:02:47,585 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:02:47,595 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:02:47,793 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:02:47,793 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:02:47,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:02:47,794 INFO L85 PathProgramCache]: Analyzing trace with hash -2010520368, now seen corresponding path program 1 times [2023-12-24 13:02:47,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:02:47,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1759819982] [2023-12-24 13:02:47,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:02:47,795 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:02:47,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:02:47,805 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:02:47,806 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:02:48,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:02:48,457 INFO L262 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-24 13:02:48,461 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:02:48,860 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:02:49,190 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:02:49,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 17 treesize of output 9 [2023-12-24 13:02:52,522 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:02:52,522 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 61 treesize of output 31 [2023-12-24 13:02:52,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1157 backedges. 728 proven. 217 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2023-12-24 13:02:52,740 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:02:54,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1157 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 1135 trivial. 0 not checked. [2023-12-24 13:02:54,007 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:02:54,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1759819982] [2023-12-24 13:02:54,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1759819982] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 13:02:54,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 13:02:54,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [17] total 21 [2023-12-24 13:02:54,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916963441] [2023-12-24 13:02:54,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:02:54,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 13:02:54,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:02:54,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 13:02:54,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2023-12-24 13:02:54,009 INFO L87 Difference]: Start difference. First operand 1288 states and 1511 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-24 13:02:59,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:02:59,847 INFO L93 Difference]: Finished difference Result 2372 states and 2774 transitions. [2023-12-24 13:02:59,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 13:02:59,849 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 212 [2023-12-24 13:02:59,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:02:59,850 INFO L225 Difference]: With dead ends: 2372 [2023-12-24 13:02:59,850 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 13:02:59,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 405 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2023-12-24 13:02:59,852 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 62 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2023-12-24 13:02:59,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 492 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2023-12-24 13:02:59,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 13:02:59,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 13:02:59,852 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:02:59,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 13:02:59,852 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 212 [2023-12-24 13:02:59,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:02:59,853 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 13:02:59,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-24 13:02:59,853 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 13:02:59,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 13:02:59,855 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 13:02:59,864 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 (33)] Ended with exit code 0 [2023-12-24 13:03:00,062 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:03:00,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 13:04:14,310 WARN L293 SmtUtils]: Spent 1.06m on a formula simplification. DAG size of input: 268 DAG size of output: 292 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 13:04:25,167 WARN L293 SmtUtils]: Spent 9.03s on a formula simplification. DAG size of input: 166 DAG size of output: 43 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 13:04:40,195 WARN L293 SmtUtils]: Spent 7.22s on a formula simplification. DAG size of input: 199 DAG size of output: 43 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 13:05:22,826 WARN L293 SmtUtils]: Spent 25.13s on a formula simplification. DAG size of input: 473 DAG size of output: 1 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 13:06:44,374 WARN L293 SmtUtils]: Spent 1.36m on a formula simplification. DAG size of input: 292 DAG size of output: 66 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 13:06:51,169 WARN L293 SmtUtils]: Spent 6.79s on a formula simplification. DAG size of input: 199 DAG size of output: 43 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 13:06:51,172 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-24 13:06:51,172 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-24 13:06:51,172 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-24 13:06:51,173 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-24 13:06:51,173 INFO L899 garLoopResultBuilder]: For program point L52(line 52) no Hoare annotation was computed. [2023-12-24 13:06:51,173 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-24 13:06:51,173 INFO L899 garLoopResultBuilder]: For program point L52-2(lines 52 54) no Hoare annotation was computed. [2023-12-24 13:06:51,173 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-24 13:06:51,173 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-24 13:06:51,173 INFO L895 garLoopResultBuilder]: At program point L86(line 86) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int#3| |~#signed_short_int_Array_0~0.base|) (_ bv2 32)))) (and (bvsge ((_ sign_extend 16) ((_ extract 15 0) .cse0)) (_ bv16383 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet68#1_50| (_ BitVec 8))) (= (select (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|) (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet68#1_50|))) (= |~#signed_short_int_Array_0~0.offset| (_ bv0 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet62#1_37| (_ BitVec 16))) (= .cse0 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet62#1_37|))) (let ((.cse1 (select (select |#memory_int#5| |~#unsigned_long_int_Array_0~0.base|) |~#unsigned_long_int_Array_0~0.offset|))) (or (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse2 ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_11)))) (and (= .cse1 .cse2) (bvsge .cse2 (_ bv16383 32))))) (= (_ bv256 32) .cse1))))) [2023-12-24 13:06:51,173 INFO L899 garLoopResultBuilder]: For program point L86-1(line 86) no Hoare annotation was computed. [2023-12-24 13:06:51,173 INFO L895 garLoopResultBuilder]: At program point L70(line 70) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int#3| |~#signed_short_int_Array_0~0.base|) (_ bv2 32)))) (and (bvsge ((_ sign_extend 16) ((_ extract 15 0) .cse0)) (_ bv16383 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet68#1_50| (_ BitVec 8))) (= (select (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|) (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet68#1_50|))) (= |~#signed_short_int_Array_0~0.offset| (_ bv0 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet62#1_37| (_ BitVec 16))) (= .cse0 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet62#1_37|))) (let ((.cse1 (select (select |#memory_int#5| |~#unsigned_long_int_Array_0~0.base|) |~#unsigned_long_int_Array_0~0.offset|))) (or (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse2 ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_11)))) (and (= .cse1 .cse2) (bvsge .cse2 (_ bv16383 32))))) (= (_ bv256 32) .cse1))))) [2023-12-24 13:06:51,173 INFO L899 garLoopResultBuilder]: For program point L70-1(line 70) no Hoare annotation was computed. [2023-12-24 13:06:51,174 INFO L895 garLoopResultBuilder]: At program point L87(line 87) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int#3| |~#signed_short_int_Array_0~0.base|) (_ bv2 32)))) (and (bvsge ((_ sign_extend 16) ((_ extract 15 0) .cse0)) (_ bv16383 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet68#1_50| (_ BitVec 8))) (= (select (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|) (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet68#1_50|))) (= |~#signed_short_int_Array_0~0.offset| (_ bv0 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet62#1_37| (_ BitVec 16))) (= .cse0 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet62#1_37|))) (let ((.cse1 (select (select |#memory_int#5| |~#unsigned_long_int_Array_0~0.base|) |~#unsigned_long_int_Array_0~0.offset|))) (or (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse2 ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_11)))) (and (= .cse1 .cse2) (bvsge .cse2 (_ bv16383 32))))) (= (_ bv256 32) .cse1))))) [2023-12-24 13:06:51,174 INFO L899 garLoopResultBuilder]: For program point L87-1(line 87) no Hoare annotation was computed. [2023-12-24 13:06:51,174 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int#3| |~#signed_short_int_Array_0~0.base|) (_ bv2 32)))) (and (bvsge ((_ sign_extend 16) ((_ extract 15 0) .cse0)) (_ bv16383 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet68#1_50| (_ BitVec 8))) (= (select (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|) (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet68#1_50|))) (= |~#signed_short_int_Array_0~0.offset| (_ bv0 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet62#1_37| (_ BitVec 16))) (= .cse0 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet62#1_37|))) (let ((.cse1 (select (select |#memory_int#5| |~#unsigned_long_int_Array_0~0.base|) |~#unsigned_long_int_Array_0~0.offset|))) (or (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse2 ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_11)))) (and (= .cse1 .cse2) (bvsge .cse2 (_ bv16383 32))))) (= (_ bv256 32) .cse1))))) [2023-12-24 13:06:51,174 INFO L899 garLoopResultBuilder]: For program point L71-1(line 71) no Hoare annotation was computed. [2023-12-24 13:06:51,174 INFO L899 garLoopResultBuilder]: For program point L73(line 73) no Hoare annotation was computed. [2023-12-24 13:06:51,174 INFO L899 garLoopResultBuilder]: For program point L73-2(line 73) no Hoare annotation was computed. [2023-12-24 13:06:51,174 INFO L899 garLoopResultBuilder]: For program point L73-3(line 73) no Hoare annotation was computed. [2023-12-24 13:06:51,174 INFO L899 garLoopResultBuilder]: For program point L73-5(line 73) no Hoare annotation was computed. [2023-12-24 13:06:51,174 INFO L899 garLoopResultBuilder]: For program point L73-7(line 73) no Hoare annotation was computed. [2023-12-24 13:06:51,174 INFO L895 garLoopResultBuilder]: At program point L73-8(line 73) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int#3| |~#signed_short_int_Array_0~0.base|) (_ bv2 32)))) (and (bvsge ((_ sign_extend 16) ((_ extract 15 0) .cse0)) (_ bv16383 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet68#1_50| (_ BitVec 8))) (= (select (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|) (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet68#1_50|))) (= |~#signed_short_int_Array_0~0.offset| (_ bv0 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet62#1_37| (_ BitVec 16))) (= .cse0 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet62#1_37|))) (let ((.cse1 (select (select |#memory_int#5| |~#unsigned_long_int_Array_0~0.base|) |~#unsigned_long_int_Array_0~0.offset|))) (or (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse2 ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_11)))) (and (= .cse1 .cse2) (bvsge .cse2 (_ bv16383 32))))) (= (_ bv256 32) .cse1))))) [2023-12-24 13:06:51,174 INFO L899 garLoopResultBuilder]: For program point L73-9(line 73) no Hoare annotation was computed. [2023-12-24 13:06:51,174 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 67) no Hoare annotation was computed. [2023-12-24 13:06:51,174 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 13:06:51,174 INFO L899 garLoopResultBuilder]: For program point L75(line 75) no Hoare annotation was computed. [2023-12-24 13:06:51,174 INFO L899 garLoopResultBuilder]: For program point L75-2(line 75) no Hoare annotation was computed. [2023-12-24 13:06:51,174 INFO L899 garLoopResultBuilder]: For program point L75-3(line 75) no Hoare annotation was computed. [2023-12-24 13:06:51,174 INFO L899 garLoopResultBuilder]: For program point L75-5(line 75) no Hoare annotation was computed. [2023-12-24 13:06:51,174 INFO L899 garLoopResultBuilder]: For program point L75-7(line 75) no Hoare annotation was computed. [2023-12-24 13:06:51,175 INFO L895 garLoopResultBuilder]: At program point L75-8(line 75) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int#3| |~#signed_short_int_Array_0~0.base|) (_ bv2 32)))) (and (bvsge ((_ sign_extend 16) ((_ extract 15 0) .cse0)) (_ bv16383 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet68#1_50| (_ BitVec 8))) (= (select (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|) (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet68#1_50|))) (= |~#signed_short_int_Array_0~0.offset| (_ bv0 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet62#1_37| (_ BitVec 16))) (= .cse0 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet62#1_37|))) (let ((.cse1 (select (select |#memory_int#5| |~#unsigned_long_int_Array_0~0.base|) |~#unsigned_long_int_Array_0~0.offset|))) (or (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse2 ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_11)))) (and (= .cse1 .cse2) (bvsge .cse2 (_ bv16383 32))))) (= (_ bv256 32) .cse1))))) [2023-12-24 13:06:51,175 INFO L899 garLoopResultBuilder]: For program point L75-9(line 75) no Hoare annotation was computed. [2023-12-24 13:06:51,175 INFO L899 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2023-12-24 13:06:51,175 INFO L899 garLoopResultBuilder]: For program point L59-2(line 59) no Hoare annotation was computed. [2023-12-24 13:06:51,175 INFO L899 garLoopResultBuilder]: For program point L60(lines 60 66) no Hoare annotation was computed. [2023-12-24 13:06:51,175 INFO L895 garLoopResultBuilder]: At program point L77(line 77) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int#3| |~#signed_short_int_Array_0~0.base|) (_ bv2 32)))) (and (bvsge ((_ sign_extend 16) ((_ extract 15 0) .cse0)) (_ bv16383 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet68#1_50| (_ BitVec 8))) (= (select (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|) (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet68#1_50|))) (= |~#signed_short_int_Array_0~0.offset| (_ bv0 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet62#1_37| (_ BitVec 16))) (= .cse0 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet62#1_37|))) (let ((.cse1 (select (select |#memory_int#5| |~#unsigned_long_int_Array_0~0.base|) |~#unsigned_long_int_Array_0~0.offset|))) (or (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse2 ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_11)))) (and (= .cse1 .cse2) (bvsge .cse2 (_ bv16383 32))))) (= (_ bv256 32) .cse1))))) [2023-12-24 13:06:51,175 INFO L899 garLoopResultBuilder]: For program point L77-1(line 77) no Hoare annotation was computed. [2023-12-24 13:06:51,175 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 50) no Hoare annotation was computed. [2023-12-24 13:06:51,175 INFO L899 garLoopResultBuilder]: For program point L44-1(lines 44 50) no Hoare annotation was computed. [2023-12-24 13:06:51,175 INFO L899 garLoopResultBuilder]: For program point L94(line 94) no Hoare annotation was computed. [2023-12-24 13:06:51,175 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 63) no Hoare annotation was computed. [2023-12-24 13:06:51,175 INFO L899 garLoopResultBuilder]: For program point L94-2(line 94) no Hoare annotation was computed. [2023-12-24 13:06:51,175 INFO L899 garLoopResultBuilder]: For program point L94-3(line 94) no Hoare annotation was computed. [2023-12-24 13:06:51,175 INFO L899 garLoopResultBuilder]: For program point L94-4(line 94) no Hoare annotation was computed. [2023-12-24 13:06:51,175 INFO L899 garLoopResultBuilder]: For program point L94-5(line 94) no Hoare annotation was computed. [2023-12-24 13:06:51,175 INFO L899 garLoopResultBuilder]: For program point L94-7(line 94) no Hoare annotation was computed. [2023-12-24 13:06:51,175 INFO L899 garLoopResultBuilder]: For program point L94-9(line 94) no Hoare annotation was computed. [2023-12-24 13:06:51,175 INFO L899 garLoopResultBuilder]: For program point L94-11(line 94) no Hoare annotation was computed. [2023-12-24 13:06:51,175 INFO L899 garLoopResultBuilder]: For program point L94-12(line 94) no Hoare annotation was computed. [2023-12-24 13:06:51,175 INFO L899 garLoopResultBuilder]: For program point L94-13(line 94) no Hoare annotation was computed. [2023-12-24 13:06:51,176 INFO L899 garLoopResultBuilder]: For program point L94-14(line 94) no Hoare annotation was computed. [2023-12-24 13:06:51,176 INFO L899 garLoopResultBuilder]: For program point L94-15(line 94) no Hoare annotation was computed. [2023-12-24 13:06:51,176 INFO L895 garLoopResultBuilder]: At program point L78(line 78) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int#3| |~#signed_short_int_Array_0~0.base|) (_ bv2 32)))) (and (bvsge ((_ sign_extend 16) ((_ extract 15 0) .cse0)) (_ bv16383 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet68#1_50| (_ BitVec 8))) (= (select (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|) (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet68#1_50|))) (= |~#signed_short_int_Array_0~0.offset| (_ bv0 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet62#1_37| (_ BitVec 16))) (= .cse0 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet62#1_37|))) (let ((.cse1 (select (select |#memory_int#5| |~#unsigned_long_int_Array_0~0.base|) |~#unsigned_long_int_Array_0~0.offset|))) (or (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse2 ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_11)))) (and (= .cse1 .cse2) (bvsge .cse2 (_ bv16383 32))))) (= (_ bv256 32) .cse1))))) [2023-12-24 13:06:51,176 INFO L899 garLoopResultBuilder]: For program point L78-1(line 78) no Hoare annotation was computed. [2023-12-24 13:06:51,176 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 49) no Hoare annotation was computed. [2023-12-24 13:06:51,176 INFO L899 garLoopResultBuilder]: For program point L94-17(line 94) no Hoare annotation was computed. [2023-12-24 13:06:51,176 INFO L899 garLoopResultBuilder]: For program point L94-19(line 94) no Hoare annotation was computed. [2023-12-24 13:06:51,176 INFO L899 garLoopResultBuilder]: For program point L94-21(line 94) no Hoare annotation was computed. [2023-12-24 13:06:51,176 INFO L899 garLoopResultBuilder]: For program point L94-23(line 94) no Hoare annotation was computed. [2023-12-24 13:06:51,176 INFO L899 garLoopResultBuilder]: For program point L94-24(line 94) no Hoare annotation was computed. [2023-12-24 13:06:51,176 INFO L899 garLoopResultBuilder]: For program point L94-25(line 94) no Hoare annotation was computed. [2023-12-24 13:06:51,176 INFO L899 garLoopResultBuilder]: For program point L94-26(line 94) no Hoare annotation was computed. [2023-12-24 13:06:51,176 INFO L899 garLoopResultBuilder]: For program point L94-28(line 94) no Hoare annotation was computed. [2023-12-24 13:06:51,176 INFO L899 garLoopResultBuilder]: For program point L94-30(line 94) no Hoare annotation was computed. [2023-12-24 13:06:51,176 INFO L899 garLoopResultBuilder]: For program point L62(line 62) no Hoare annotation was computed. [2023-12-24 13:06:51,176 INFO L899 garLoopResultBuilder]: For program point L94-32(line 94) no Hoare annotation was computed. [2023-12-24 13:06:51,176 INFO L899 garLoopResultBuilder]: For program point L62-2(line 62) no Hoare annotation was computed. [2023-12-24 13:06:51,176 INFO L899 garLoopResultBuilder]: For program point L94-34(line 94) no Hoare annotation was computed. [2023-12-24 13:06:51,176 INFO L899 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2023-12-24 13:06:51,176 INFO L899 garLoopResultBuilder]: For program point L46-2(line 46) no Hoare annotation was computed. [2023-12-24 13:06:51,176 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 13:06:51,177 INFO L895 garLoopResultBuilder]: At program point L80(line 80) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int#3| |~#signed_short_int_Array_0~0.base|) (_ bv2 32)))) (and (= |ULTIMATE.start_updateVariables_#t~mem63#1| ((_ extract 15 0) .cse0)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet68#1_50| (_ BitVec 8))) (= (select (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|) (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet68#1_50|))) (= |~#signed_short_int_Array_0~0.offset| (_ bv0 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet62#1_37| (_ BitVec 16))) (= .cse0 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet62#1_37|))) (let ((.cse1 (select (select |#memory_int#5| |~#unsigned_long_int_Array_0~0.base|) |~#unsigned_long_int_Array_0~0.offset|))) (or (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse2 ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_11)))) (and (= .cse1 .cse2) (bvsge .cse2 (_ bv16383 32))))) (= (_ bv256 32) .cse1))))) [2023-12-24 13:06:51,177 INFO L899 garLoopResultBuilder]: For program point L80-1(line 80) no Hoare annotation was computed. [2023-12-24 13:06:51,177 INFO L895 garLoopResultBuilder]: At program point L81(line 81) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int#3| |~#signed_short_int_Array_0~0.base|) (_ bv2 32)))) (and (bvsge ((_ sign_extend 16) ((_ extract 15 0) .cse0)) (_ bv16383 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet68#1_50| (_ BitVec 8))) (= (select (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|) (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet68#1_50|))) (= |~#signed_short_int_Array_0~0.offset| (_ bv0 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet62#1_37| (_ BitVec 16))) (= .cse0 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet62#1_37|))) (let ((.cse1 (select (select |#memory_int#5| |~#unsigned_long_int_Array_0~0.base|) |~#unsigned_long_int_Array_0~0.offset|))) (or (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse2 ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_11)))) (and (= .cse1 .cse2) (bvsge .cse2 (_ bv16383 32))))) (= (_ bv256 32) .cse1))))) [2023-12-24 13:06:51,177 INFO L899 garLoopResultBuilder]: For program point L81-1(line 81) no Hoare annotation was computed. [2023-12-24 13:06:51,177 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-24 13:06:51,177 INFO L895 garLoopResultBuilder]: At program point L83(line 83) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int#3| |~#signed_short_int_Array_0~0.base|) (_ bv2 32)))) (and (bvsge ((_ sign_extend 16) ((_ extract 15 0) .cse0)) (_ bv16383 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet68#1_50| (_ BitVec 8))) (= (select (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|) (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet68#1_50|))) (= |~#signed_short_int_Array_0~0.offset| (_ bv0 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet62#1_37| (_ BitVec 16))) (= .cse0 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet62#1_37|))) (let ((.cse1 (select (select |#memory_int#5| |~#unsigned_long_int_Array_0~0.base|) |~#unsigned_long_int_Array_0~0.offset|))) (or (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse2 ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_11)))) (and (= .cse1 .cse2) (bvsge .cse2 (_ bv16383 32))))) (= (_ bv256 32) .cse1))))) [2023-12-24 13:06:51,177 INFO L899 garLoopResultBuilder]: For program point L83-1(line 83) no Hoare annotation was computed. [2023-12-24 13:06:51,177 INFO L895 garLoopResultBuilder]: At program point L100-2(lines 100 106) the Hoare annotation is: (let ((.cse1 (select |#memory_int#3| |~#signed_short_int_Array_0~0.base|)) (.cse6 (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|))) (let ((.cse8 (select .cse6 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse11 (select .cse1 (_ bv2 32)))) (let ((.cse0 (bvsge ((_ sign_extend 16) ((_ extract 15 0) .cse11)) (_ bv16383 32))) (.cse3 (= |~#signed_short_int_Array_0~0.offset| (_ bv0 32))) (.cse4 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet62#1_37| (_ BitVec 16))) (= .cse11 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet62#1_37|)))) (.cse5 (let ((.cse9 (select (select |#memory_int#5| |~#unsigned_long_int_Array_0~0.base|) |~#unsigned_long_int_Array_0~0.offset|))) (or (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse10 ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_11)))) (and (= .cse9 .cse10) (bvsge .cse10 (_ bv16383 32))))) (= (_ bv256 32) .cse9)))) (.cse2 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet68#1_50| (_ BitVec 8))) (= .cse8 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet68#1_50|))))) (or (and .cse0 (not (bvugt ~last_1_unsigned_long_int_Array_0_0_~0 ((_ sign_extend 16) ((_ extract 15 0) (select .cse1 |~#signed_short_int_Array_0~0.offset|))))) .cse2 .cse3 .cse4 .cse5) (and (let ((.cse7 ((_ zero_extend 24) ((_ extract 7 0) (select .cse6 |~#unsigned_char_Array_0~0.offset|))))) (or (and .cse0 (= (select .cse6 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) ((_ extract 7 0) .cse7))) .cse3 .cse4 .cse5) (and .cse0 (not (bvslt .cse7 ((_ zero_extend 24) ((_ extract 7 0) .cse8)))) .cse3 .cse4 .cse5))) .cse2))))) [2023-12-24 13:06:51,177 INFO L899 garLoopResultBuilder]: For program point L100-3(lines 100 106) no Hoare annotation was computed. [2023-12-24 13:06:51,178 INFO L895 garLoopResultBuilder]: At program point L84(line 84) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int#3| |~#signed_short_int_Array_0~0.base|) (_ bv2 32)))) (and (bvsge ((_ sign_extend 16) ((_ extract 15 0) .cse0)) (_ bv16383 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet68#1_50| (_ BitVec 8))) (= (select (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|) (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet68#1_50|))) (= |~#signed_short_int_Array_0~0.offset| (_ bv0 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet62#1_37| (_ BitVec 16))) (= .cse0 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet62#1_37|))) (let ((.cse1 (select (select |#memory_int#5| |~#unsigned_long_int_Array_0~0.base|) |~#unsigned_long_int_Array_0~0.offset|))) (or (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse2 ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_11)))) (and (= .cse1 .cse2) (bvsge .cse2 (_ bv16383 32))))) (= (_ bv256 32) .cse1))))) [2023-12-24 13:06:51,178 INFO L899 garLoopResultBuilder]: For program point L84-1(line 84) no Hoare annotation was computed. [2023-12-24 13:06:51,178 INFO L899 garLoopResultBuilder]: For program point L51(lines 51 57) no Hoare annotation was computed. [2023-12-24 13:06:51,178 INFO L899 garLoopResultBuilder]: For program point L51-1(lines 51 57) no Hoare annotation was computed. [2023-12-24 13:06:51,180 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] [2023-12-24 13:06:51,181 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 13:06:51,203 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#signed_short_int_Array_0~0!base][2bv32] could not be translated [2023-12-24 13:06:51,205 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#signed_short_int_Array_0~0!base][~#signed_short_int_Array_0~0!offset] could not be translated [2023-12-24 13:06:51,206 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet68#1_50 : bv8 :: #memory_int#4[~#unsigned_char_Array_0~0!base][~bvadd~32(~#unsigned_char_Array_0~0!offset, 1bv32)] == ~sign_extend~32~8(v_ULTIMATE.start_updateVariables_#t~nondet68#1_50)) could not be translated [2023-12-24 13:06:51,206 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet62#1_37 : bv16 :: #memory_int#3[~#signed_short_int_Array_0~0!base][2bv32] == ~sign_extend~32~8(v_ULTIMATE.start_updateVariables_#t~nondet62#1_37)) could not be translated [2023-12-24 13:06:51,206 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_arrayElimCell_11 : bv32 :: #memory_int#5[~#unsigned_long_int_Array_0~0!base][~#unsigned_long_int_Array_0~0!offset] == ~sign_extend~32~8(v_arrayElimCell_11[15:0]) && ~bvsge~32(~sign_extend~32~8(v_arrayElimCell_11[15:0]), 16383bv32)) could not be translated [2023-12-24 13:06:51,206 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_long_int_Array_0~0!base][~#unsigned_long_int_Array_0~0!offset] could not be translated [2023-12-24 13:06:51,206 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#signed_short_int_Array_0~0!base][2bv32] could not be translated [2023-12-24 13:06:51,206 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~#unsigned_char_Array_0~0!base][~bvadd~32(2bv32, ~#unsigned_char_Array_0~0!offset)] could not be translated [2023-12-24 13:06:51,206 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~#unsigned_char_Array_0~0!base][~#unsigned_char_Array_0~0!offset] could not be translated [2023-12-24 13:06:51,206 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet62#1_37 : bv16 :: #memory_int#3[~#signed_short_int_Array_0~0!base][2bv32] == ~sign_extend~32~8(v_ULTIMATE.start_updateVariables_#t~nondet62#1_37)) could not be translated [2023-12-24 13:06:51,206 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_arrayElimCell_11 : bv32 :: #memory_int#5[~#unsigned_long_int_Array_0~0!base][~#unsigned_long_int_Array_0~0!offset] == ~sign_extend~32~8(v_arrayElimCell_11[15:0]) && ~bvsge~32(~sign_extend~32~8(v_arrayElimCell_11[15:0]), 16383bv32)) could not be translated [2023-12-24 13:06:51,206 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_long_int_Array_0~0!base][~#unsigned_long_int_Array_0~0!offset] could not be translated [2023-12-24 13:06:51,206 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#signed_short_int_Array_0~0!base][2bv32] could not be translated [2023-12-24 13:06:51,206 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~#unsigned_char_Array_0~0!base][~#unsigned_char_Array_0~0!offset] could not be translated [2023-12-24 13:06:51,206 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~#unsigned_char_Array_0~0!base][~bvadd~32(~#unsigned_char_Array_0~0!offset, 1bv32)] could not be translated [2023-12-24 13:06:51,207 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet62#1_37 : bv16 :: #memory_int#3[~#signed_short_int_Array_0~0!base][2bv32] == ~sign_extend~32~8(v_ULTIMATE.start_updateVariables_#t~nondet62#1_37)) could not be translated [2023-12-24 13:06:51,207 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_arrayElimCell_11 : bv32 :: #memory_int#5[~#unsigned_long_int_Array_0~0!base][~#unsigned_long_int_Array_0~0!offset] == ~sign_extend~32~8(v_arrayElimCell_11[15:0]) && ~bvsge~32(~sign_extend~32~8(v_arrayElimCell_11[15:0]), 16383bv32)) could not be translated [2023-12-24 13:06:51,207 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_long_int_Array_0~0!base][~#unsigned_long_int_Array_0~0!offset] could not be translated [2023-12-24 13:06:51,207 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet68#1_50 : bv8 :: #memory_int#4[~#unsigned_char_Array_0~0!base][~bvadd~32(~#unsigned_char_Array_0~0!offset, 1bv32)] == ~sign_extend~32~8(v_ULTIMATE.start_updateVariables_#t~nondet68#1_50)) could not be translated [2023-12-24 13:06:51,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 01:06:51 BoogieIcfgContainer [2023-12-24 13:06:51,207 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 13:06:51,208 INFO L158 Benchmark]: Toolchain (without parser) took 554773.89ms. Allocated memory was 305.1MB in the beginning and 761.3MB in the end (delta: 456.1MB). Free memory was 258.8MB in the beginning and 652.7MB in the end (delta: -393.9MB). Peak memory consumption was 458.1MB. Max. memory is 8.0GB. [2023-12-24 13:06:51,209 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 195.0MB. Free memory was 141.1MB in the beginning and 141.0MB in the end (delta: 129.4kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 13:06:51,209 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.11ms. Allocated memory is still 305.1MB. Free memory was 258.2MB in the beginning and 243.0MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-24 13:06:51,209 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.58ms. Allocated memory is still 305.1MB. Free memory was 242.5MB in the beginning and 239.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-24 13:06:51,214 INFO L158 Benchmark]: Boogie Preprocessor took 64.45ms. Allocated memory is still 305.1MB. Free memory was 239.4MB in the beginning and 234.1MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-24 13:06:51,214 INFO L158 Benchmark]: RCFGBuilder took 970.86ms. Allocated memory is still 305.1MB. Free memory was 233.6MB in the beginning and 258.5MB in the end (delta: -24.9MB). Peak memory consumption was 37.5MB. Max. memory is 8.0GB. [2023-12-24 13:06:51,215 INFO L158 Benchmark]: TraceAbstraction took 553466.00ms. Allocated memory was 305.1MB in the beginning and 761.3MB in the end (delta: 456.1MB). Free memory was 258.0MB in the beginning and 652.7MB in the end (delta: -394.7MB). Peak memory consumption was 456.3MB. Max. memory is 8.0GB. [2023-12-24 13:06:51,215 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.42ms. Allocated memory is still 195.0MB. Free memory was 141.1MB in the beginning and 141.0MB in the end (delta: 129.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 207.11ms. Allocated memory is still 305.1MB. Free memory was 258.2MB in the beginning and 243.0MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.58ms. Allocated memory is still 305.1MB. Free memory was 242.5MB in the beginning and 239.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 64.45ms. Allocated memory is still 305.1MB. Free memory was 239.4MB in the beginning and 234.1MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 970.86ms. Allocated memory is still 305.1MB. Free memory was 233.6MB in the beginning and 258.5MB in the end (delta: -24.9MB). Peak memory consumption was 37.5MB. Max. memory is 8.0GB. * TraceAbstraction took 553466.00ms. Allocated memory was 305.1MB in the beginning and 761.3MB in the end (delta: 456.1MB). Free memory was 258.0MB in the beginning and 652.7MB in the end (delta: -394.7MB). Peak memory consumption was 456.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#signed_short_int_Array_0~0!base][2bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#signed_short_int_Array_0~0!base][~#signed_short_int_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet68#1_50 : bv8 :: #memory_int#4[~#unsigned_char_Array_0~0!base][~bvadd~32(~#unsigned_char_Array_0~0!offset, 1bv32)] == ~sign_extend~32~8(v_ULTIMATE.start_updateVariables_#t~nondet68#1_50)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet62#1_37 : bv16 :: #memory_int#3[~#signed_short_int_Array_0~0!base][2bv32] == ~sign_extend~32~8(v_ULTIMATE.start_updateVariables_#t~nondet62#1_37)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_arrayElimCell_11 : bv32 :: #memory_int#5[~#unsigned_long_int_Array_0~0!base][~#unsigned_long_int_Array_0~0!offset] == ~sign_extend~32~8(v_arrayElimCell_11[15:0]) && ~bvsge~32(~sign_extend~32~8(v_arrayElimCell_11[15:0]), 16383bv32)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_long_int_Array_0~0!base][~#unsigned_long_int_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#signed_short_int_Array_0~0!base][2bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~#unsigned_char_Array_0~0!base][~bvadd~32(2bv32, ~#unsigned_char_Array_0~0!offset)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~#unsigned_char_Array_0~0!base][~#unsigned_char_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet62#1_37 : bv16 :: #memory_int#3[~#signed_short_int_Array_0~0!base][2bv32] == ~sign_extend~32~8(v_ULTIMATE.start_updateVariables_#t~nondet62#1_37)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_arrayElimCell_11 : bv32 :: #memory_int#5[~#unsigned_long_int_Array_0~0!base][~#unsigned_long_int_Array_0~0!offset] == ~sign_extend~32~8(v_arrayElimCell_11[15:0]) && ~bvsge~32(~sign_extend~32~8(v_arrayElimCell_11[15:0]), 16383bv32)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_long_int_Array_0~0!base][~#unsigned_long_int_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#signed_short_int_Array_0~0!base][2bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~#unsigned_char_Array_0~0!base][~#unsigned_char_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~#unsigned_char_Array_0~0!base][~bvadd~32(~#unsigned_char_Array_0~0!offset, 1bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet62#1_37 : bv16 :: #memory_int#3[~#signed_short_int_Array_0~0!base][2bv32] == ~sign_extend~32~8(v_ULTIMATE.start_updateVariables_#t~nondet62#1_37)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_arrayElimCell_11 : bv32 :: #memory_int#5[~#unsigned_long_int_Array_0~0!base][~#unsigned_long_int_Array_0~0!offset] == ~sign_extend~32~8(v_arrayElimCell_11[15:0]) && ~bvsge~32(~sign_extend~32~8(v_arrayElimCell_11[15:0]), 16383bv32)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_long_int_Array_0~0!base][~#unsigned_long_int_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet68#1_50 : bv8 :: #memory_int#4[~#unsigned_char_Array_0~0!base][~bvadd~32(~#unsigned_char_Array_0~0!offset, 1bv32)] == ~sign_extend~32~8(v_ULTIMATE.start_updateVariables_#t~nondet68#1_50)) 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, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 553.4s, OverallIterations: 27, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 139.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 231.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 4080 SdHoareTripleChecker+Valid, 122.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4051 mSDsluCounter, 16103 SdHoareTripleChecker+Invalid, 115.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12584 mSDsCounter, 338 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6308 IncrementalHoareTripleChecker+Invalid, 6649 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 338 mSolverCounterUnsat, 3519 mSDtfsCounter, 6308 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5240 GetRequests, 4851 SyntacticMatches, 6 SemanticMatches, 383 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1594 ImplicationChecksByTransitivity, 90.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1558occurred in iteration=23, InterpolantAutomatonStates: 280, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 27 MinimizatonAttempts, 2446 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 899 PreInvPairs, 1012 NumberOfFragments, 892 HoareAnnotationTreeSize, 899 FormulaSimplifications, 2379915 FormulaSimplificationTreeSizeReduction, 74.5s HoareSimplificationTime, 14 FormulaSimplificationsInter, 1581324 FormulaSimplificationTreeSizeReductionInter, 156.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 5.0s SatisfiabilityAnalysisTime, 166.8s InterpolantComputationTime, 3744 NumberOfCodeBlocks, 3744 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 4770 ConstructedInterpolants, 609 QuantifiedInterpolants, 38902 SizeOfPredicates, 335 NumberOfNonLiveVariables, 8455 ConjunctsInSsa, 364 ConjunctsInUnsatCore, 38 InterpolantComputations, 22 PerfectInterpolantSequences, 15814/17180 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 & 32767) >= 16383) && !((last_1_unsigned_long_int_Array_0_0_ > (null & 32767)))) || (((null & 32767) >= 16383) || (((null & 32767) >= 16383) && !(((null & 127) < (null & 127)))))) RESULT: Ultimate proved your program to be correct! [2023-12-24 13:06:51,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...