/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-5.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 13:28:47,460 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 13:28:47,535 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-24 13:28:47,539 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 13:28:47,540 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 13:28:47,561 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 13:28:47,562 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 13:28:47,562 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 13:28:47,562 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 13:28:47,565 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 13:28:47,565 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 13:28:47,565 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 13:28:47,566 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 13:28:47,567 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 13:28:47,567 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 13:28:47,567 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 13:28:47,568 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 13:28:47,568 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 13:28:47,568 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 13:28:47,568 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 13:28:47,568 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 13:28:47,568 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 13:28:47,569 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 13:28:47,569 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 13:28:47,569 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 13:28:47,569 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 13:28:47,569 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 13:28:47,569 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 13:28:47,569 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 13:28:47,570 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 13:28:47,570 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 13:28:47,570 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 13:28:47,571 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 13:28:47,571 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 13:28:47,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 13:28:47,571 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 13:28:47,571 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 13:28:47,571 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 13:28:47,571 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 13:28:47,571 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 13:28:47,571 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 13:28:47,572 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 13:28:47,572 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 13:28:47,572 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 13:28:47,572 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 13:28:47,572 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 13:28:47,572 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-24 13:28:47,756 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 13:28:47,776 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 13:28:47,778 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 13:28:47,779 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 13:28:47,779 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 13:28:47,781 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-5.i [2023-12-24 13:28:48,869 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 13:28:49,047 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 13:28:49,048 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-5.i [2023-12-24 13:28:49,056 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3303a022e/e71347aa1ff64d9c9f3631844fb69514/FLAG33cb7e13a [2023-12-24 13:28:49,068 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3303a022e/e71347aa1ff64d9c9f3631844fb69514 [2023-12-24 13:28:49,070 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 13:28:49,071 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 13:28:49,073 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 13:28:49,073 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 13:28:49,076 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 13:28:49,077 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 01:28:49" (1/1) ... [2023-12-24 13:28:49,077 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a743762 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:28:49, skipping insertion in model container [2023-12-24 13:28:49,078 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 01:28:49" (1/1) ... [2023-12-24 13:28:49,103 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 13:28:49,210 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-5.i[915,928] [2023-12-24 13:28:49,262 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 13:28:49,273 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 13:28:49,281 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-5.i[915,928] [2023-12-24 13:28:49,334 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 13:28:49,354 INFO L206 MainTranslator]: Completed translation [2023-12-24 13:28:49,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:28:49 WrapperNode [2023-12-24 13:28:49,355 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 13:28:49,356 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 13:28:49,356 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 13:28:49,356 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 13:28:49,361 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:28:49" (1/1) ... [2023-12-24 13:28:49,372 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:28:49" (1/1) ... [2023-12-24 13:28:49,408 INFO L138 Inliner]: procedures = 33, calls = 158, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 415 [2023-12-24 13:28:49,409 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 13:28:49,409 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 13:28:49,410 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 13:28:49,410 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 13:28:49,417 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:28:49" (1/1) ... [2023-12-24 13:28:49,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:28:49" (1/1) ... [2023-12-24 13:28:49,423 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:28:49" (1/1) ... [2023-12-24 13:28:49,443 INFO L175 MemorySlicer]: Split 122 memory accesses to 6 slices as follows [2, 6, 3, 28, 59, 24]. 48 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 1, 6, 4, 3]. The 17 writes are split as follows [0, 1, 1, 6, 6, 3]. [2023-12-24 13:28:49,444 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:28:49" (1/1) ... [2023-12-24 13:28:49,444 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:28:49" (1/1) ... [2023-12-24 13:28:49,493 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:28:49" (1/1) ... [2023-12-24 13:28:49,496 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:28:49" (1/1) ... [2023-12-24 13:28:49,499 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:28:49" (1/1) ... [2023-12-24 13:28:49,500 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:28:49" (1/1) ... [2023-12-24 13:28:49,504 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 13:28:49,505 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 13:28:49,505 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 13:28:49,505 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 13:28:49,506 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:28:49" (1/1) ... [2023-12-24 13:28:49,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 13:28:49,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 13:28:49,546 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-24 13:28:49,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-24 13:28:49,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 13:28:49,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-12-24 13:28:49,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-12-24 13:28:49,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-12-24 13:28:49,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-12-24 13:28:49,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2023-12-24 13:28:49,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2023-12-24 13:28:49,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2023-12-24 13:28:49,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2023-12-24 13:28:49,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2023-12-24 13:28:49,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2023-12-24 13:28:49,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2023-12-24 13:28:49,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2023-12-24 13:28:49,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 13:28:49,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 13:28:49,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-24 13:28:49,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-24 13:28:49,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-12-24 13:28:49,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2023-12-24 13:28:49,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2023-12-24 13:28:49,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2023-12-24 13:28:49,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2023-12-24 13:28:49,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2023-12-24 13:28:49,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2023-12-24 13:28:49,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2023-12-24 13:28:49,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-24 13:28:49,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-24 13:28:49,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-24 13:28:49,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-12-24 13:28:49,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2023-12-24 13:28:49,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2023-12-24 13:28:49,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2023-12-24 13:28:49,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2023-12-24 13:28:49,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2023-12-24 13:28:49,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2023-12-24 13:28:49,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2023-12-24 13:28:49,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2023-12-24 13:28:49,581 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 13:28:49,581 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 13:28:49,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 13:28:49,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 13:28:49,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-12-24 13:28:49,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-12-24 13:28:49,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2023-12-24 13:28:49,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2023-12-24 13:28:49,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2023-12-24 13:28:49,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2023-12-24 13:28:49,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2023-12-24 13:28:49,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2023-12-24 13:28:49,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2023-12-24 13:28:49,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2023-12-24 13:28:49,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2023-12-24 13:28:49,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2023-12-24 13:28:49,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-24 13:28:49,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-24 13:28:49,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-24 13:28:49,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-12-24 13:28:49,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-12-24 13:28:49,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2023-12-24 13:28:49,740 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 13:28:49,742 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 13:28:50,312 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 13:28:50,342 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 13:28:50,342 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 13:28:50,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 01:28:50 BoogieIcfgContainer [2023-12-24 13:28:50,342 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 13:28:50,344 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 13:28:50,344 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 13:28:50,346 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 13:28:50,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 01:28:49" (1/3) ... [2023-12-24 13:28:50,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1376488f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 01:28:50, skipping insertion in model container [2023-12-24 13:28:50,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:28:49" (2/3) ... [2023-12-24 13:28:50,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1376488f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 01:28:50, skipping insertion in model container [2023-12-24 13:28:50,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 01:28:50" (3/3) ... [2023-12-24 13:28:50,355 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-5.i [2023-12-24 13:28:50,368 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 13:28:50,368 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 13:28:50,410 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 13:28:50,415 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;@31d5d833, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 13:28:50,415 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 13:28:50,418 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 66 states have internal predecessors, (89), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 13:28:50,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-24 13:28:50,427 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:28:50,428 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:50,428 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:28:50,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:28:50,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1309560060, now seen corresponding path program 1 times [2023-12-24 13:28:50,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:28:50,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1174093786] [2023-12-24 13:28:50,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:28:50,442 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:28:50,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:28:50,444 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:28:50,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-24 13:28:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:28:50,708 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 13:28:50,715 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:28:50,764 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2023-12-24 13:28:50,764 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:28:50,764 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:28:50,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1174093786] [2023-12-24 13:28:50,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1174093786] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:28:50,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:28:50,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 13:28:50,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010692277] [2023-12-24 13:28:50,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:28:50,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 13:28:50,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:28:50,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 13:28:50,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 13:28:50,813 INFO L87 Difference]: Start difference. First operand has 88 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 66 states have internal predecessors, (89), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-24 13:28:50,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:28:50,857 INFO L93 Difference]: Finished difference Result 173 states and 276 transitions. [2023-12-24 13:28:50,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 13:28:50,859 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 142 [2023-12-24 13:28:50,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:28:50,864 INFO L225 Difference]: With dead ends: 173 [2023-12-24 13:28:50,864 INFO L226 Difference]: Without dead ends: 86 [2023-12-24 13:28:50,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 13:28:50,869 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 13:28:50,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 13:28:50,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-12-24 13:28:50,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-12-24 13:28:50,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 64 states have (on average 1.3125) internal successors, (84), 64 states have internal predecessors, (84), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 13:28:50,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 124 transitions. [2023-12-24 13:28:50,918 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 124 transitions. Word has length 142 [2023-12-24 13:28:50,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:28:50,918 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 124 transitions. [2023-12-24 13:28:50,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-24 13:28:50,919 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 124 transitions. [2023-12-24 13:28:50,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-24 13:28:50,921 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:28:50,921 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:50,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-24 13:28:51,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:28:51,129 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:28:51,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:28:51,130 INFO L85 PathProgramCache]: Analyzing trace with hash -2013213484, now seen corresponding path program 1 times [2023-12-24 13:28:51,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:28:51,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2094439213] [2023-12-24 13:28:51,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:28:51,131 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:28:51,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:28:51,132 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:28:51,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-24 13:28:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:28:51,350 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 13:28:51,354 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:28:51,404 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 13:28:51,404 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:28:51,406 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:28:51,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2094439213] [2023-12-24 13:28:51,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2094439213] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:28:51,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:28:51,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 13:28:51,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847319117] [2023-12-24 13:28:51,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:28:51,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 13:28:51,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:28:51,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 13:28:51,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 13:28:51,413 INFO L87 Difference]: Start difference. First operand 86 states and 124 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 13:28:51,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:28:51,498 INFO L93 Difference]: Finished difference Result 192 states and 278 transitions. [2023-12-24 13:28:51,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 13:28:51,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 142 [2023-12-24 13:28:51,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:28:51,501 INFO L225 Difference]: With dead ends: 192 [2023-12-24 13:28:51,501 INFO L226 Difference]: Without dead ends: 107 [2023-12-24 13:28:51,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-24 13:28:51,503 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 46 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 13:28:51,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 374 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 13:28:51,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-12-24 13:28:51,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 88. [2023-12-24 13:28:51,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 66 states have (on average 1.303030303030303) internal successors, (86), 66 states have internal predecessors, (86), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 13:28:51,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 126 transitions. [2023-12-24 13:28:51,517 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 126 transitions. Word has length 142 [2023-12-24 13:28:51,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:28:51,519 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 126 transitions. [2023-12-24 13:28:51,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 13:28:51,519 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 126 transitions. [2023-12-24 13:28:51,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-24 13:28:51,520 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:28:51,521 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:51,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-24 13:28:51,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:28:51,722 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:28:51,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:28:51,723 INFO L85 PathProgramCache]: Analyzing trace with hash 983654265, now seen corresponding path program 1 times [2023-12-24 13:28:51,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:28:51,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [978292652] [2023-12-24 13:28:51,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:28:51,724 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:28:51,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:28:51,728 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:28:51,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-24 13:28:51,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:28:51,933 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 13:28:51,937 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:28:51,955 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 13:28:51,955 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:28:51,955 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:28:51,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [978292652] [2023-12-24 13:28:51,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [978292652] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:28:51,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:28:51,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 13:28:51,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061589730] [2023-12-24 13:28:51,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:28:51,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 13:28:51,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:28:51,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 13:28:51,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 13:28:51,957 INFO L87 Difference]: Start difference. First operand 88 states and 126 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 13:28:52,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:28:52,033 INFO L93 Difference]: Finished difference Result 196 states and 281 transitions. [2023-12-24 13:28:52,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 13:28:52,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2023-12-24 13:28:52,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:28:52,035 INFO L225 Difference]: With dead ends: 196 [2023-12-24 13:28:52,035 INFO L226 Difference]: Without dead ends: 109 [2023-12-24 13:28:52,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-24 13:28:52,036 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 46 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 13:28:52,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 457 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 13:28:52,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-12-24 13:28:52,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 92. [2023-12-24 13:28:52,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 70 states have internal predecessors, (90), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 13:28:52,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 130 transitions. [2023-12-24 13:28:52,043 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 130 transitions. Word has length 144 [2023-12-24 13:28:52,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:28:52,044 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 130 transitions. [2023-12-24 13:28:52,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 13:28:52,044 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 130 transitions. [2023-12-24 13:28:52,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-24 13:28:52,046 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:28:52,046 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:52,052 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 13:28:52,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:28:52,252 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:28:52,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:28:52,253 INFO L85 PathProgramCache]: Analyzing trace with hash 174307639, now seen corresponding path program 1 times [2023-12-24 13:28:52,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:28:52,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1251197368] [2023-12-24 13:28:52,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:28:52,254 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:28:52,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:28:52,255 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:28:52,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-24 13:28:52,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:28:52,473 INFO L262 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 13:28:52,478 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:28:52,503 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 13:28:52,504 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:28:52,504 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:28:52,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1251197368] [2023-12-24 13:28:52,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1251197368] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:28:52,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:28:52,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 13:28:52,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734923596] [2023-12-24 13:28:52,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:28:52,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 13:28:52,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:28:52,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 13:28:52,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-24 13:28:52,506 INFO L87 Difference]: Start difference. First operand 92 states and 130 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 13:28:52,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:28:52,610 INFO L93 Difference]: Finished difference Result 203 states and 286 transitions. [2023-12-24 13:28:52,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 13:28:52,610 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2023-12-24 13:28:52,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:28:52,612 INFO L225 Difference]: With dead ends: 203 [2023-12-24 13:28:52,612 INFO L226 Difference]: Without dead ends: 112 [2023-12-24 13:28:52,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-12-24 13:28:52,613 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 49 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 13:28:52,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 565 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 13:28:52,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-12-24 13:28:52,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 94. [2023-12-24 13:28:52,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 72 states have internal predecessors, (92), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 13:28:52,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 132 transitions. [2023-12-24 13:28:52,620 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 132 transitions. Word has length 144 [2023-12-24 13:28:52,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:28:52,620 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 132 transitions. [2023-12-24 13:28:52,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 13:28:52,620 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 132 transitions. [2023-12-24 13:28:52,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-24 13:28:52,621 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:28:52,621 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:52,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-24 13:28:52,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:28:52,828 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:28:52,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:28:52,828 INFO L85 PathProgramCache]: Analyzing trace with hash 231565941, now seen corresponding path program 1 times [2023-12-24 13:28:52,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:28:52,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [470323825] [2023-12-24 13:28:52,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:28:52,829 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:28:52,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:28:52,830 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:28:52,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-24 13:28:52,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:28:53,007 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 13:28:53,010 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:28:53,043 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 13:28:53,043 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:28:53,043 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:28:53,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [470323825] [2023-12-24 13:28:53,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [470323825] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:28:53,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:28:53,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-24 13:28:53,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568947472] [2023-12-24 13:28:53,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:28:53,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 13:28:53,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:28:53,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 13:28:53,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-24 13:28:53,045 INFO L87 Difference]: Start difference. First operand 94 states and 132 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 13:28:53,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:28:53,180 INFO L93 Difference]: Finished difference Result 206 states and 286 transitions. [2023-12-24 13:28:53,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-24 13:28:53,181 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2023-12-24 13:28:53,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:28:53,182 INFO L225 Difference]: With dead ends: 206 [2023-12-24 13:28:53,182 INFO L226 Difference]: Without dead ends: 113 [2023-12-24 13:28:53,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2023-12-24 13:28:53,183 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 40 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 13:28:53,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 667 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 13:28:53,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-12-24 13:28:53,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 96. [2023-12-24 13:28:53,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 74 states have internal predecessors, (94), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 13:28:53,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 134 transitions. [2023-12-24 13:28:53,188 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 134 transitions. Word has length 144 [2023-12-24 13:28:53,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:28:53,189 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 134 transitions. [2023-12-24 13:28:53,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 13:28:53,189 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 134 transitions. [2023-12-24 13:28:53,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-24 13:28:53,190 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:28:53,190 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:53,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-24 13:28:53,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:28:53,397 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:28:53,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:28:53,398 INFO L85 PathProgramCache]: Analyzing trace with hash 231625523, now seen corresponding path program 1 times [2023-12-24 13:28:53,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:28:53,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [229002401] [2023-12-24 13:28:53,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:28:53,398 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:28:53,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:28:53,399 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:28:53,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-24 13:28:53,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:28:53,610 INFO L262 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 13:28:53,614 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:28:53,639 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 13:28:53,640 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:28:53,640 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:28:53,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [229002401] [2023-12-24 13:28:53,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [229002401] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:28:53,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:28:53,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 13:28:53,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028485161] [2023-12-24 13:28:53,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:28:53,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 13:28:53,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:28:53,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 13:28:53,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 13:28:53,641 INFO L87 Difference]: Start difference. First operand 96 states and 134 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 13:28:53,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:28:53,858 INFO L93 Difference]: Finished difference Result 191 states and 267 transitions. [2023-12-24 13:28:53,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 13:28:53,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2023-12-24 13:28:53,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:28:53,860 INFO L225 Difference]: With dead ends: 191 [2023-12-24 13:28:53,860 INFO L226 Difference]: Without dead ends: 96 [2023-12-24 13:28:53,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 13:28:53,861 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 13:28:53,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 13:28:53,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-12-24 13:28:53,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2023-12-24 13:28:53,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 74 states have internal predecessors, (93), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 13:28:53,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 133 transitions. [2023-12-24 13:28:53,866 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 133 transitions. Word has length 144 [2023-12-24 13:28:53,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:28:53,867 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 133 transitions. [2023-12-24 13:28:53,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 13:28:53,867 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 133 transitions. [2023-12-24 13:28:53,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-24 13:28:53,868 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:28:53,868 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:53,878 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 (7)] Ended with exit code 0 [2023-12-24 13:28:54,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:28:54,076 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:28:54,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:28:54,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1477028840, now seen corresponding path program 1 times [2023-12-24 13:28:54,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:28:54,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1915039831] [2023-12-24 13:28:54,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:28:54,077 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:28:54,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:28:54,079 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:28:54,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-24 13:28:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:28:54,296 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 13:28:54,299 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:28:54,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-12-24 13:28:54,347 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 13:28:54,347 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:28:54,348 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:28:54,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1915039831] [2023-12-24 13:28:54,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1915039831] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:28:54,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:28:54,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 13:28:54,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132064670] [2023-12-24 13:28:54,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:28:54,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 13:28:54,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:28:54,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 13:28:54,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 13:28:54,349 INFO L87 Difference]: Start difference. First operand 96 states and 133 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 13:28:54,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:28:54,388 INFO L93 Difference]: Finished difference Result 191 states and 265 transitions. [2023-12-24 13:28:54,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 13:28:54,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 146 [2023-12-24 13:28:54,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:28:54,390 INFO L225 Difference]: With dead ends: 191 [2023-12-24 13:28:54,390 INFO L226 Difference]: Without dead ends: 96 [2023-12-24 13:28:54,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 13:28:54,391 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 1 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 13:28:54,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 230 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 13:28:54,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-12-24 13:28:54,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2023-12-24 13:28:54,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 74 states have (on average 1.2432432432432432) internal successors, (92), 74 states have internal predecessors, (92), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 13:28:54,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 132 transitions. [2023-12-24 13:28:54,395 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 132 transitions. Word has length 146 [2023-12-24 13:28:54,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:28:54,396 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 132 transitions. [2023-12-24 13:28:54,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 13:28:54,396 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 132 transitions. [2023-12-24 13:28:54,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-24 13:28:54,397 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:28:54,397 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:54,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-24 13:28:54,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:28:54,607 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:28:54,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:28:54,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1128994714, now seen corresponding path program 1 times [2023-12-24 13:28:54,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:28:54,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1822917289] [2023-12-24 13:28:54,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:28:54,608 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:28:54,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:28:54,609 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:28:54,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-24 13:28:54,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:28:54,787 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-24 13:28:54,791 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:28:54,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-12-24 13:28:54,843 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 13:28:54,843 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:28:54,843 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:28:54,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1822917289] [2023-12-24 13:28:54,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1822917289] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:28:54,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:28:54,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 13:28:54,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588328450] [2023-12-24 13:28:54,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:28:54,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 13:28:54,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:28:54,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 13:28:54,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 13:28:54,845 INFO L87 Difference]: Start difference. First operand 96 states and 132 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 13:28:55,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:28:55,114 INFO L93 Difference]: Finished difference Result 216 states and 297 transitions. [2023-12-24 13:28:55,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 13:28:55,114 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 146 [2023-12-24 13:28:55,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:28:55,115 INFO L225 Difference]: With dead ends: 216 [2023-12-24 13:28:55,115 INFO L226 Difference]: Without dead ends: 121 [2023-12-24 13:28:55,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 13:28:55,116 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 33 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 13:28:55,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 347 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 13:28:55,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-12-24 13:28:55,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 96. [2023-12-24 13:28:55,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 74 states have (on average 1.2297297297297298) internal successors, (91), 74 states have internal predecessors, (91), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 13:28:55,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 131 transitions. [2023-12-24 13:28:55,120 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 131 transitions. Word has length 146 [2023-12-24 13:28:55,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:28:55,121 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 131 transitions. [2023-12-24 13:28:55,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 13:28:55,121 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 131 transitions. [2023-12-24 13:28:55,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-24 13:28:55,122 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:28:55,122 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:55,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-24 13:28:55,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:28:55,341 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:28:55,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:28:55,341 INFO L85 PathProgramCache]: Analyzing trace with hash -150868964, now seen corresponding path program 1 times [2023-12-24 13:28:55,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:28:55,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [949230985] [2023-12-24 13:28:55,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:28:55,342 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:28:55,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:28:55,343 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:28:55,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-24 13:28:55,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:28:55,620 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-24 13:28:55,626 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:28:55,751 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 23 treesize of output 22 [2023-12-24 13:28:55,861 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:28:55,861 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 33 treesize of output 35 [2023-12-24 13:28:56,173 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:28:56,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 38 [2023-12-24 13:28:56,726 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 34 treesize of output 30 [2023-12-24 13:28:56,777 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 57 treesize of output 34 [2023-12-24 13:28:56,793 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 41 treesize of output 29 [2023-12-24 13:28:56,836 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:28:56,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 36 [2023-12-24 13:28:56,885 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2023-12-24 13:28:56,885 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:28:56,885 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:28:56,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [949230985] [2023-12-24 13:28:56,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [949230985] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:28:56,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:28:56,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-24 13:28:56,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860558869] [2023-12-24 13:28:56,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:28:56,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-24 13:28:56,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:28:56,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-24 13:28:56,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-12-24 13:28:56,887 INFO L87 Difference]: Start difference. First operand 96 states and 131 transitions. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 10 states have internal predecessors, (55), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-24 13:28:59,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:28:59,216 INFO L93 Difference]: Finished difference Result 390 states and 537 transitions. [2023-12-24 13:28:59,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-24 13:28:59,217 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 10 states have internal predecessors, (55), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 146 [2023-12-24 13:28:59,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:28:59,219 INFO L225 Difference]: With dead ends: 390 [2023-12-24 13:28:59,219 INFO L226 Difference]: Without dead ends: 295 [2023-12-24 13:28:59,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2023-12-24 13:28:59,220 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 376 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-24 13:28:59,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 913 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-24 13:28:59,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2023-12-24 13:28:59,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 183. [2023-12-24 13:28:59,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 140 states have (on average 1.2214285714285715) internal successors, (171), 140 states have internal predecessors, (171), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-24 13:28:59,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 251 transitions. [2023-12-24 13:28:59,248 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 251 transitions. Word has length 146 [2023-12-24 13:28:59,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:28:59,248 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 251 transitions. [2023-12-24 13:28:59,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 10 states have internal predecessors, (55), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-24 13:28:59,248 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 251 transitions. [2023-12-24 13:28:59,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-24 13:28:59,249 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:28:59,249 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:59,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-24 13:28:59,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:28:59,460 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:28:59,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:28:59,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1657340374, now seen corresponding path program 1 times [2023-12-24 13:28:59,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:28:59,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [388419333] [2023-12-24 13:28:59,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:28:59,461 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:28:59,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:28:59,462 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 13:28:59,464 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 13:28:59,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:28:59,665 INFO L262 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 13:28:59,667 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:28:59,690 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 13:28:59,690 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:28:59,690 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:28:59,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [388419333] [2023-12-24 13:28:59,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [388419333] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:28:59,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:28:59,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 13:28:59,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508673945] [2023-12-24 13:28:59,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:28:59,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 13:28:59,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:28:59,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 13:28:59,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 13:28:59,692 INFO L87 Difference]: Start difference. First operand 183 states and 251 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 13:28:59,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:28:59,755 INFO L93 Difference]: Finished difference Result 401 states and 549 transitions. [2023-12-24 13:28:59,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 13:28:59,756 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 146 [2023-12-24 13:28:59,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:28:59,757 INFO L225 Difference]: With dead ends: 401 [2023-12-24 13:28:59,757 INFO L226 Difference]: Without dead ends: 219 [2023-12-24 13:28:59,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-24 13:28:59,758 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 54 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 13:28:59,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 445 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 13:28:59,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-12-24 13:28:59,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 189. [2023-12-24 13:28:59,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 146 states have (on average 1.2123287671232876) internal successors, (177), 146 states have internal predecessors, (177), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-24 13:28:59,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 257 transitions. [2023-12-24 13:28:59,770 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 257 transitions. Word has length 146 [2023-12-24 13:28:59,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:28:59,770 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 257 transitions. [2023-12-24 13:28:59,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 13:28:59,771 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 257 transitions. [2023-12-24 13:28:59,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-24 13:28:59,771 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:28:59,771 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:59,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-12-24 13:28:59,977 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 13:28:59,978 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:28:59,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:28:59,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1710852133, now seen corresponding path program 1 times [2023-12-24 13:28:59,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:28:59,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [88271527] [2023-12-24 13:28:59,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:28:59,979 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:28:59,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:28:59,980 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:28:59,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-24 13:29:00,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:29:00,299 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-24 13:29:00,312 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:29:00,326 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 34 treesize of output 30 [2023-12-24 13:29:00,338 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 57 treesize of output 34 [2023-12-24 13:29:00,347 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 41 treesize of output 29 [2023-12-24 13:29:00,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 71 treesize of output 35 [2023-12-24 13:29:00,425 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 13:29:00,425 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:29:00,425 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:29:00,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [88271527] [2023-12-24 13:29:00,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [88271527] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:29:00,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:29:00,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-24 13:29:00,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447268086] [2023-12-24 13:29:00,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:29:00,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 13:29:00,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:29:00,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 13:29:00,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-24 13:29:00,427 INFO L87 Difference]: Start difference. First operand 189 states and 257 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 13:29:01,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:29:01,586 INFO L93 Difference]: Finished difference Result 407 states and 554 transitions. [2023-12-24 13:29:01,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-24 13:29:01,587 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 147 [2023-12-24 13:29:01,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:29:01,588 INFO L225 Difference]: With dead ends: 407 [2023-12-24 13:29:01,588 INFO L226 Difference]: Without dead ends: 309 [2023-12-24 13:29:01,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2023-12-24 13:29:01,589 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 207 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-24 13:29:01,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 880 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-24 13:29:01,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2023-12-24 13:29:01,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 95. [2023-12-24 13:29:01,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 73 states have internal predecessors, (89), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 13:29:01,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 129 transitions. [2023-12-24 13:29:01,599 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 129 transitions. Word has length 147 [2023-12-24 13:29:01,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:29:01,599 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 129 transitions. [2023-12-24 13:29:01,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 13:29:01,599 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 129 transitions. [2023-12-24 13:29:01,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-24 13:29:01,616 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:29:01,616 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:01,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-24 13:29:01,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:29:01,824 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:29:01,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:29:01,824 INFO L85 PathProgramCache]: Analyzing trace with hash -781700388, now seen corresponding path program 1 times [2023-12-24 13:29:01,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:29:01,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [199942069] [2023-12-24 13:29:01,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:29:01,826 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:29:01,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:29:01,826 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:29:01,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-24 13:29:01,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:29:02,005 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 13:29:02,008 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:29:02,298 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 93 proven. 54 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2023-12-24 13:29:02,298 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:29:02,397 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 13:29:02,397 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:29:02,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [199942069] [2023-12-24 13:29:02,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [199942069] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 13:29:02,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 13:29:02,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2023-12-24 13:29:02,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113401418] [2023-12-24 13:29:02,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:29:02,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 13:29:02,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:29:02,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 13:29:02,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-12-24 13:29:02,399 INFO L87 Difference]: Start difference. First operand 95 states and 129 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 13:29:02,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:29:02,462 INFO L93 Difference]: Finished difference Result 242 states and 324 transitions. [2023-12-24 13:29:02,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 13:29:02,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 148 [2023-12-24 13:29:02,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:29:02,464 INFO L225 Difference]: With dead ends: 242 [2023-12-24 13:29:02,464 INFO L226 Difference]: Without dead ends: 148 [2023-12-24 13:29:02,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-12-24 13:29:02,465 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 69 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 13:29:02,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 455 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 13:29:02,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-12-24 13:29:02,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 110. [2023-12-24 13:29:02,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 88 states have internal predecessors, (107), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 13:29:02,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 147 transitions. [2023-12-24 13:29:02,473 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 147 transitions. Word has length 148 [2023-12-24 13:29:02,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:29:02,473 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 147 transitions. [2023-12-24 13:29:02,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 13:29:02,473 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 147 transitions. [2023-12-24 13:29:02,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-24 13:29:02,474 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:29:02,474 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:02,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-24 13:29:02,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:29:02,675 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:29:02,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:29:02,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1642851742, now seen corresponding path program 1 times [2023-12-24 13:29:02,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:29:02,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [584020781] [2023-12-24 13:29:02,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:29:02,676 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:29:02,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:29:02,678 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:29:02,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-24 13:29:02,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:29:02,970 INFO L262 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-24 13:29:02,973 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:29:02,980 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 29 treesize of output 14 [2023-12-24 13:29:03,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2023-12-24 13:29:03,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2023-12-24 13:29:03,040 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 13:29:03,040 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:29:03,040 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:29:03,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [584020781] [2023-12-24 13:29:03,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [584020781] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:29:03,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:29:03,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 13:29:03,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989280412] [2023-12-24 13:29:03,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:29:03,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 13:29:03,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:29:03,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 13:29:03,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 13:29:03,041 INFO L87 Difference]: Start difference. First operand 110 states and 147 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 13:29:03,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:29:03,331 INFO L93 Difference]: Finished difference Result 136 states and 180 transitions. [2023-12-24 13:29:03,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 13:29:03,331 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 148 [2023-12-24 13:29:03,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:29:03,332 INFO L225 Difference]: With dead ends: 136 [2023-12-24 13:29:03,332 INFO L226 Difference]: Without dead ends: 134 [2023-12-24 13:29:03,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-24 13:29:03,333 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 52 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 13:29:03,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 418 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 13:29:03,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-12-24 13:29:03,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2023-12-24 13:29:03,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 101 states have (on average 1.188118811881188) internal successors, (120), 102 states have internal predecessors, (120), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-24 13:29:03,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 176 transitions. [2023-12-24 13:29:03,343 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 176 transitions. Word has length 148 [2023-12-24 13:29:03,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:29:03,344 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 176 transitions. [2023-12-24 13:29:03,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 13:29:03,344 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 176 transitions. [2023-12-24 13:29:03,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-24 13:29:03,344 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:29:03,345 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:03,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-24 13:29:03,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:29:03,553 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:29:03,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:29:03,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1642911324, now seen corresponding path program 1 times [2023-12-24 13:29:03,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:29:03,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1983850552] [2023-12-24 13:29:03,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:29:03,554 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:29:03,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:29:03,557 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:29:03,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-24 13:29:03,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:29:03,842 INFO L262 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 13:29:03,844 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:29:03,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-12-24 13:29:03,916 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:29:03,954 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 13:29:03,954 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:29:03,954 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:29:03,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1983850552] [2023-12-24 13:29:03,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1983850552] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:29:03,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:29:03,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 13:29:03,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032879908] [2023-12-24 13:29:03,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:29:03,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 13:29:03,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:29:03,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 13:29:03,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 13:29:03,955 INFO L87 Difference]: Start difference. First operand 132 states and 176 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 13:29:04,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:29:04,325 INFO L93 Difference]: Finished difference Result 247 states and 327 transitions. [2023-12-24 13:29:04,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 13:29:04,326 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 148 [2023-12-24 13:29:04,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:29:04,328 INFO L225 Difference]: With dead ends: 247 [2023-12-24 13:29:04,328 INFO L226 Difference]: Without dead ends: 132 [2023-12-24 13:29:04,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 13:29:04,329 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 33 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-24 13:29:04,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 356 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-24 13:29:04,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-12-24 13:29:04,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2023-12-24 13:29:04,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 101 states have (on average 1.1683168316831682) internal successors, (118), 102 states have internal predecessors, (118), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-24 13:29:04,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 174 transitions. [2023-12-24 13:29:04,339 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 174 transitions. Word has length 148 [2023-12-24 13:29:04,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:29:04,339 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 174 transitions. [2023-12-24 13:29:04,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 13:29:04,340 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 174 transitions. [2023-12-24 13:29:04,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-24 13:29:04,340 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:29:04,340 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:04,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-12-24 13:29:04,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:29:04,548 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:29:04,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:29:04,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1876474813, now seen corresponding path program 1 times [2023-12-24 13:29:04,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:29:04,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1859760570] [2023-12-24 13:29:04,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:29:04,549 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:29:04,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:29:04,550 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:29:04,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-24 13:29:04,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:29:04,892 INFO L262 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-24 13:29:04,897 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:29:05,017 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 26 treesize of output 14 [2023-12-24 13:29:05,045 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 25 treesize of output 24 [2023-12-24 13:29:05,174 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:29:05,174 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 35 treesize of output 37 [2023-12-24 13:29:05,703 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 29 treesize of output 18 [2023-12-24 13:29:05,978 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:29:05,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 60 [2023-12-24 13:29:05,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 33 [2023-12-24 13:29:06,003 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 484 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-12-24 13:29:06,003 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:29:06,003 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:29:06,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1859760570] [2023-12-24 13:29:06,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1859760570] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:29:06,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:29:06,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-24 13:29:06,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85134224] [2023-12-24 13:29:06,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:29:06,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 13:29:06,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:29:06,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 13:29:06,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-24 13:29:06,005 INFO L87 Difference]: Start difference. First operand 132 states and 174 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-24 13:29:07,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:29:07,157 INFO L93 Difference]: Finished difference Result 379 states and 499 transitions. [2023-12-24 13:29:07,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 13:29:07,158 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 150 [2023-12-24 13:29:07,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:29:07,159 INFO L225 Difference]: With dead ends: 379 [2023-12-24 13:29:07,159 INFO L226 Difference]: Without dead ends: 264 [2023-12-24 13:29:07,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-12-24 13:29:07,160 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 187 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-24 13:29:07,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 524 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-24 13:29:07,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2023-12-24 13:29:07,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 247. [2023-12-24 13:29:07,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 181 states have (on average 1.138121546961326) internal successors, (206), 182 states have internal predecessors, (206), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-24 13:29:07,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 326 transitions. [2023-12-24 13:29:07,183 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 326 transitions. Word has length 150 [2023-12-24 13:29:07,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:29:07,184 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 326 transitions. [2023-12-24 13:29:07,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-24 13:29:07,184 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 326 transitions. [2023-12-24 13:29:07,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-24 13:29:07,184 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:29:07,184 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:07,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-12-24 13:29:07,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:29:07,394 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:29:07,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:29:07,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1819216511, now seen corresponding path program 1 times [2023-12-24 13:29:07,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:29:07,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1163014701] [2023-12-24 13:29:07,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:29:07,395 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:29:07,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:29:07,396 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:29:07,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-12-24 13:29:07,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:29:07,665 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 13:29:07,668 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:29:07,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-12-24 13:29:07,730 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 13:29:07,731 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:29:07,731 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:29:07,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1163014701] [2023-12-24 13:29:07,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1163014701] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:29:07,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:29:07,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 13:29:07,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62629141] [2023-12-24 13:29:07,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:29:07,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 13:29:07,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:29:07,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 13:29:07,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 13:29:07,732 INFO L87 Difference]: Start difference. First operand 247 states and 326 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 13:29:07,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:29:07,890 INFO L93 Difference]: Finished difference Result 472 states and 618 transitions. [2023-12-24 13:29:07,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 13:29:07,891 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2023-12-24 13:29:07,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:29:07,893 INFO L225 Difference]: With dead ends: 472 [2023-12-24 13:29:07,894 INFO L226 Difference]: Without dead ends: 270 [2023-12-24 13:29:07,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-24 13:29:07,894 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 113 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 642 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.1s IncrementalHoareTripleChecker+Time [2023-12-24 13:29:07,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 642 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 13:29:07,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2023-12-24 13:29:07,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 247. [2023-12-24 13:29:07,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 181 states have (on average 1.12707182320442) internal successors, (204), 182 states have internal predecessors, (204), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-24 13:29:07,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 324 transitions. [2023-12-24 13:29:07,927 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 324 transitions. Word has length 150 [2023-12-24 13:29:07,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:29:07,928 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 324 transitions. [2023-12-24 13:29:07,928 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 13:29:07,928 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 324 transitions. [2023-12-24 13:29:07,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-24 13:29:07,928 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:29:07,929 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:07,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-12-24 13:29:08,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:29:08,137 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:29:08,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:29:08,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1666404159, now seen corresponding path program 1 times [2023-12-24 13:29:08,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:29:08,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [997791480] [2023-12-24 13:29:08,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:29:08,138 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:29:08,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:29:08,139 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:29:08,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-12-24 13:29:08,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:29:08,399 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 13:29:08,401 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:29:08,415 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 13:29:08,415 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:29:08,415 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:29:08,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [997791480] [2023-12-24 13:29:08,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [997791480] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:29:08,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:29:08,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 13:29:08,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021175985] [2023-12-24 13:29:08,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:29:08,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 13:29:08,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:29:08,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 13:29:08,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 13:29:08,417 INFO L87 Difference]: Start difference. First operand 247 states and 324 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 13:29:08,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:29:08,496 INFO L93 Difference]: Finished difference Result 466 states and 604 transitions. [2023-12-24 13:29:08,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 13:29:08,497 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2023-12-24 13:29:08,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:29:08,498 INFO L225 Difference]: With dead ends: 466 [2023-12-24 13:29:08,498 INFO L226 Difference]: Without dead ends: 264 [2023-12-24 13:29:08,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-24 13:29:08,499 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 20 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 13:29:08,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 437 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 13:29:08,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2023-12-24 13:29:08,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 253. [2023-12-24 13:29:08,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 187 states have (on average 1.1229946524064172) internal successors, (210), 188 states have internal predecessors, (210), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-24 13:29:08,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 330 transitions. [2023-12-24 13:29:08,528 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 330 transitions. Word has length 150 [2023-12-24 13:29:08,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:29:08,529 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 330 transitions. [2023-12-24 13:29:08,529 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 13:29:08,529 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 330 transitions. [2023-12-24 13:29:08,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-24 13:29:08,530 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:29:08,530 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:08,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2023-12-24 13:29:08,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:29:08,739 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:29:08,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:29:08,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1309994932, now seen corresponding path program 1 times [2023-12-24 13:29:08,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:29:08,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [948521] [2023-12-24 13:29:08,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:29:08,740 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:29:08,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:29:08,741 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:29:08,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-12-24 13:29:09,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:29:09,068 INFO L262 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-24 13:29:09,072 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:29:09,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-24 13:29:09,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-12-24 13:29:09,160 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 25 treesize of output 24 [2023-12-24 13:29:09,440 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:29:09,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 45 [2023-12-24 13:29:09,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:29:09,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 80 treesize of output 38 [2023-12-24 13:29:09,642 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 484 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-12-24 13:29:09,642 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:29:09,642 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:29:09,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [948521] [2023-12-24 13:29:09,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [948521] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:29:09,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:29:09,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-24 13:29:09,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598413422] [2023-12-24 13:29:09,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:29:09,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-24 13:29:09,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:29:09,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-24 13:29:09,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-24 13:29:09,643 INFO L87 Difference]: Start difference. First operand 253 states and 330 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-24 13:29:10,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:29:10,929 INFO L93 Difference]: Finished difference Result 461 states and 591 transitions. [2023-12-24 13:29:10,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-24 13:29:10,930 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 151 [2023-12-24 13:29:10,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:29:10,932 INFO L225 Difference]: With dead ends: 461 [2023-12-24 13:29:10,932 INFO L226 Difference]: Without dead ends: 343 [2023-12-24 13:29:10,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2023-12-24 13:29:10,933 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 265 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-24 13:29:10,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 671 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-24 13:29:10,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2023-12-24 13:29:10,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 254. [2023-12-24 13:29:10,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 188 states have (on average 1.122340425531915) internal successors, (211), 189 states have internal predecessors, (211), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-24 13:29:10,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 331 transitions. [2023-12-24 13:29:10,978 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 331 transitions. Word has length 151 [2023-12-24 13:29:10,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:29:10,978 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 331 transitions. [2023-12-24 13:29:10,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-24 13:29:10,978 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 331 transitions. [2023-12-24 13:29:10,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-24 13:29:10,979 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:29:10,979 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:10,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-12-24 13:29:11,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:29:11,186 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:29:11,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:29:11,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1114616780, now seen corresponding path program 1 times [2023-12-24 13:29:11,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:29:11,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [914258765] [2023-12-24 13:29:11,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:29:11,187 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:29:11,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:29:11,188 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:29:11,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-12-24 13:29:11,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:29:11,438 INFO L262 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 13:29:11,441 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:29:11,702 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:29:11,720 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 93 proven. 54 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2023-12-24 13:29:11,720 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:29:11,821 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 13:29:11,821 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:29:11,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [914258765] [2023-12-24 13:29:11,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [914258765] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 13:29:11,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 13:29:11,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2023-12-24 13:29:11,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228655333] [2023-12-24 13:29:11,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:29:11,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 13:29:11,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:29:11,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 13:29:11,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-12-24 13:29:11,822 INFO L87 Difference]: Start difference. First operand 254 states and 331 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 13:29:11,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:29:11,904 INFO L93 Difference]: Finished difference Result 401 states and 515 transitions. [2023-12-24 13:29:11,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 13:29:11,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 151 [2023-12-24 13:29:11,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:29:11,906 INFO L225 Difference]: With dead ends: 401 [2023-12-24 13:29:11,906 INFO L226 Difference]: Without dead ends: 282 [2023-12-24 13:29:11,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-12-24 13:29:11,907 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 104 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 13:29:11,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 365 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 13:29:11,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2023-12-24 13:29:11,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 254. [2023-12-24 13:29:11,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 188 states have (on average 1.1170212765957446) internal successors, (210), 189 states have internal predecessors, (210), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-24 13:29:11,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 330 transitions. [2023-12-24 13:29:11,933 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 330 transitions. Word has length 151 [2023-12-24 13:29:11,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:29:11,933 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 330 transitions. [2023-12-24 13:29:11,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 13:29:11,933 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 330 transitions. [2023-12-24 13:29:11,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-24 13:29:11,934 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:29:11,934 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:11,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-12-24 13:29:12,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:29:12,142 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:29:12,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:29:12,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1769092070, now seen corresponding path program 1 times [2023-12-24 13:29:12,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:29:12,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [557222075] [2023-12-24 13:29:12,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:29:12,143 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:29:12,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:29:12,144 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:29:12,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-12-24 13:29:12,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:29:12,408 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-24 13:29:12,410 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:29:14,515 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:29:14,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 35 [2023-12-24 13:29:15,600 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 13:29:15,600 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:29:15,600 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:29:15,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [557222075] [2023-12-24 13:29:15,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [557222075] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:29:15,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:29:15,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 13:29:15,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304699942] [2023-12-24 13:29:15,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:29:15,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 13:29:15,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:29:15,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 13:29:15,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 13:29:15,601 INFO L87 Difference]: Start difference. First operand 254 states and 330 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 13:29:24,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:29:24,188 INFO L93 Difference]: Finished difference Result 600 states and 753 transitions. [2023-12-24 13:29:24,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 13:29:24,199 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 152 [2023-12-24 13:29:24,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:29:24,201 INFO L225 Difference]: With dead ends: 600 [2023-12-24 13:29:24,201 INFO L226 Difference]: Without dead ends: 391 [2023-12-24 13:29:24,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-24 13:29:24,203 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 74 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2023-12-24 13:29:24,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 355 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2023-12-24 13:29:24,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-12-24 13:29:24,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 259. [2023-12-24 13:29:24,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 214 states have (on average 1.1168224299065421) internal successors, (239), 214 states have internal predecessors, (239), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-24 13:29:24,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 319 transitions. [2023-12-24 13:29:24,234 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 319 transitions. Word has length 152 [2023-12-24 13:29:24,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:29:24,234 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 319 transitions. [2023-12-24 13:29:24,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 13:29:24,235 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 319 transitions. [2023-12-24 13:29:24,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-24 13:29:24,235 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:29:24,235 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:24,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-12-24 13:29:24,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:29:24,444 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:29:24,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:29:24,444 INFO L85 PathProgramCache]: Analyzing trace with hash 434431998, now seen corresponding path program 1 times [2023-12-24 13:29:24,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:29:24,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [129968061] [2023-12-24 13:29:24,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:29:24,445 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:29:24,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:29:24,446 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:29:24,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 (22)] Waiting until timeout for monitored process [2023-12-24 13:29:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:29:24,814 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 13:29:24,816 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:29:24,824 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 29 treesize of output 18 [2023-12-24 13:29:24,956 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 66 treesize of output 48 [2023-12-24 13:29:24,962 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 48 treesize of output 30 [2023-12-24 13:29:25,004 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 13:29:25,005 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:29:25,005 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:29:25,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [129968061] [2023-12-24 13:29:25,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [129968061] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:29:25,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:29:25,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 13:29:25,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031588714] [2023-12-24 13:29:25,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:29:25,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 13:29:25,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:29:25,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 13:29:25,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 13:29:25,006 INFO L87 Difference]: Start difference. First operand 259 states and 319 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 13:29:25,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:29:25,888 INFO L93 Difference]: Finished difference Result 478 states and 596 transitions. [2023-12-24 13:29:25,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 13:29:25,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 153 [2023-12-24 13:29:25,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:29:25,891 INFO L225 Difference]: With dead ends: 478 [2023-12-24 13:29:25,891 INFO L226 Difference]: Without dead ends: 325 [2023-12-24 13:29:25,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-24 13:29:25,891 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 95 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-24 13:29:25,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 515 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-24 13:29:25,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2023-12-24 13:29:25,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 154. [2023-12-24 13:29:25,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 131 states have (on average 1.1297709923664123) internal successors, (148), 131 states have internal predecessors, (148), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 13:29:25,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 188 transitions. [2023-12-24 13:29:25,905 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 188 transitions. Word has length 153 [2023-12-24 13:29:25,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:29:25,905 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 188 transitions. [2023-12-24 13:29:25,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 13:29:25,905 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 188 transitions. [2023-12-24 13:29:25,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-24 13:29:25,906 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:29:25,906 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:25,916 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 (22)] Ended with exit code 0 [2023-12-24 13:29:26,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:29:26,116 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:29:26,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:29:26,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1503709583, now seen corresponding path program 1 times [2023-12-24 13:29:26,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:29:26,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1636770458] [2023-12-24 13:29:26,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:29:26,117 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:29:26,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:29:26,129 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:29:26,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-12-24 13:29:26,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:29:26,365 INFO L262 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 13:29:26,368 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:29:26,418 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:29:26,428 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:29:27,762 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 13:29:27,763 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:29:27,763 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:29:27,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1636770458] [2023-12-24 13:29:27,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1636770458] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:29:27,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:29:27,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 13:29:27,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934592821] [2023-12-24 13:29:27,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:29:27,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 13:29:27,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:29:27,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 13:29:27,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 13:29:27,764 INFO L87 Difference]: Start difference. First operand 154 states and 188 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 13:29:28,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:29:28,367 INFO L93 Difference]: Finished difference Result 461 states and 563 transitions. [2023-12-24 13:29:28,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 13:29:28,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 153 [2023-12-24 13:29:28,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:29:28,370 INFO L225 Difference]: With dead ends: 461 [2023-12-24 13:29:28,370 INFO L226 Difference]: Without dead ends: 308 [2023-12-24 13:29:28,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-24 13:29:28,371 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 70 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-24 13:29:28,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 287 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-24 13:29:28,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2023-12-24 13:29:28,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 236. [2023-12-24 13:29:28,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 191 states have (on average 1.12565445026178) internal successors, (215), 191 states have internal predecessors, (215), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-24 13:29:28,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 295 transitions. [2023-12-24 13:29:28,403 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 295 transitions. Word has length 153 [2023-12-24 13:29:28,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:29:28,404 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 295 transitions. [2023-12-24 13:29:28,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 13:29:28,404 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 295 transitions. [2023-12-24 13:29:28,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-24 13:29:28,405 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:29:28,405 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:28,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2023-12-24 13:29:28,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:29:28,611 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:29:28,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:29:28,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1511394035, now seen corresponding path program 1 times [2023-12-24 13:29:28,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:29:28,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2042505161] [2023-12-24 13:29:28,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:29:28,612 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:29:28,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:29:28,613 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:29:28,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-12-24 13:29:29,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:29:29,081 INFO L262 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-24 13:29:29,085 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:29:29,104 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:29:29,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-24 13:29:29,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2023-12-24 13:29:30,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 33 [2023-12-24 13:29:34,788 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:29:34,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 66 [2023-12-24 13:29:34,861 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:29:34,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 66 [2023-12-24 13:29:35,376 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:29:35,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 117 treesize of output 51 [2023-12-24 13:29:35,762 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 315 proven. 126 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2023-12-24 13:29:35,762 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:29:36,912 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 13:29:36,913 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:29:36,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2042505161] [2023-12-24 13:29:36,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2042505161] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 13:29:36,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 13:29:36,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [20] total 25 [2023-12-24 13:29:36,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653719629] [2023-12-24 13:29:36,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:29:36,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 13:29:36,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:29:36,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 13:29:36,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2023-12-24 13:29:36,914 INFO L87 Difference]: Start difference. First operand 236 states and 295 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 13:29:38,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:29:38,293 INFO L93 Difference]: Finished difference Result 507 states and 614 transitions. [2023-12-24 13:29:38,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 13:29:38,294 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 153 [2023-12-24 13:29:38,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:29:38,295 INFO L225 Difference]: With dead ends: 507 [2023-12-24 13:29:38,295 INFO L226 Difference]: Without dead ends: 352 [2023-12-24 13:29:38,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 279 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2023-12-24 13:29:38,296 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 139 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-24 13:29:38,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 475 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-24 13:29:38,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2023-12-24 13:29:38,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 264. [2023-12-24 13:29:38,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 219 states have (on average 1.1187214611872147) internal successors, (245), 219 states have internal predecessors, (245), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-24 13:29:38,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 325 transitions. [2023-12-24 13:29:38,322 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 325 transitions. Word has length 153 [2023-12-24 13:29:38,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:29:38,322 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 325 transitions. [2023-12-24 13:29:38,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 13:29:38,322 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 325 transitions. [2023-12-24 13:29:38,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-24 13:29:38,323 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:29:38,323 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:38,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2023-12-24 13:29:38,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:29:38,530 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:29:38,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:29:38,530 INFO L85 PathProgramCache]: Analyzing trace with hash -277808769, now seen corresponding path program 1 times [2023-12-24 13:29:38,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:29:38,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1491712154] [2023-12-24 13:29:38,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:29:38,531 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:29:38,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:29:38,532 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:29:38,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-12-24 13:29:38,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:29:38,974 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 50 conjunts are in the unsatisfiable core [2023-12-24 13:29:38,978 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:29:39,269 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 23 treesize of output 22 [2023-12-24 13:29:39,449 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:29:39,449 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 13:29:39,655 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:29:39,655 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 33 treesize of output 35 [2023-12-24 13:29:40,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-24 13:29:41,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 20 [2023-12-24 13:29:44,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:29:44,236 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 83 treesize of output 67 [2023-12-24 13:29:45,799 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:29:45,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 54 [2023-12-24 13:29:46,092 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:29:46,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 87 [2023-12-24 13:29:46,454 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 602 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2023-12-24 13:29:46,455 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:29:46,455 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:29:46,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1491712154] [2023-12-24 13:29:46,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1491712154] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:29:46,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:29:46,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2023-12-24 13:29:46,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173368929] [2023-12-24 13:29:46,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:29:46,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-24 13:29:46,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:29:46,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-24 13:29:46,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=833, Unknown=0, NotChecked=0, Total=1056 [2023-12-24 13:29:46,456 INFO L87 Difference]: Start difference. First operand 264 states and 325 transitions. Second operand has 33 states, 28 states have (on average 2.7857142857142856) internal successors, (78), 28 states have internal predecessors, (78), 8 states have call successors, (20), 7 states have call predecessors, (20), 8 states have return successors, (20), 8 states have call predecessors, (20), 8 states have call successors, (20) [2023-12-24 13:30:01,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:30:01,974 INFO L93 Difference]: Finished difference Result 708 states and 836 transitions. [2023-12-24 13:30:01,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-12-24 13:30:01,976 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 28 states have (on average 2.7857142857142856) internal successors, (78), 28 states have internal predecessors, (78), 8 states have call successors, (20), 7 states have call predecessors, (20), 8 states have return successors, (20), 8 states have call predecessors, (20), 8 states have call successors, (20) Word has length 154 [2023-12-24 13:30:01,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:30:01,977 INFO L225 Difference]: With dead ends: 708 [2023-12-24 13:30:01,977 INFO L226 Difference]: Without dead ends: 527 [2023-12-24 13:30:01,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 834 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=661, Invalid=3121, Unknown=0, NotChecked=0, Total=3782 [2023-12-24 13:30:01,979 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 232 mSDsluCounter, 1229 mSDsCounter, 0 mSdLazyCounter, 2238 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 2255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2023-12-24 13:30:01,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 1322 Invalid, 2255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2238 Invalid, 0 Unknown, 0 Unchecked, 10.8s Time] [2023-12-24 13:30:01,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2023-12-24 13:30:02,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 427. [2023-12-24 13:30:02,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 350 states have (on average 1.1) internal successors, (385), 350 states have internal predecessors, (385), 60 states have call successors, (60), 16 states have call predecessors, (60), 16 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-24 13:30:02,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 505 transitions. [2023-12-24 13:30:02,033 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 505 transitions. Word has length 154 [2023-12-24 13:30:02,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:30:02,033 INFO L495 AbstractCegarLoop]: Abstraction has 427 states and 505 transitions. [2023-12-24 13:30:02,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 28 states have (on average 2.7857142857142856) internal successors, (78), 28 states have internal predecessors, (78), 8 states have call successors, (20), 7 states have call predecessors, (20), 8 states have return successors, (20), 8 states have call predecessors, (20), 8 states have call successors, (20) [2023-12-24 13:30:02,033 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 505 transitions. [2023-12-24 13:30:02,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-24 13:30:02,034 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:30:02,034 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:02,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2023-12-24 13:30:02,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:30:02,245 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:30:02,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:30:02,245 INFO L85 PathProgramCache]: Analyzing trace with hash -19643331, now seen corresponding path program 1 times [2023-12-24 13:30:02,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:30:02,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [707164149] [2023-12-24 13:30:02,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:30:02,246 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:30:02,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:30:02,247 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:30:02,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-12-24 13:30:02,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:30:02,658 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-24 13:30:02,662 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:30:02,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-12-24 13:30:03,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 34 [2023-12-24 13:30:04,902 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:30:04,903 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 77 treesize of output 44 [2023-12-24 13:30:05,367 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:30:05,367 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 82 treesize of output 34 [2023-12-24 13:30:05,510 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-24 13:30:05,510 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:30:05,510 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:30:05,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [707164149] [2023-12-24 13:30:05,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [707164149] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:30:05,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:30:05,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2023-12-24 13:30:05,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089591300] [2023-12-24 13:30:05,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:30:05,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-24 13:30:05,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:30:05,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-24 13:30:05,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2023-12-24 13:30:05,512 INFO L87 Difference]: Start difference. First operand 427 states and 505 transitions. Second operand has 23 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 18 states have internal predecessors, (69), 5 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2023-12-24 13:30:10,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:30:10,722 INFO L93 Difference]: Finished difference Result 995 states and 1161 transitions. [2023-12-24 13:30:10,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-24 13:30:10,723 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 18 states have internal predecessors, (69), 5 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) Word has length 154 [2023-12-24 13:30:10,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:30:10,726 INFO L225 Difference]: With dead ends: 995 [2023-12-24 13:30:10,726 INFO L226 Difference]: Without dead ends: 671 [2023-12-24 13:30:10,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=312, Invalid=1170, Unknown=0, NotChecked=0, Total=1482 [2023-12-24 13:30:10,728 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 254 mSDsluCounter, 1185 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 1342 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-12-24 13:30:10,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 1342 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2023-12-24 13:30:10,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2023-12-24 13:30:10,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 507. [2023-12-24 13:30:10,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 426 states have (on average 1.091549295774648) internal successors, (465), 426 states have internal predecessors, (465), 60 states have call successors, (60), 20 states have call predecessors, (60), 20 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-24 13:30:10,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 585 transitions. [2023-12-24 13:30:10,822 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 585 transitions. Word has length 154 [2023-12-24 13:30:10,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:30:10,822 INFO L495 AbstractCegarLoop]: Abstraction has 507 states and 585 transitions. [2023-12-24 13:30:10,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 18 states have internal predecessors, (69), 5 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2023-12-24 13:30:10,823 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 585 transitions. [2023-12-24 13:30:10,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-24 13:30:10,825 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:30:10,825 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:10,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2023-12-24 13:30:11,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:30:11,037 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:30:11,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:30:11,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1108394625, now seen corresponding path program 1 times [2023-12-24 13:30:11,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:30:11,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1077610590] [2023-12-24 13:30:11,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:30:11,038 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:30:11,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:30:11,057 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:30:11,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-12-24 13:30:11,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:30:11,458 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-24 13:30:11,462 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:30:11,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-24 13:30:11,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 20 [2023-12-24 13:30:13,052 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:30:13,053 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 58 treesize of output 37 [2023-12-24 13:30:13,410 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:30:13,411 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 63 treesize of output 27 [2023-12-24 13:30:13,554 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-24 13:30:13,554 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:30:13,554 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:30:13,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1077610590] [2023-12-24 13:30:13,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1077610590] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:30:13,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:30:13,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2023-12-24 13:30:13,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066654601] [2023-12-24 13:30:13,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:30:13,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-24 13:30:13,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:30:13,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-24 13:30:13,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2023-12-24 13:30:13,557 INFO L87 Difference]: Start difference. First operand 507 states and 585 transitions. Second operand has 21 states, 17 states have (on average 4.0588235294117645) internal successors, (69), 18 states have internal predecessors, (69), 5 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2023-12-24 13:30:16,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:30:16,162 INFO L93 Difference]: Finished difference Result 1058 states and 1221 transitions. [2023-12-24 13:30:16,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-24 13:30:16,162 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 4.0588235294117645) internal successors, (69), 18 states have internal predecessors, (69), 5 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) Word has length 154 [2023-12-24 13:30:16,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:30:16,164 INFO L225 Difference]: With dead ends: 1058 [2023-12-24 13:30:16,164 INFO L226 Difference]: Without dead ends: 668 [2023-12-24 13:30:16,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=249, Invalid=1083, Unknown=0, NotChecked=0, Total=1332 [2023-12-24 13:30:16,166 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 362 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-24 13:30:16,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 1086 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-24 13:30:16,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2023-12-24 13:30:16,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 507. [2023-12-24 13:30:16,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 426 states have (on average 1.0868544600938967) internal successors, (463), 426 states have internal predecessors, (463), 60 states have call successors, (60), 20 states have call predecessors, (60), 20 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-24 13:30:16,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 583 transitions. [2023-12-24 13:30:16,225 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 583 transitions. Word has length 154 [2023-12-24 13:30:16,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:30:16,225 INFO L495 AbstractCegarLoop]: Abstraction has 507 states and 583 transitions. [2023-12-24 13:30:16,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 4.0588235294117645) internal successors, (69), 18 states have internal predecessors, (69), 5 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2023-12-24 13:30:16,225 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 583 transitions. [2023-12-24 13:30:16,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-24 13:30:16,226 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:30:16,226 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:16,235 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 13:30:16,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:30:16,435 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:30:16,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:30:16,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1366560063, now seen corresponding path program 1 times [2023-12-24 13:30:16,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:30:16,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [624057015] [2023-12-24 13:30:16,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:30:16,436 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:30:16,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:30:16,453 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:30:16,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-12-24 13:30:17,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:30:17,020 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-24 13:30:17,024 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:30:17,222 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 23 treesize of output 22 [2023-12-24 13:30:17,340 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:30:17,341 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 13:30:17,494 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:30:17,494 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 13:30:18,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-12-24 13:30:19,642 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 74 treesize of output 55 [2023-12-24 13:30:20,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:30:20,899 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 42 [2023-12-24 13:30:21,175 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:30:21,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 151 treesize of output 87 [2023-12-24 13:30:21,551 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 547 proven. 6 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2023-12-24 13:30:21,551 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:30:22,826 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 13:30:22,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:30:22,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [624057015] [2023-12-24 13:30:22,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [624057015] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 13:30:22,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 13:30:22,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [24] total 31 [2023-12-24 13:30:22,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991489168] [2023-12-24 13:30:22,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:30:22,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-24 13:30:22,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:30:22,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-24 13:30:22,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=780, Unknown=0, NotChecked=0, Total=930 [2023-12-24 13:30:22,828 INFO L87 Difference]: Start difference. First operand 507 states and 583 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 13:30:26,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:30:26,258 INFO L93 Difference]: Finished difference Result 1018 states and 1171 transitions. [2023-12-24 13:30:26,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-24 13:30:26,259 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 154 [2023-12-24 13:30:26,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:30:26,261 INFO L225 Difference]: With dead ends: 1018 [2023-12-24 13:30:26,261 INFO L226 Difference]: Without dead ends: 628 [2023-12-24 13:30:26,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=228, Invalid=1412, Unknown=0, NotChecked=0, Total=1640 [2023-12-24 13:30:26,263 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 108 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-12-24 13:30:26,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 1166 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-12-24 13:30:26,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2023-12-24 13:30:26,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 550. [2023-12-24 13:30:26,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 454 states have (on average 1.079295154185022) internal successors, (490), 455 states have internal predecessors, (490), 73 states have call successors, (73), 22 states have call predecessors, (73), 22 states have return successors, (73), 72 states have call predecessors, (73), 73 states have call successors, (73) [2023-12-24 13:30:26,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 636 transitions. [2023-12-24 13:30:26,342 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 636 transitions. Word has length 154 [2023-12-24 13:30:26,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:30:26,342 INFO L495 AbstractCegarLoop]: Abstraction has 550 states and 636 transitions. [2023-12-24 13:30:26,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 13:30:26,342 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 636 transitions. [2023-12-24 13:30:26,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-24 13:30:26,343 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:30:26,343 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:26,354 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 13:30:26,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:30:26,553 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:30:26,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:30:26,553 INFO L85 PathProgramCache]: Analyzing trace with hash -812197323, now seen corresponding path program 1 times [2023-12-24 13:30:26,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:30:26,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1727959742] [2023-12-24 13:30:26,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:30:26,554 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:30:26,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:30:26,555 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:30:26,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-12-24 13:30:26,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:30:26,767 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 13:30:26,770 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:30:26,814 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:30:26,823 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:30:27,839 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 13:30:27,839 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:30:27,840 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:30:27,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1727959742] [2023-12-24 13:30:27,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1727959742] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:30:27,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:30:27,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 13:30:27,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866547489] [2023-12-24 13:30:27,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:30:27,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 13:30:27,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:30:27,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 13:30:27,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 13:30:27,842 INFO L87 Difference]: Start difference. First operand 550 states and 636 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 13:30:28,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:30:28,668 INFO L93 Difference]: Finished difference Result 1076 states and 1227 transitions. [2023-12-24 13:30:28,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 13:30:28,669 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 154 [2023-12-24 13:30:28,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:30:28,671 INFO L225 Difference]: With dead ends: 1076 [2023-12-24 13:30:28,671 INFO L226 Difference]: Without dead ends: 732 [2023-12-24 13:30:28,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-24 13:30:28,672 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 107 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-24 13:30:28,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 346 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-24 13:30:28,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2023-12-24 13:30:28,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 550. [2023-12-24 13:30:28,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 454 states have (on average 1.077092511013216) internal successors, (489), 455 states have internal predecessors, (489), 73 states have call successors, (73), 22 states have call predecessors, (73), 22 states have return successors, (73), 72 states have call predecessors, (73), 73 states have call successors, (73) [2023-12-24 13:30:28,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 635 transitions. [2023-12-24 13:30:28,746 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 635 transitions. Word has length 154 [2023-12-24 13:30:28,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:30:28,747 INFO L495 AbstractCegarLoop]: Abstraction has 550 states and 635 transitions. [2023-12-24 13:30:28,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 13:30:28,747 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 635 transitions. [2023-12-24 13:30:28,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-24 13:30:28,747 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:30:28,748 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:28,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2023-12-24 13:30:28,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:30:28,954 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:30:28,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:30:28,954 INFO L85 PathProgramCache]: Analyzing trace with hash -789565069, now seen corresponding path program 1 times [2023-12-24 13:30:28,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:30:28,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1896969861] [2023-12-24 13:30:28,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:30:28,955 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:30:28,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:30:28,956 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:30:28,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-12-24 13:30:29,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:30:29,250 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-24 13:30:29,262 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:30:29,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-12-24 13:30:29,380 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 23 treesize of output 22 [2023-12-24 13:30:29,634 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:30:29,634 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 33 treesize of output 35 [2023-12-24 13:30:30,445 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:30:30,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 49 [2023-12-24 13:30:30,851 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:30:30,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 88 treesize of output 42 [2023-12-24 13:30:31,026 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 548 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2023-12-24 13:30:31,026 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:30:31,026 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:30:31,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1896969861] [2023-12-24 13:30:31,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1896969861] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:30:31,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:30:31,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-24 13:30:31,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102139291] [2023-12-24 13:30:31,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:30:31,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-24 13:30:31,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:30:31,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-24 13:30:31,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-12-24 13:30:31,028 INFO L87 Difference]: Start difference. First operand 550 states and 635 transitions. Second operand has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 4 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2023-12-24 13:30:33,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:30:33,713 INFO L93 Difference]: Finished difference Result 960 states and 1111 transitions. [2023-12-24 13:30:33,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-24 13:30:33,714 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 4 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 154 [2023-12-24 13:30:33,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:30:33,716 INFO L225 Difference]: With dead ends: 960 [2023-12-24 13:30:33,716 INFO L226 Difference]: Without dead ends: 660 [2023-12-24 13:30:33,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=157, Invalid=305, Unknown=0, NotChecked=0, Total=462 [2023-12-24 13:30:33,717 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 281 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-24 13:30:33,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 743 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-24 13:30:33,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2023-12-24 13:30:33,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 528. [2023-12-24 13:30:33,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 432 states have (on average 1.0717592592592593) internal successors, (463), 433 states have internal predecessors, (463), 73 states have call successors, (73), 22 states have call predecessors, (73), 22 states have return successors, (73), 72 states have call predecessors, (73), 73 states have call successors, (73) [2023-12-24 13:30:33,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 609 transitions. [2023-12-24 13:30:33,868 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 609 transitions. Word has length 154 [2023-12-24 13:30:33,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:30:33,868 INFO L495 AbstractCegarLoop]: Abstraction has 528 states and 609 transitions. [2023-12-24 13:30:33,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 4 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2023-12-24 13:30:33,869 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 609 transitions. [2023-12-24 13:30:33,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-12-24 13:30:33,869 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:30:33,869 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:33,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2023-12-24 13:30:34,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:30:34,088 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:30:34,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:30:34,089 INFO L85 PathProgramCache]: Analyzing trace with hash -513132806, now seen corresponding path program 1 times [2023-12-24 13:30:34,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:30:34,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1994919419] [2023-12-24 13:30:34,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:30:34,089 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:30:34,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:30:34,090 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:30:34,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-12-24 13:30:34,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:30:34,742 INFO L262 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 50 conjunts are in the unsatisfiable core [2023-12-24 13:30:34,746 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:30:34,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-24 13:30:34,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-24 13:30:35,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2023-12-24 13:30:37,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2023-12-24 13:30:37,948 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:30:37,948 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 93 treesize of output 71 [2023-12-24 13:30:39,412 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:30:39,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 111 treesize of output 61 [2023-12-24 13:30:39,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:30:39,668 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 129 treesize of output 75 [2023-12-24 13:30:40,044 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-12-24 13:30:40,044 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:30:40,044 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:30:40,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1994919419] [2023-12-24 13:30:40,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1994919419] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:30:40,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:30:40,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2023-12-24 13:30:40,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999397805] [2023-12-24 13:30:40,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:30:40,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-12-24 13:30:40,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:30:40,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-12-24 13:30:40,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=774, Unknown=0, NotChecked=0, Total=930 [2023-12-24 13:30:40,045 INFO L87 Difference]: Start difference. First operand 528 states and 609 transitions. Second operand has 31 states, 26 states have (on average 2.8846153846153846) internal successors, (75), 26 states have internal predecessors, (75), 6 states have call successors, (20), 5 states have call predecessors, (20), 6 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) [2023-12-24 13:30:52,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:30:52,601 INFO L93 Difference]: Finished difference Result 952 states and 1097 transitions. [2023-12-24 13:30:52,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-12-24 13:30:52,602 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 26 states have (on average 2.8846153846153846) internal successors, (75), 26 states have internal predecessors, (75), 6 states have call successors, (20), 5 states have call predecessors, (20), 6 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) Word has length 157 [2023-12-24 13:30:52,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:30:52,602 INFO L225 Difference]: With dead ends: 952 [2023-12-24 13:30:52,602 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 13:30:52,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 734 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=515, Invalid=2791, Unknown=0, NotChecked=0, Total=3306 [2023-12-24 13:30:52,604 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 299 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 2108 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 2188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 2108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2023-12-24 13:30:52,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 1069 Invalid, 2188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 2108 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time] [2023-12-24 13:30:52,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 13:30:52,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 13:30:52,604 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:30:52,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 13:30:52,605 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 157 [2023-12-24 13:30:52,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:30:52,605 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 13:30:52,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 26 states have (on average 2.8846153846153846) internal successors, (75), 26 states have internal predecessors, (75), 6 states have call successors, (20), 5 states have call predecessors, (20), 6 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) [2023-12-24 13:30:52,605 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 13:30:52,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 13:30:52,607 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 13:30:52,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2023-12-24 13:30:52,807 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:30:52,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 13:31:20,572 WARN L293 SmtUtils]: Spent 21.66s on a formula simplification. DAG size of input: 260 DAG size of output: 370 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 13:32:58,483 WARN L293 SmtUtils]: Spent 27.15s on a formula simplification. DAG size of input: 260 DAG size of output: 106 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 13:33:28,360 WARN L293 SmtUtils]: Spent 29.87s on a formula simplification. DAG size of input: 260 DAG size of output: 106 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 13:34:00,385 WARN L293 SmtUtils]: Spent 30.81s on a formula simplification. DAG size of input: 260 DAG size of output: 106 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 13:34:41,169 WARN L293 SmtUtils]: Spent 36.50s on a formula simplification. DAG size of input: 260 DAG size of output: 106 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 13:35:59,869 WARN L293 SmtUtils]: Spent 1.31m on a formula simplification. DAG size of input: 370 DAG size of output: 106 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 13:36:38,313 WARN L293 SmtUtils]: Spent 38.44s on a formula simplification. DAG size of input: 260 DAG size of output: 106 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 13:39:32,443 WARN L293 SmtUtils]: Spent 2.87m on a formula simplification. DAG size of input: 718 DAG size of output: 1 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 13:40:13,313 WARN L293 SmtUtils]: Spent 37.04s on a formula simplification. DAG size of input: 260 DAG size of output: 106 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 13:40:52,423 WARN L293 SmtUtils]: Spent 39.11s on a formula simplification. DAG size of input: 260 DAG size of output: 106 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 13:41:30,969 WARN L293 SmtUtils]: Spent 38.54s on a formula simplification. DAG size of input: 260 DAG size of output: 106 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 13:41:30,972 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-24 13:41:30,973 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-24 13:41:30,973 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-24 13:41:30,973 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-24 13:41:30,973 INFO L899 garLoopResultBuilder]: For program point L60(line 60) no Hoare annotation was computed. [2023-12-24 13:41:30,973 INFO L899 garLoopResultBuilder]: For program point L60-2(line 60) no Hoare annotation was computed. [2023-12-24 13:41:30,973 INFO L895 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: (let ((.cse12 (select |#memory_int#5| |~#unsigned_short_int_Array_0~0.base|))) (let ((.cse11 (select .cse12 (bvadd (_ bv4 32) |~#unsigned_short_int_Array_0~0.offset|))) (.cse3 (select .cse12 (bvadd |~#unsigned_short_int_Array_0~0.offset| (_ bv2 32)))) (.cse1 (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|))) (let ((.cse2 (select .cse1 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse0 ((_ zero_extend 16) ((_ extract 15 0) .cse3))) (.cse10 ((_ zero_extend 16) ((_ extract 15 0) .cse11)))) (and (bvsle .cse0 (_ bv32767 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet47#1_45| (_ BitVec 8))) (= (select .cse1 |~#unsigned_char_Array_0~0.offset|) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet47#1_45|))) (not (= ((_ zero_extend 24) ((_ extract 7 0) .cse2)) (_ bv0 32))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet58#1_38| (_ BitVec 16))) (= .cse3 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet58#1_38|))) (let ((.cse4 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet50#1_31| (_ BitVec 8))) (= (select .cse1 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet50#1_31|)))) (.cse5 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet54#1_30| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet54#1_30|) .cse2))) (.cse6 (select .cse1 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|)))) (or (and .cse4 .cse5 (= ((_ sign_extend 24) (_ bv10 8)) .cse6)) (let ((.cse7 ((_ extract 7 0) .cse6)) (.cse8 (select |#memory_int#3| |~#signed_short_int_Array_0~0.base|))) (and (= ((_ sign_extend 16) ((_ zero_extend 8) .cse7)) (select .cse8 (bvadd |~#signed_short_int_Array_0~0.offset| (_ bv8 32)))) .cse4 (= ((_ sign_extend 16) ((_ extract 15 0) (let ((.cse9 ((_ zero_extend 24) .cse7))) (bvadd .cse9 (bvneg .cse9))))) (select .cse8 (bvadd |~#signed_short_int_Array_0~0.offset| (_ bv10 32)))) .cse5 (= (bvadd (_ bv4 32) (select (select |#memory_int#2| |~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|)) (_ bv0 32)))))) (bvsge .cse10 (_ bv16383 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet61#1_38| (_ BitVec 16))) (= .cse11 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet61#1_38|))) (bvsge .cse0 (_ bv16383 32)) (bvsle .cse10 (_ bv32767 32)))))) [2023-12-24 13:41:30,973 INFO L899 garLoopResultBuilder]: For program point L85-1(line 85) no Hoare annotation was computed. [2023-12-24 13:41:30,973 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-24 13:41:30,973 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-24 13:41:30,973 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-24 13:41:30,974 INFO L895 garLoopResultBuilder]: At program point L77(line 77) the Hoare annotation is: (let ((.cse13 (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|)) (.cse17 (select |#memory_int#5| |~#unsigned_short_int_Array_0~0.base|))) (let ((.cse16 (select .cse17 (bvadd (_ bv4 32) |~#unsigned_short_int_Array_0~0.offset|))) (.cse14 (select .cse17 (bvadd |~#unsigned_short_int_Array_0~0.offset| (_ bv2 32)))) (.cse12 (select .cse13 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|)))) (let ((.cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse12))) (.cse1 (select .cse13 |~#unsigned_char_Array_0~0.offset|)) (.cse0 ((_ zero_extend 16) ((_ extract 15 0) .cse14))) (.cse15 ((_ zero_extend 16) ((_ extract 15 0) .cse16)))) (and (bvsle .cse0 (_ bv32767 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet47#1_45| (_ BitVec 8))) (= .cse1 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet47#1_45|))) (not (= .cse2 (_ bv0 32))) (let ((.cse11 (select .cse13 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|)))) (let ((.cse10 (select .cse13 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse6 ((_ extract 7 0) .cse11))) (let ((.cse7 ((_ extract 7 0) .cse1)) (.cse3 ((_ zero_extend 24) .cse6)) (.cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet50#1_31| (_ BitVec 8))) (= .cse10 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet50#1_31|)))) (.cse9 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet54#1_30| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet54#1_30|) .cse12))) (.cse5 (= ((_ sign_extend 24) (_ bv10 8)) .cse11))) (or (let ((.cse4 (select |#memory_int#3| |~#signed_short_int_Array_0~0.base|))) (and (or (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse3 (bvneg .cse3)))) (select .cse4 (bvadd |~#signed_short_int_Array_0~0.offset| (_ bv10 32)))) .cse5) (= ((_ sign_extend 16) ((_ zero_extend 8) .cse6)) (select .cse4 (bvadd |~#signed_short_int_Array_0~0.offset| (_ bv8 32)))) (= (select .cse4 |~#signed_short_int_Array_0~0.offset|) ((_ sign_extend 16) ((_ zero_extend 8) .cse7))) .cse8 .cse9 (= (bvadd (_ bv4 32) (select (select |#memory_int#2| |~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|)) (_ bv0 32)))) (and (not (bvsle ((_ zero_extend 24) .cse7) (bvmul (bvsrem (_ bv2 32) .cse2) (bvsdiv .cse3 ((_ zero_extend 24) ((_ extract 7 0) .cse10)))))) .cse8 .cse9 .cse5))))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet58#1_38| (_ BitVec 16))) (= .cse14 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet58#1_38|))) (bvsge .cse15 (_ bv16383 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet61#1_38| (_ BitVec 16))) (= .cse16 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet61#1_38|))) (bvsge .cse0 (_ bv16383 32)) (bvsle .cse15 (_ bv32767 32)))))) [2023-12-24 13:41:30,974 INFO L899 garLoopResultBuilder]: For program point L77-1(line 77) no Hoare annotation was computed. [2023-12-24 13:41:30,974 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 54) no Hoare annotation was computed. [2023-12-24 13:41:30,974 INFO L899 garLoopResultBuilder]: For program point L44-1(lines 44 54) no Hoare annotation was computed. [2023-12-24 13:41:30,974 INFO L899 garLoopResultBuilder]: For program point L102(line 102) no Hoare annotation was computed. [2023-12-24 13:41:30,974 INFO L895 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: (let ((.cse13 (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|)) (.cse17 (select |#memory_int#5| |~#unsigned_short_int_Array_0~0.base|))) (let ((.cse16 (select .cse17 (bvadd (_ bv4 32) |~#unsigned_short_int_Array_0~0.offset|))) (.cse14 (select .cse17 (bvadd |~#unsigned_short_int_Array_0~0.offset| (_ bv2 32)))) (.cse12 (select .cse13 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|)))) (let ((.cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse12))) (.cse1 (select .cse13 |~#unsigned_char_Array_0~0.offset|)) (.cse0 ((_ zero_extend 16) ((_ extract 15 0) .cse14))) (.cse15 ((_ zero_extend 16) ((_ extract 15 0) .cse16)))) (and (bvsle .cse0 (_ bv32767 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet47#1_45| (_ BitVec 8))) (= .cse1 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet47#1_45|))) (not (= .cse2 (_ bv0 32))) (let ((.cse11 (select .cse13 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|)))) (let ((.cse10 (select .cse13 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse6 ((_ extract 7 0) .cse11))) (let ((.cse7 ((_ extract 7 0) .cse1)) (.cse3 ((_ zero_extend 24) .cse6)) (.cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet50#1_31| (_ BitVec 8))) (= .cse10 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet50#1_31|)))) (.cse9 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet54#1_30| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet54#1_30|) .cse12))) (.cse5 (= ((_ sign_extend 24) (_ bv10 8)) .cse11))) (or (let ((.cse4 (select |#memory_int#3| |~#signed_short_int_Array_0~0.base|))) (and (or (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse3 (bvneg .cse3)))) (select .cse4 (bvadd |~#signed_short_int_Array_0~0.offset| (_ bv10 32)))) .cse5) (= ((_ sign_extend 16) ((_ zero_extend 8) .cse6)) (select .cse4 (bvadd |~#signed_short_int_Array_0~0.offset| (_ bv8 32)))) (= (select .cse4 |~#signed_short_int_Array_0~0.offset|) ((_ sign_extend 16) ((_ zero_extend 8) .cse7))) .cse8 .cse9 (= (bvadd (_ bv4 32) (select (select |#memory_int#2| |~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|)) (_ bv0 32)))) (and (not (bvsle ((_ zero_extend 24) .cse7) (bvmul (bvsrem (_ bv2 32) .cse2) (bvsdiv .cse3 ((_ zero_extend 24) ((_ extract 7 0) .cse10)))))) .cse8 .cse9 .cse5))))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet58#1_38| (_ BitVec 16))) (= .cse14 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet58#1_38|))) (bvsge .cse15 (_ bv16383 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet61#1_38| (_ BitVec 16))) (= .cse16 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet61#1_38|))) (bvsge .cse0 (_ bv16383 32)) (bvsle .cse15 (_ bv32767 32)))))) [2023-12-24 13:41:30,974 INFO L899 garLoopResultBuilder]: For program point L102-1(line 102) no Hoare annotation was computed. [2023-12-24 13:41:30,974 INFO L899 garLoopResultBuilder]: For program point L69-1(line 69) no Hoare annotation was computed. [2023-12-24 13:41:30,974 INFO L899 garLoopResultBuilder]: For program point L102-3(line 102) no Hoare annotation was computed. [2023-12-24 13:41:30,974 INFO L899 garLoopResultBuilder]: For program point L102-5(line 102) no Hoare annotation was computed. [2023-12-24 13:41:30,974 INFO L899 garLoopResultBuilder]: For program point L102-6(line 102) no Hoare annotation was computed. [2023-12-24 13:41:30,974 INFO L899 garLoopResultBuilder]: For program point L102-7(line 102) no Hoare annotation was computed. [2023-12-24 13:41:30,975 INFO L895 garLoopResultBuilder]: At program point L94(line 94) the Hoare annotation is: (let ((.cse17 (select |#memory_int#5| |~#unsigned_short_int_Array_0~0.base|))) (let ((.cse16 (select .cse17 (bvadd |~#unsigned_short_int_Array_0~0.offset| (_ bv2 32)))) (.cse13 (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|))) (let ((.cse15 (select .cse17 (bvadd (_ bv4 32) |~#unsigned_short_int_Array_0~0.offset|))) (.cse9 (select .cse13 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse14 ((_ zero_extend 16) ((_ extract 15 0) .cse16)))) (let ((.cse0 (bvsle .cse14 (_ bv32767 32))) (.cse4 (not (= ((_ zero_extend 24) ((_ extract 7 0) .cse9)) (_ bv0 32)))) (.cse5 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet58#1_38| (_ BitVec 16))) (= .cse16 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet58#1_38|)))) (.cse6 (= ((_ extract 15 0) .cse15) |ULTIMATE.start_updateVariables_#t~mem62#1|)) (.cse1 (select .cse13 |~#unsigned_char_Array_0~0.offset|)) (.cse7 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet50#1_31| (_ BitVec 8))) (= (select .cse13 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet50#1_31|)))) (.cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet61#1_38| (_ BitVec 16))) (= .cse15 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet61#1_38|)))) (.cse10 (bvsge .cse14 (_ bv16383 32))) (.cse12 (select .cse13 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|)))) (or (let ((.cse2 ((_ extract 7 0) .cse12)) (.cse3 (select |#memory_int#3| |~#signed_short_int_Array_0~0.base|))) (and .cse0 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet47#1_45| (_ BitVec 8))) (= .cse1 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet47#1_45|))) (= ((_ sign_extend 16) ((_ zero_extend 8) .cse2)) (select .cse3 (bvadd |~#signed_short_int_Array_0~0.offset| (_ bv8 32)))) .cse4 .cse5 .cse6 .cse7 .cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet54#1_45| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet54#1_45|) .cse9)) .cse10 (= ((_ sign_extend 16) ((_ extract 15 0) (let ((.cse11 ((_ zero_extend 24) .cse2))) (bvadd .cse11 (bvneg .cse11))))) (select .cse3 (bvadd |~#signed_short_int_Array_0~0.offset| (_ bv10 32)))) (= (bvadd (_ bv4 32) (select (select |#memory_int#2| |~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|)) (_ bv0 32)))) (and .cse0 .cse4 .cse5 .cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet47#1_38| (_ BitVec 8))) (= .cse1 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet47#1_38|))) .cse7 .cse8 .cse10 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet54#1_30| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet54#1_30|) .cse9)) (= ((_ sign_extend 24) (_ bv10 8)) .cse12))))))) [2023-12-24 13:41:30,975 INFO L899 garLoopResultBuilder]: For program point L102-8(line 102) no Hoare annotation was computed. [2023-12-24 13:41:30,975 INFO L899 garLoopResultBuilder]: For program point L94-1(line 94) no Hoare annotation was computed. [2023-12-24 13:41:30,975 INFO L899 garLoopResultBuilder]: For program point L102-9(line 102) no Hoare annotation was computed. [2023-12-24 13:41:30,975 INFO L899 garLoopResultBuilder]: For program point L102-11(line 102) no Hoare annotation was computed. [2023-12-24 13:41:30,975 INFO L899 garLoopResultBuilder]: For program point L102-13(line 102) no Hoare annotation was computed. [2023-12-24 13:41:30,975 INFO L899 garLoopResultBuilder]: For program point L102-15(line 102) no Hoare annotation was computed. [2023-12-24 13:41:30,975 INFO L899 garLoopResultBuilder]: For program point L102-17(line 102) no Hoare annotation was computed. [2023-12-24 13:41:30,975 INFO L899 garLoopResultBuilder]: For program point L102-18(line 102) no Hoare annotation was computed. [2023-12-24 13:41:30,975 INFO L899 garLoopResultBuilder]: For program point L102-19(line 102) no Hoare annotation was computed. [2023-12-24 13:41:30,975 INFO L899 garLoopResultBuilder]: For program point L102-20(line 102) no Hoare annotation was computed. [2023-12-24 13:41:30,975 INFO L899 garLoopResultBuilder]: For program point L102-22(line 102) no Hoare annotation was computed. [2023-12-24 13:41:30,975 INFO L895 garLoopResultBuilder]: At program point L78(line 78) the Hoare annotation is: (let ((.cse13 (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|)) (.cse17 (select |#memory_int#5| |~#unsigned_short_int_Array_0~0.base|))) (let ((.cse16 (select .cse17 (bvadd (_ bv4 32) |~#unsigned_short_int_Array_0~0.offset|))) (.cse14 (select .cse17 (bvadd |~#unsigned_short_int_Array_0~0.offset| (_ bv2 32)))) (.cse12 (select .cse13 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|)))) (let ((.cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse12))) (.cse1 (select .cse13 |~#unsigned_char_Array_0~0.offset|)) (.cse0 ((_ zero_extend 16) ((_ extract 15 0) .cse14))) (.cse15 ((_ zero_extend 16) ((_ extract 15 0) .cse16)))) (and (bvsle .cse0 (_ bv32767 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet47#1_45| (_ BitVec 8))) (= .cse1 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet47#1_45|))) (not (= .cse2 (_ bv0 32))) (let ((.cse11 (select .cse13 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|)))) (let ((.cse10 (select .cse13 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse6 ((_ extract 7 0) .cse11))) (let ((.cse7 ((_ extract 7 0) .cse1)) (.cse3 ((_ zero_extend 24) .cse6)) (.cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet50#1_31| (_ BitVec 8))) (= .cse10 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet50#1_31|)))) (.cse9 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet54#1_30| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet54#1_30|) .cse12))) (.cse5 (= ((_ sign_extend 24) (_ bv10 8)) .cse11))) (or (let ((.cse4 (select |#memory_int#3| |~#signed_short_int_Array_0~0.base|))) (and (or (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse3 (bvneg .cse3)))) (select .cse4 (bvadd |~#signed_short_int_Array_0~0.offset| (_ bv10 32)))) .cse5) (= ((_ sign_extend 16) ((_ zero_extend 8) .cse6)) (select .cse4 (bvadd |~#signed_short_int_Array_0~0.offset| (_ bv8 32)))) (= (select .cse4 |~#signed_short_int_Array_0~0.offset|) ((_ sign_extend 16) ((_ zero_extend 8) .cse7))) .cse8 .cse9 (= (bvadd (_ bv4 32) (select (select |#memory_int#2| |~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|)) (_ bv0 32)))) (and (not (bvsle ((_ zero_extend 24) .cse7) (bvmul (bvsrem (_ bv2 32) .cse2) (bvsdiv .cse3 ((_ zero_extend 24) ((_ extract 7 0) .cse10)))))) .cse8 .cse9 .cse5))))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet58#1_38| (_ BitVec 16))) (= .cse14 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet58#1_38|))) (bvsge .cse15 (_ bv16383 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet61#1_38| (_ BitVec 16))) (= .cse16 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet61#1_38|))) (bvsge .cse0 (_ bv16383 32)) (bvsle .cse15 (_ bv32767 32)))))) [2023-12-24 13:41:30,975 INFO L899 garLoopResultBuilder]: For program point L102-24(line 102) no Hoare annotation was computed. [2023-12-24 13:41:30,980 INFO L899 garLoopResultBuilder]: For program point L78-1(line 78) no Hoare annotation was computed. [2023-12-24 13:41:30,980 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 53) no Hoare annotation was computed. [2023-12-24 13:41:30,980 INFO L899 garLoopResultBuilder]: For program point L102-26(line 102) no Hoare annotation was computed. [2023-12-24 13:41:30,980 INFO L899 garLoopResultBuilder]: For program point L102-27(line 102) no Hoare annotation was computed. [2023-12-24 13:41:30,980 INFO L899 garLoopResultBuilder]: For program point L102-29(line 102) no Hoare annotation was computed. [2023-12-24 13:41:30,980 INFO L899 garLoopResultBuilder]: For program point L102-30(line 102) no Hoare annotation was computed. [2023-12-24 13:41:30,980 INFO L899 garLoopResultBuilder]: For program point L102-32(line 102) no Hoare annotation was computed. [2023-12-24 13:41:30,980 INFO L899 garLoopResultBuilder]: For program point L102-33(line 102) no Hoare annotation was computed. [2023-12-24 13:41:30,980 INFO L899 garLoopResultBuilder]: For program point L102-35(line 102) no Hoare annotation was computed. [2023-12-24 13:41:30,980 INFO L895 garLoopResultBuilder]: At program point L95(line 95) the Hoare annotation is: (let ((.cse11 (select |#memory_int#5| |~#unsigned_short_int_Array_0~0.base|))) (let ((.cse3 (select .cse11 (bvadd |~#unsigned_short_int_Array_0~0.offset| (_ bv2 32)))) (.cse1 (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|)) (.cse10 (select .cse11 (bvadd (_ bv4 32) |~#unsigned_short_int_Array_0~0.offset|)))) (let ((.cse9 ((_ extract 15 0) .cse10)) (.cse2 (select .cse1 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse0 ((_ zero_extend 16) ((_ extract 15 0) .cse3)))) (and (bvsle .cse0 (_ bv32767 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet47#1_45| (_ BitVec 8))) (= (select .cse1 |~#unsigned_char_Array_0~0.offset|) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet47#1_45|))) (not (= ((_ zero_extend 24) ((_ extract 7 0) .cse2)) (_ bv0 32))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet58#1_38| (_ BitVec 16))) (= .cse3 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet58#1_38|))) (let ((.cse4 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet50#1_31| (_ BitVec 8))) (= (select .cse1 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet50#1_31|)))) (.cse5 (select .cse1 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|)))) (or (and .cse4 (= ((_ sign_extend 24) (_ bv10 8)) .cse5)) (let ((.cse6 ((_ extract 7 0) .cse5)) (.cse7 (select |#memory_int#3| |~#signed_short_int_Array_0~0.base|))) (and (= ((_ sign_extend 16) ((_ zero_extend 8) .cse6)) (select .cse7 (bvadd |~#signed_short_int_Array_0~0.offset| (_ bv8 32)))) .cse4 (= ((_ sign_extend 16) ((_ extract 15 0) (let ((.cse8 ((_ zero_extend 24) .cse6))) (bvadd .cse8 (bvneg .cse8))))) (select .cse7 (bvadd |~#signed_short_int_Array_0~0.offset| (_ bv10 32)))) (= (bvadd (_ bv4 32) (select (select |#memory_int#2| |~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|)) (_ bv0 32)))))) (bvsge ((_ zero_extend 16) .cse9) (_ bv16383 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet61#1_38| (_ BitVec 16))) (= .cse10 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet61#1_38|))) (= .cse9 |ULTIMATE.start_updateVariables_#t~mem63#1|) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet54#1_45| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet54#1_45|) .cse2)) (bvsge .cse0 (_ bv16383 32)))))) [2023-12-24 13:41:30,980 INFO L899 garLoopResultBuilder]: For program point L95-1(line 95) no Hoare annotation was computed. [2023-12-24 13:41:30,981 INFO L895 garLoopResultBuilder]: At program point L87(line 87) the Hoare annotation is: (let ((.cse10 (select |#memory_int#5| |~#unsigned_short_int_Array_0~0.base|))) (let ((.cse9 (select .cse10 (bvadd (_ bv4 32) |~#unsigned_short_int_Array_0~0.offset|))) (.cse2 (select .cse10 (bvadd |~#unsigned_short_int_Array_0~0.offset| (_ bv2 32))))) (let ((.cse1 (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|)) (.cse0 ((_ zero_extend 16) ((_ extract 15 0) .cse2))) (.cse8 ((_ zero_extend 16) ((_ extract 15 0) .cse9)))) (and (bvsle .cse0 (_ bv32767 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet47#1_45| (_ BitVec 8))) (= (select .cse1 |~#unsigned_char_Array_0~0.offset|) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet47#1_45|))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet58#1_38| (_ BitVec 16))) (= .cse2 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet58#1_38|))) (let ((.cse3 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet50#1_31| (_ BitVec 8))) (= (select .cse1 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet50#1_31|)))) (.cse4 (select .cse1 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|)))) (or (and .cse3 (= ((_ sign_extend 24) (_ bv10 8)) .cse4)) (let ((.cse5 ((_ extract 7 0) .cse4)) (.cse6 (select |#memory_int#3| |~#signed_short_int_Array_0~0.base|))) (and (= ((_ sign_extend 16) ((_ zero_extend 8) .cse5)) (select .cse6 (bvadd |~#signed_short_int_Array_0~0.offset| (_ bv8 32)))) .cse3 (= ((_ sign_extend 16) ((_ extract 15 0) (let ((.cse7 ((_ zero_extend 24) .cse5))) (bvadd .cse7 (bvneg .cse7))))) (select .cse6 (bvadd |~#signed_short_int_Array_0~0.offset| (_ bv10 32)))) (= (bvadd (_ bv4 32) (select (select |#memory_int#2| |~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|)) (_ bv0 32)))))) (bvsge .cse8 (_ bv16383 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet61#1_38| (_ BitVec 16))) (= .cse9 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet61#1_38|))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet54#1_45| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet54#1_45|) (select .cse1 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|)))) (bvsge .cse0 (_ bv16383 32)) (bvsle .cse8 (_ bv32767 32)))))) [2023-12-24 13:41:30,981 INFO L899 garLoopResultBuilder]: For program point L87-1(line 87) no Hoare annotation was computed. [2023-12-24 13:41:30,981 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 50) no Hoare annotation was computed. [2023-12-24 13:41:30,981 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 13:41:30,981 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (let ((.cse13 (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|)) (.cse17 (select |#memory_int#5| |~#unsigned_short_int_Array_0~0.base|))) (let ((.cse16 (select .cse17 (bvadd (_ bv4 32) |~#unsigned_short_int_Array_0~0.offset|))) (.cse14 (select .cse17 (bvadd |~#unsigned_short_int_Array_0~0.offset| (_ bv2 32)))) (.cse12 (select .cse13 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|)))) (let ((.cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse12))) (.cse1 (select .cse13 |~#unsigned_char_Array_0~0.offset|)) (.cse0 ((_ zero_extend 16) ((_ extract 15 0) .cse14))) (.cse15 ((_ zero_extend 16) ((_ extract 15 0) .cse16)))) (and (bvsle .cse0 (_ bv32767 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet47#1_45| (_ BitVec 8))) (= .cse1 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet47#1_45|))) (not (= .cse2 (_ bv0 32))) (let ((.cse11 (select .cse13 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|)))) (let ((.cse10 (select .cse13 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse6 ((_ extract 7 0) .cse11))) (let ((.cse7 ((_ extract 7 0) .cse1)) (.cse3 ((_ zero_extend 24) .cse6)) (.cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet50#1_31| (_ BitVec 8))) (= .cse10 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet50#1_31|)))) (.cse9 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet54#1_30| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet54#1_30|) .cse12))) (.cse5 (= ((_ sign_extend 24) (_ bv10 8)) .cse11))) (or (let ((.cse4 (select |#memory_int#3| |~#signed_short_int_Array_0~0.base|))) (and (or (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse3 (bvneg .cse3)))) (select .cse4 (bvadd |~#signed_short_int_Array_0~0.offset| (_ bv10 32)))) .cse5) (= ((_ sign_extend 16) ((_ zero_extend 8) .cse6)) (select .cse4 (bvadd |~#signed_short_int_Array_0~0.offset| (_ bv8 32)))) (= (select .cse4 |~#signed_short_int_Array_0~0.offset|) ((_ sign_extend 16) ((_ zero_extend 8) .cse7))) .cse8 .cse9 (= (bvadd (_ bv4 32) (select (select |#memory_int#2| |~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|)) (_ bv0 32)))) (and (not (bvsle ((_ zero_extend 24) .cse7) (bvmul (bvsrem (_ bv2 32) .cse2) (bvsdiv .cse3 ((_ zero_extend 24) ((_ extract 7 0) .cse10)))))) .cse8 .cse9 .cse5))))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet58#1_38| (_ BitVec 16))) (= .cse14 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet58#1_38|))) (bvsge .cse15 (_ bv16383 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet61#1_38| (_ BitVec 16))) (= .cse16 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet61#1_38|))) (bvsge .cse0 (_ bv16383 32)) (bvsle .cse15 (_ bv32767 32)))))) [2023-12-24 13:41:30,981 INFO L899 garLoopResultBuilder]: For program point L71-1(line 71) no Hoare annotation was computed. [2023-12-24 13:41:30,981 INFO L895 garLoopResultBuilder]: At program point L88(line 88) the Hoare annotation is: (let ((.cse10 (select |#memory_int#5| |~#unsigned_short_int_Array_0~0.base|))) (let ((.cse9 (select .cse10 (bvadd (_ bv4 32) |~#unsigned_short_int_Array_0~0.offset|))) (.cse2 (select .cse10 (bvadd |~#unsigned_short_int_Array_0~0.offset| (_ bv2 32))))) (let ((.cse1 (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|)) (.cse0 ((_ zero_extend 16) ((_ extract 15 0) .cse2))) (.cse8 ((_ zero_extend 16) ((_ extract 15 0) .cse9)))) (and (bvsle .cse0 (_ bv32767 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet47#1_45| (_ BitVec 8))) (= (select .cse1 |~#unsigned_char_Array_0~0.offset|) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet47#1_45|))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet58#1_38| (_ BitVec 16))) (= .cse2 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet58#1_38|))) (let ((.cse3 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet50#1_31| (_ BitVec 8))) (= (select .cse1 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet50#1_31|)))) (.cse4 (select .cse1 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|)))) (or (and .cse3 (= ((_ sign_extend 24) (_ bv10 8)) .cse4)) (let ((.cse5 ((_ extract 7 0) .cse4)) (.cse6 (select |#memory_int#3| |~#signed_short_int_Array_0~0.base|))) (and (= ((_ sign_extend 16) ((_ zero_extend 8) .cse5)) (select .cse6 (bvadd |~#signed_short_int_Array_0~0.offset| (_ bv8 32)))) .cse3 (= ((_ sign_extend 16) ((_ extract 15 0) (let ((.cse7 ((_ zero_extend 24) .cse5))) (bvadd .cse7 (bvneg .cse7))))) (select .cse6 (bvadd |~#signed_short_int_Array_0~0.offset| (_ bv10 32)))) (= (bvadd (_ bv4 32) (select (select |#memory_int#2| |~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|)) (_ bv0 32)))))) (bvsge .cse8 (_ bv16383 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet61#1_38| (_ BitVec 16))) (= .cse9 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet61#1_38|))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet54#1_45| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet54#1_45|) (select .cse1 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|)))) (bvsge .cse0 (_ bv16383 32)) (bvsle .cse8 (_ bv32767 32)))))) [2023-12-24 13:41:30,981 INFO L899 garLoopResultBuilder]: For program point L88-1(line 88) no Hoare annotation was computed. [2023-12-24 13:41:30,981 INFO L899 garLoopResultBuilder]: For program point L55(lines 55 57) no Hoare annotation was computed. [2023-12-24 13:41:30,981 INFO L899 garLoopResultBuilder]: For program point L55-2(lines 55 57) no Hoare annotation was computed. [2023-12-24 13:41:30,981 INFO L895 garLoopResultBuilder]: At program point L80(line 80) the Hoare annotation is: (let ((.cse12 (select |#memory_int#5| |~#unsigned_short_int_Array_0~0.base|))) (let ((.cse11 (select .cse12 (bvadd (_ bv4 32) |~#unsigned_short_int_Array_0~0.offset|))) (.cse3 (select .cse12 (bvadd |~#unsigned_short_int_Array_0~0.offset| (_ bv2 32)))) (.cse1 (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|))) (let ((.cse2 (select .cse1 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse0 ((_ zero_extend 16) ((_ extract 15 0) .cse3))) (.cse10 ((_ zero_extend 16) ((_ extract 15 0) .cse11)))) (and (bvsle .cse0 (_ bv32767 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet47#1_45| (_ BitVec 8))) (= (select .cse1 |~#unsigned_char_Array_0~0.offset|) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet47#1_45|))) (not (= ((_ zero_extend 24) ((_ extract 7 0) .cse2)) (_ bv0 32))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet58#1_38| (_ BitVec 16))) (= .cse3 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet58#1_38|))) (let ((.cse4 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet50#1_31| (_ BitVec 8))) (= (select .cse1 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet50#1_31|)))) (.cse5 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet54#1_30| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet54#1_30|) .cse2))) (.cse6 (select .cse1 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|)))) (or (and .cse4 .cse5 (= ((_ sign_extend 24) (_ bv10 8)) .cse6)) (let ((.cse7 ((_ extract 7 0) .cse6)) (.cse8 (select |#memory_int#3| |~#signed_short_int_Array_0~0.base|))) (and (= ((_ sign_extend 16) ((_ zero_extend 8) .cse7)) (select .cse8 (bvadd |~#signed_short_int_Array_0~0.offset| (_ bv8 32)))) .cse4 (= ((_ sign_extend 16) ((_ extract 15 0) (let ((.cse9 ((_ zero_extend 24) .cse7))) (bvadd .cse9 (bvneg .cse9))))) (select .cse8 (bvadd |~#signed_short_int_Array_0~0.offset| (_ bv10 32)))) .cse5 (= (bvadd (_ bv4 32) (select (select |#memory_int#2| |~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|)) (_ bv0 32)))))) (bvsge .cse10 (_ bv16383 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet61#1_38| (_ BitVec 16))) (= .cse11 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet61#1_38|))) (bvsge .cse0 (_ bv16383 32)) (bvsle .cse10 (_ bv32767 32)))))) [2023-12-24 13:41:30,981 INFO L899 garLoopResultBuilder]: For program point L80-1(line 80) no Hoare annotation was computed. [2023-12-24 13:41:30,982 INFO L895 garLoopResultBuilder]: At program point L72(line 72) the Hoare annotation is: (let ((.cse13 (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|)) (.cse17 (select |#memory_int#5| |~#unsigned_short_int_Array_0~0.base|))) (let ((.cse16 (select .cse17 (bvadd (_ bv4 32) |~#unsigned_short_int_Array_0~0.offset|))) (.cse14 (select .cse17 (bvadd |~#unsigned_short_int_Array_0~0.offset| (_ bv2 32)))) (.cse12 (select .cse13 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|)))) (let ((.cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse12))) (.cse1 (select .cse13 |~#unsigned_char_Array_0~0.offset|)) (.cse0 ((_ zero_extend 16) ((_ extract 15 0) .cse14))) (.cse15 ((_ zero_extend 16) ((_ extract 15 0) .cse16)))) (and (bvsle .cse0 (_ bv32767 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet47#1_45| (_ BitVec 8))) (= .cse1 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet47#1_45|))) (not (= .cse2 (_ bv0 32))) (let ((.cse11 (select .cse13 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|)))) (let ((.cse10 (select .cse13 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse6 ((_ extract 7 0) .cse11))) (let ((.cse7 ((_ extract 7 0) .cse1)) (.cse3 ((_ zero_extend 24) .cse6)) (.cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet50#1_31| (_ BitVec 8))) (= .cse10 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet50#1_31|)))) (.cse9 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet54#1_30| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet54#1_30|) .cse12))) (.cse5 (= ((_ sign_extend 24) (_ bv10 8)) .cse11))) (or (let ((.cse4 (select |#memory_int#3| |~#signed_short_int_Array_0~0.base|))) (and (or (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse3 (bvneg .cse3)))) (select .cse4 (bvadd |~#signed_short_int_Array_0~0.offset| (_ bv10 32)))) .cse5) (= ((_ sign_extend 16) ((_ zero_extend 8) .cse6)) (select .cse4 (bvadd |~#signed_short_int_Array_0~0.offset| (_ bv8 32)))) (= (select .cse4 |~#signed_short_int_Array_0~0.offset|) ((_ sign_extend 16) ((_ zero_extend 8) .cse7))) .cse8 .cse9 (= (bvadd (_ bv4 32) (select (select |#memory_int#2| |~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|)) (_ bv0 32)))) (and (not (bvsle ((_ zero_extend 24) .cse7) (bvmul (bvsrem (_ bv2 32) .cse2) (bvsdiv .cse3 ((_ zero_extend 24) ((_ extract 7 0) .cse10)))))) .cse8 .cse9 .cse5))))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet58#1_38| (_ BitVec 16))) (= .cse14 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet58#1_38|))) (bvsge .cse15 (_ bv16383 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet61#1_38| (_ BitVec 16))) (= .cse16 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet61#1_38|))) (bvsge .cse0 (_ bv16383 32)) (bvsle .cse15 (_ bv32767 32)))))) [2023-12-24 13:41:30,982 INFO L899 garLoopResultBuilder]: For program point L72-1(line 72) no Hoare annotation was computed. [2023-12-24 13:41:30,982 INFO L895 garLoopResultBuilder]: At program point L89(line 89) the Hoare annotation is: (let ((.cse11 (select |#memory_int#5| |~#unsigned_short_int_Array_0~0.base|))) (let ((.cse10 (select .cse11 (bvadd (_ bv4 32) |~#unsigned_short_int_Array_0~0.offset|))) (.cse3 (select .cse11 (bvadd |~#unsigned_short_int_Array_0~0.offset| (_ bv2 32)))) (.cse1 (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|))) (let ((.cse2 (select .cse1 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse0 ((_ zero_extend 16) ((_ extract 15 0) .cse3))) (.cse9 ((_ zero_extend 16) ((_ extract 15 0) .cse10)))) (and (bvsle .cse0 (_ bv32767 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet47#1_45| (_ BitVec 8))) (= (select .cse1 |~#unsigned_char_Array_0~0.offset|) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet47#1_45|))) (= ((_ extract 7 0) .cse2) |ULTIMATE.start_updateVariables_#t~mem57#1|) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet58#1_38| (_ BitVec 16))) (= .cse3 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet58#1_38|))) (let ((.cse4 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet50#1_31| (_ BitVec 8))) (= (select .cse1 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet50#1_31|)))) (.cse5 (select .cse1 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|)))) (or (and .cse4 (= ((_ sign_extend 24) (_ bv10 8)) .cse5)) (let ((.cse6 ((_ extract 7 0) .cse5)) (.cse7 (select |#memory_int#3| |~#signed_short_int_Array_0~0.base|))) (and (= ((_ sign_extend 16) ((_ zero_extend 8) .cse6)) (select .cse7 (bvadd |~#signed_short_int_Array_0~0.offset| (_ bv8 32)))) .cse4 (= ((_ sign_extend 16) ((_ extract 15 0) (let ((.cse8 ((_ zero_extend 24) .cse6))) (bvadd .cse8 (bvneg .cse8))))) (select .cse7 (bvadd |~#signed_short_int_Array_0~0.offset| (_ bv10 32)))) (= (bvadd (_ bv4 32) (select (select |#memory_int#2| |~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|)) (_ bv0 32)))))) (bvsge .cse9 (_ bv16383 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet61#1_38| (_ BitVec 16))) (= .cse10 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet61#1_38|))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet54#1_45| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet54#1_45|) .cse2)) (bvsge .cse0 (_ bv16383 32)) (bvsle .cse9 (_ bv32767 32)))))) [2023-12-24 13:41:30,982 INFO L899 garLoopResultBuilder]: For program point L89-1(line 89) no Hoare annotation was computed. [2023-12-24 13:41:30,982 INFO L899 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2023-12-24 13:41:30,982 INFO L899 garLoopResultBuilder]: For program point L56-2(line 56) no Hoare annotation was computed. [2023-12-24 13:41:30,982 INFO L895 garLoopResultBuilder]: At program point L81(line 81) the Hoare annotation is: (let ((.cse12 (select |#memory_int#5| |~#unsigned_short_int_Array_0~0.base|))) (let ((.cse11 (select .cse12 (bvadd (_ bv4 32) |~#unsigned_short_int_Array_0~0.offset|))) (.cse3 (select .cse12 (bvadd |~#unsigned_short_int_Array_0~0.offset| (_ bv2 32)))) (.cse1 (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|))) (let ((.cse2 (select .cse1 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse0 ((_ zero_extend 16) ((_ extract 15 0) .cse3))) (.cse10 ((_ zero_extend 16) ((_ extract 15 0) .cse11)))) (and (bvsle .cse0 (_ bv32767 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet47#1_45| (_ BitVec 8))) (= (select .cse1 |~#unsigned_char_Array_0~0.offset|) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet47#1_45|))) (not (= ((_ zero_extend 24) ((_ extract 7 0) .cse2)) (_ bv0 32))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet58#1_38| (_ BitVec 16))) (= .cse3 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet58#1_38|))) (let ((.cse4 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet50#1_31| (_ BitVec 8))) (= (select .cse1 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet50#1_31|)))) (.cse5 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet54#1_30| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet54#1_30|) .cse2))) (.cse6 (select .cse1 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|)))) (or (and .cse4 .cse5 (= ((_ sign_extend 24) (_ bv10 8)) .cse6)) (let ((.cse7 ((_ extract 7 0) .cse6)) (.cse8 (select |#memory_int#3| |~#signed_short_int_Array_0~0.base|))) (and (= ((_ sign_extend 16) ((_ zero_extend 8) .cse7)) (select .cse8 (bvadd |~#signed_short_int_Array_0~0.offset| (_ bv8 32)))) .cse4 (= ((_ sign_extend 16) ((_ extract 15 0) (let ((.cse9 ((_ zero_extend 24) .cse7))) (bvadd .cse9 (bvneg .cse9))))) (select .cse8 (bvadd |~#signed_short_int_Array_0~0.offset| (_ bv10 32)))) .cse5 (= (bvadd (_ bv4 32) (select (select |#memory_int#2| |~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|)) (_ bv0 32)))))) (bvsge .cse10 (_ bv16383 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet61#1_38| (_ BitVec 16))) (= .cse11 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet61#1_38|))) (bvsge .cse0 (_ bv16383 32)) (bvsle .cse10 (_ bv32767 32)))))) [2023-12-24 13:41:30,982 INFO L899 garLoopResultBuilder]: For program point L81-1(line 81) no Hoare annotation was computed. [2023-12-24 13:41:30,982 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-24 13:41:30,982 INFO L895 garLoopResultBuilder]: At program point L74(line 74) the Hoare annotation is: (let ((.cse13 (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|)) (.cse17 (select |#memory_int#5| |~#unsigned_short_int_Array_0~0.base|))) (let ((.cse16 (select .cse17 (bvadd (_ bv4 32) |~#unsigned_short_int_Array_0~0.offset|))) (.cse14 (select .cse17 (bvadd |~#unsigned_short_int_Array_0~0.offset| (_ bv2 32)))) (.cse12 (select .cse13 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|)))) (let ((.cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse12))) (.cse1 (select .cse13 |~#unsigned_char_Array_0~0.offset|)) (.cse0 ((_ zero_extend 16) ((_ extract 15 0) .cse14))) (.cse15 ((_ zero_extend 16) ((_ extract 15 0) .cse16)))) (and (bvsle .cse0 (_ bv32767 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet47#1_45| (_ BitVec 8))) (= .cse1 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet47#1_45|))) (not (= .cse2 (_ bv0 32))) (let ((.cse11 (select .cse13 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|)))) (let ((.cse10 (select .cse13 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse6 ((_ extract 7 0) .cse11))) (let ((.cse7 ((_ extract 7 0) .cse1)) (.cse3 ((_ zero_extend 24) .cse6)) (.cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet50#1_31| (_ BitVec 8))) (= .cse10 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet50#1_31|)))) (.cse9 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet54#1_30| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet54#1_30|) .cse12))) (.cse5 (= ((_ sign_extend 24) (_ bv10 8)) .cse11))) (or (let ((.cse4 (select |#memory_int#3| |~#signed_short_int_Array_0~0.base|))) (and (or (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse3 (bvneg .cse3)))) (select .cse4 (bvadd |~#signed_short_int_Array_0~0.offset| (_ bv10 32)))) .cse5) (= ((_ sign_extend 16) ((_ zero_extend 8) .cse6)) (select .cse4 (bvadd |~#signed_short_int_Array_0~0.offset| (_ bv8 32)))) (= (select .cse4 |~#signed_short_int_Array_0~0.offset|) ((_ sign_extend 16) ((_ zero_extend 8) .cse7))) .cse8 .cse9 (= (bvadd (_ bv4 32) (select (select |#memory_int#2| |~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|)) (_ bv0 32)))) (and (not (bvsle ((_ zero_extend 24) .cse7) (bvmul (bvsrem (_ bv2 32) .cse2) (bvsdiv .cse3 ((_ zero_extend 24) ((_ extract 7 0) .cse10)))))) .cse8 .cse9 .cse5))))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet58#1_38| (_ BitVec 16))) (= .cse14 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet58#1_38|))) (bvsge .cse15 (_ bv16383 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet61#1_38| (_ BitVec 16))) (= .cse16 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet61#1_38|))) (bvsge .cse0 (_ bv16383 32)) (bvsle .cse15 (_ bv32767 32)))))) [2023-12-24 13:41:30,983 INFO L899 garLoopResultBuilder]: For program point L74-1(line 74) no Hoare annotation was computed. [2023-12-24 13:41:30,983 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 13:41:30,983 INFO L895 garLoopResultBuilder]: At program point L91(line 91) the Hoare annotation is: (let ((.cse10 (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|))) (let ((.cse11 (select (select |#memory_int#5| |~#unsigned_short_int_Array_0~0.base|) (bvadd |~#unsigned_short_int_Array_0~0.offset| (_ bv2 32)))) (.cse5 (select .cse10 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|)))) (let ((.cse2 (select .cse10 |~#unsigned_char_Array_0~0.offset|)) (.cse0 (not (= ((_ zero_extend 24) ((_ extract 7 0) .cse5)) (_ bv0 32)))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet58#1_38| (_ BitVec 16))) (= .cse11 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet58#1_38|)))) (.cse3 (= ((_ extract 15 0) .cse11) |ULTIMATE.start_updateVariables_#t~mem59#1|)) (.cse4 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet50#1_31| (_ BitVec 8))) (= (select .cse10 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet50#1_31|)))) (.cse6 (select .cse10 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|)))) (or (and .cse0 .cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet47#1_38| (_ BitVec 8))) (= .cse2 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet47#1_38|))) .cse3 .cse4 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet54#1_30| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet54#1_30|) .cse5)) (= ((_ sign_extend 24) (_ bv10 8)) .cse6)) (let ((.cse7 ((_ extract 7 0) .cse6)) (.cse8 (select |#memory_int#3| |~#signed_short_int_Array_0~0.base|))) (and (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet47#1_45| (_ BitVec 8))) (= .cse2 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet47#1_45|))) (= ((_ sign_extend 16) ((_ zero_extend 8) .cse7)) (select .cse8 (bvadd |~#signed_short_int_Array_0~0.offset| (_ bv8 32)))) .cse0 .cse1 .cse3 .cse4 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet54#1_45| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet54#1_45|) .cse5)) (= ((_ sign_extend 16) ((_ extract 15 0) (let ((.cse9 ((_ zero_extend 24) .cse7))) (bvadd .cse9 (bvneg .cse9))))) (select .cse8 (bvadd |~#signed_short_int_Array_0~0.offset| (_ bv10 32)))) (= (bvadd (_ bv4 32) (select (select |#memory_int#2| |~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|)) (_ bv0 32)))))))) [2023-12-24 13:41:30,983 INFO L899 garLoopResultBuilder]: For program point L91-1(line 91) no Hoare annotation was computed. [2023-12-24 13:41:30,983 INFO L895 garLoopResultBuilder]: At program point L83(line 83) the Hoare annotation is: (let ((.cse12 (select |#memory_int#5| |~#unsigned_short_int_Array_0~0.base|))) (let ((.cse11 (select .cse12 (bvadd (_ bv4 32) |~#unsigned_short_int_Array_0~0.offset|))) (.cse3 (select .cse12 (bvadd |~#unsigned_short_int_Array_0~0.offset| (_ bv2 32)))) (.cse1 (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|))) (let ((.cse2 (select .cse1 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse0 ((_ zero_extend 16) ((_ extract 15 0) .cse3))) (.cse10 ((_ zero_extend 16) ((_ extract 15 0) .cse11)))) (and (bvsle .cse0 (_ bv32767 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet47#1_45| (_ BitVec 8))) (= (select .cse1 |~#unsigned_char_Array_0~0.offset|) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet47#1_45|))) (not (= ((_ zero_extend 24) ((_ extract 7 0) .cse2)) (_ bv0 32))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet58#1_38| (_ BitVec 16))) (= .cse3 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet58#1_38|))) (let ((.cse4 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet50#1_31| (_ BitVec 8))) (= (select .cse1 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet50#1_31|)))) (.cse5 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet54#1_30| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet54#1_30|) .cse2))) (.cse6 (select .cse1 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|)))) (or (and .cse4 .cse5 (= ((_ sign_extend 24) (_ bv10 8)) .cse6)) (let ((.cse7 ((_ extract 7 0) .cse6)) (.cse8 (select |#memory_int#3| |~#signed_short_int_Array_0~0.base|))) (and (= ((_ sign_extend 16) ((_ zero_extend 8) .cse7)) (select .cse8 (bvadd |~#signed_short_int_Array_0~0.offset| (_ bv8 32)))) .cse4 (= ((_ sign_extend 16) ((_ extract 15 0) (let ((.cse9 ((_ zero_extend 24) .cse7))) (bvadd .cse9 (bvneg .cse9))))) (select .cse8 (bvadd |~#signed_short_int_Array_0~0.offset| (_ bv10 32)))) .cse5 (= (bvadd (_ bv4 32) (select (select |#memory_int#2| |~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|)) (_ bv0 32)))))) (bvsge .cse10 (_ bv16383 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet61#1_38| (_ BitVec 16))) (= .cse11 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet61#1_38|))) (bvsge .cse0 (_ bv16383 32)) (bvsle .cse10 (_ bv32767 32)))))) [2023-12-24 13:41:30,983 INFO L899 garLoopResultBuilder]: For program point L83-1(line 83) no Hoare annotation was computed. [2023-12-24 13:41:30,983 INFO L895 garLoopResultBuilder]: At program point L75(line 75) the Hoare annotation is: (let ((.cse13 (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|)) (.cse17 (select |#memory_int#5| |~#unsigned_short_int_Array_0~0.base|))) (let ((.cse16 (select .cse17 (bvadd (_ bv4 32) |~#unsigned_short_int_Array_0~0.offset|))) (.cse14 (select .cse17 (bvadd |~#unsigned_short_int_Array_0~0.offset| (_ bv2 32)))) (.cse12 (select .cse13 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|)))) (let ((.cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse12))) (.cse1 (select .cse13 |~#unsigned_char_Array_0~0.offset|)) (.cse0 ((_ zero_extend 16) ((_ extract 15 0) .cse14))) (.cse15 ((_ zero_extend 16) ((_ extract 15 0) .cse16)))) (and (bvsle .cse0 (_ bv32767 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet47#1_45| (_ BitVec 8))) (= .cse1 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet47#1_45|))) (not (= .cse2 (_ bv0 32))) (let ((.cse11 (select .cse13 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|)))) (let ((.cse10 (select .cse13 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse6 ((_ extract 7 0) .cse11))) (let ((.cse7 ((_ extract 7 0) .cse1)) (.cse3 ((_ zero_extend 24) .cse6)) (.cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet50#1_31| (_ BitVec 8))) (= .cse10 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet50#1_31|)))) (.cse9 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet54#1_30| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet54#1_30|) .cse12))) (.cse5 (= ((_ sign_extend 24) (_ bv10 8)) .cse11))) (or (let ((.cse4 (select |#memory_int#3| |~#signed_short_int_Array_0~0.base|))) (and (or (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse3 (bvneg .cse3)))) (select .cse4 (bvadd |~#signed_short_int_Array_0~0.offset| (_ bv10 32)))) .cse5) (= ((_ sign_extend 16) ((_ zero_extend 8) .cse6)) (select .cse4 (bvadd |~#signed_short_int_Array_0~0.offset| (_ bv8 32)))) (= (select .cse4 |~#signed_short_int_Array_0~0.offset|) ((_ sign_extend 16) ((_ zero_extend 8) .cse7))) .cse8 .cse9 (= (bvadd (_ bv4 32) (select (select |#memory_int#2| |~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|)) (_ bv0 32)))) (and (not (bvsle ((_ zero_extend 24) .cse7) (bvmul (bvsrem (_ bv2 32) .cse2) (bvsdiv .cse3 ((_ zero_extend 24) ((_ extract 7 0) .cse10)))))) .cse8 .cse9 .cse5))))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet58#1_38| (_ BitVec 16))) (= .cse14 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet58#1_38|))) (bvsge .cse15 (_ bv16383 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet61#1_38| (_ BitVec 16))) (= .cse16 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet61#1_38|))) (bvsge .cse0 (_ bv16383 32)) (bvsle .cse15 (_ bv32767 32)))))) [2023-12-24 13:41:30,983 INFO L899 garLoopResultBuilder]: For program point L75-1(line 75) no Hoare annotation was computed. [2023-12-24 13:41:30,983 INFO L895 garLoopResultBuilder]: At program point L108-2(lines 108 114) the Hoare annotation is: (let ((.cse12 (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|)) (.cse16 (select |#memory_int#5| |~#unsigned_short_int_Array_0~0.base|))) (let ((.cse14 (select .cse16 (bvadd (_ bv4 32) |~#unsigned_short_int_Array_0~0.offset|))) (.cse3 (select .cse16 (bvadd |~#unsigned_short_int_Array_0~0.offset| (_ bv2 32)))) (.cse15 (select .cse12 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|)))) (let ((.cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse15))) (.cse1 (select .cse12 |~#unsigned_char_Array_0~0.offset|)) (.cse0 ((_ zero_extend 16) ((_ extract 15 0) .cse3))) (.cse13 ((_ zero_extend 16) ((_ extract 15 0) .cse14)))) (and (bvsle .cse0 (_ bv32767 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet47#1_45| (_ BitVec 8))) (= .cse1 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet47#1_45|))) (not (= .cse2 (_ bv0 32))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet58#1_38| (_ BitVec 16))) (= .cse3 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet58#1_38|))) (let ((.cse11 (select .cse12 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|)))) (let ((.cse6 (select .cse12 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse10 ((_ extract 7 0) .cse11))) (let ((.cse5 ((_ zero_extend 24) .cse10)) (.cse8 (= ((_ sign_extend 24) (_ bv10 8)) .cse11)) (.cse4 ((_ extract 7 0) .cse1)) (.cse7 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet50#1_31| (_ BitVec 8))) (= .cse6 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet50#1_31|))))) (or (and (not (bvsle ((_ zero_extend 24) .cse4) (bvmul (bvsrem (_ bv2 32) .cse2) (bvsdiv .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse6)))))) .cse7 .cse8) (let ((.cse9 (select |#memory_int#3| |~#signed_short_int_Array_0~0.base|))) (and (or (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse5 (bvneg .cse5)))) (select .cse9 (bvadd |~#signed_short_int_Array_0~0.offset| (_ bv10 32)))) .cse8) (= ((_ sign_extend 16) ((_ zero_extend 8) .cse10)) (select .cse9 (bvadd |~#signed_short_int_Array_0~0.offset| (_ bv8 32)))) (= (select .cse9 |~#signed_short_int_Array_0~0.offset|) ((_ sign_extend 16) ((_ zero_extend 8) .cse4))) .cse7 (= (bvadd (_ bv4 32) (select (select |#memory_int#2| |~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|)) (_ bv0 32)))))))) (bvsge .cse13 (_ bv16383 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet61#1_38| (_ BitVec 16))) (= .cse14 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet61#1_38|))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet54#1_45| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet54#1_45|) .cse15)) (bvsge .cse0 (_ bv16383 32)) (bvsle .cse13 (_ bv32767 32)))))) [2023-12-24 13:41:30,983 INFO L899 garLoopResultBuilder]: For program point L108-3(lines 108 114) no Hoare annotation was computed. [2023-12-24 13:41:30,984 INFO L895 garLoopResultBuilder]: At program point L92(line 92) the Hoare annotation is: (let ((.cse11 (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|)) (.cse13 (select (select |#memory_int#5| |~#unsigned_short_int_Array_0~0.base|) (bvadd |~#unsigned_short_int_Array_0~0.offset| (_ bv2 32))))) (let ((.cse12 ((_ extract 15 0) .cse13)) (.cse6 (select .cse11 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|)))) (let ((.cse3 (not (= ((_ zero_extend 24) ((_ extract 7 0) .cse6)) (_ bv0 32)))) (.cse4 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet58#1_38| (_ BitVec 16))) (= .cse13 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet58#1_38|)))) (.cse0 (select .cse11 |~#unsigned_char_Array_0~0.offset|)) (.cse5 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet50#1_31| (_ BitVec 8))) (= (select .cse11 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet50#1_31|)))) (.cse7 (bvsge ((_ zero_extend 16) .cse12) (_ bv16383 32))) (.cse9 (= .cse12 |ULTIMATE.start_updateVariables_#t~mem60#1|)) (.cse10 (select .cse11 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|)))) (or (let ((.cse1 ((_ extract 7 0) .cse10)) (.cse2 (select |#memory_int#3| |~#signed_short_int_Array_0~0.base|))) (and (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet47#1_45| (_ BitVec 8))) (= .cse0 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet47#1_45|))) (= ((_ sign_extend 16) ((_ zero_extend 8) .cse1)) (select .cse2 (bvadd |~#signed_short_int_Array_0~0.offset| (_ bv8 32)))) .cse3 .cse4 .cse5 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet54#1_45| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet54#1_45|) .cse6)) .cse7 (= ((_ sign_extend 16) ((_ extract 15 0) (let ((.cse8 ((_ zero_extend 24) .cse1))) (bvadd .cse8 (bvneg .cse8))))) (select .cse2 (bvadd |~#signed_short_int_Array_0~0.offset| (_ bv10 32)))) .cse9 (= (bvadd (_ bv4 32) (select (select |#memory_int#2| |~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|)) (_ bv0 32)))) (and .cse3 .cse4 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet47#1_38| (_ BitVec 8))) (= .cse0 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet47#1_38|))) .cse5 .cse7 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet54#1_30| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet54#1_30|) .cse6)) .cse9 (= ((_ sign_extend 24) (_ bv10 8)) .cse10)))))) [2023-12-24 13:41:30,984 INFO L899 garLoopResultBuilder]: For program point L92-1(line 92) no Hoare annotation was computed. [2023-12-24 13:41:30,984 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 61) no Hoare annotation was computed. [2023-12-24 13:41:30,984 INFO L899 garLoopResultBuilder]: For program point L59-2(lines 59 61) no Hoare annotation was computed. [2023-12-24 13:41:30,984 INFO L895 garLoopResultBuilder]: At program point L84(line 84) the Hoare annotation is: (let ((.cse12 (select |#memory_int#5| |~#unsigned_short_int_Array_0~0.base|))) (let ((.cse11 (select .cse12 (bvadd (_ bv4 32) |~#unsigned_short_int_Array_0~0.offset|))) (.cse3 (select .cse12 (bvadd |~#unsigned_short_int_Array_0~0.offset| (_ bv2 32)))) (.cse1 (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|))) (let ((.cse2 (select .cse1 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse0 ((_ zero_extend 16) ((_ extract 15 0) .cse3))) (.cse10 ((_ zero_extend 16) ((_ extract 15 0) .cse11)))) (and (bvsle .cse0 (_ bv32767 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet47#1_45| (_ BitVec 8))) (= (select .cse1 |~#unsigned_char_Array_0~0.offset|) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet47#1_45|))) (not (= ((_ zero_extend 24) ((_ extract 7 0) .cse2)) (_ bv0 32))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet58#1_38| (_ BitVec 16))) (= .cse3 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet58#1_38|))) (let ((.cse4 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet50#1_31| (_ BitVec 8))) (= (select .cse1 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet50#1_31|)))) (.cse5 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet54#1_30| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet54#1_30|) .cse2))) (.cse6 (select .cse1 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|)))) (or (and .cse4 .cse5 (= ((_ sign_extend 24) (_ bv10 8)) .cse6)) (let ((.cse7 ((_ extract 7 0) .cse6)) (.cse8 (select |#memory_int#3| |~#signed_short_int_Array_0~0.base|))) (and (= ((_ sign_extend 16) ((_ zero_extend 8) .cse7)) (select .cse8 (bvadd |~#signed_short_int_Array_0~0.offset| (_ bv8 32)))) .cse4 (= ((_ sign_extend 16) ((_ extract 15 0) (let ((.cse9 ((_ zero_extend 24) .cse7))) (bvadd .cse9 (bvneg .cse9))))) (select .cse8 (bvadd |~#signed_short_int_Array_0~0.offset| (_ bv10 32)))) .cse5 (= (bvadd (_ bv4 32) (select (select |#memory_int#2| |~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|)) (_ bv0 32)))))) (bvsge .cse10 (_ bv16383 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet61#1_38| (_ BitVec 16))) (= .cse11 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet61#1_38|))) (bvsge .cse0 (_ bv16383 32)) (bvsle .cse10 (_ bv32767 32)))))) [2023-12-24 13:41:30,984 INFO L899 garLoopResultBuilder]: For program point L84-1(line 84) no Hoare annotation was computed. [2023-12-24 13:41:30,984 INFO L895 garLoopResultBuilder]: At program point L68(line 68) the Hoare annotation is: (let ((.cse13 (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|)) (.cse17 (select |#memory_int#5| |~#unsigned_short_int_Array_0~0.base|))) (let ((.cse16 (select .cse17 (bvadd (_ bv4 32) |~#unsigned_short_int_Array_0~0.offset|))) (.cse14 (select .cse17 (bvadd |~#unsigned_short_int_Array_0~0.offset| (_ bv2 32)))) (.cse12 (select .cse13 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|)))) (let ((.cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse12))) (.cse1 (select .cse13 |~#unsigned_char_Array_0~0.offset|)) (.cse0 ((_ zero_extend 16) ((_ extract 15 0) .cse14))) (.cse15 ((_ zero_extend 16) ((_ extract 15 0) .cse16)))) (and (bvsle .cse0 (_ bv32767 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet47#1_45| (_ BitVec 8))) (= .cse1 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet47#1_45|))) (not (= .cse2 (_ bv0 32))) (let ((.cse11 (select .cse13 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|)))) (let ((.cse10 (select .cse13 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse6 ((_ extract 7 0) .cse11))) (let ((.cse7 ((_ extract 7 0) .cse1)) (.cse3 ((_ zero_extend 24) .cse6)) (.cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet50#1_31| (_ BitVec 8))) (= .cse10 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet50#1_31|)))) (.cse9 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet54#1_30| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet54#1_30|) .cse12))) (.cse5 (= ((_ sign_extend 24) (_ bv10 8)) .cse11))) (or (let ((.cse4 (select |#memory_int#3| |~#signed_short_int_Array_0~0.base|))) (and (or (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse3 (bvneg .cse3)))) (select .cse4 (bvadd |~#signed_short_int_Array_0~0.offset| (_ bv10 32)))) .cse5) (= ((_ sign_extend 16) ((_ zero_extend 8) .cse6)) (select .cse4 (bvadd |~#signed_short_int_Array_0~0.offset| (_ bv8 32)))) (= (select .cse4 |~#signed_short_int_Array_0~0.offset|) ((_ sign_extend 16) ((_ zero_extend 8) .cse7))) .cse8 .cse9 (= (bvadd (_ bv4 32) (select (select |#memory_int#2| |~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|)) (_ bv0 32)))) (and (not (bvsle ((_ zero_extend 24) .cse7) (bvmul (bvsrem (_ bv2 32) .cse2) (bvsdiv .cse3 ((_ zero_extend 24) ((_ extract 7 0) .cse10)))))) .cse8 .cse9 .cse5))))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet58#1_38| (_ BitVec 16))) (= .cse14 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet58#1_38|))) (bvsge .cse15 (_ bv16383 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet61#1_38| (_ BitVec 16))) (= .cse16 ((_ sign_extend 16) |v_ULTIMATE.start_updateVariables_#t~nondet61#1_38|))) (bvsge .cse0 (_ bv16383 32)) (bvsle .cse15 (_ bv32767 32)))))) [2023-12-24 13:41:30,984 INFO L899 garLoopResultBuilder]: For program point L68-1(line 68) no Hoare annotation was computed. [2023-12-24 13:41:30,986 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:41:30,987 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 13:41:31,027 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_short_int_Array_0~0!base][~bvadd~32(~#unsigned_short_int_Array_0~0!offset, 2bv32)] could not be translated [2023-12-24 13:41:31,029 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet47#1_45 : bv8 :: #memory_int#4[~#unsigned_char_Array_0~0!base][~#unsigned_char_Array_0~0!offset] == ~sign_extend~32~8(v_ULTIMATE.start_updateVariables_#t~nondet47#1_45)) could not be translated [2023-12-24 13:41:31,029 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~#unsigned_char_Array_0~0!base][~bvadd~32(3bv32, ~#unsigned_char_Array_0~0!offset)] could not be translated [2023-12-24 13:41:31,030 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet58#1_38 : bv16 :: #memory_int#5[~#unsigned_short_int_Array_0~0!base][~bvadd~32(~#unsigned_short_int_Array_0~0!offset, 2bv32)] == ~sign_extend~32~8(v_ULTIMATE.start_updateVariables_#t~nondet58#1_38)) could not be translated [2023-12-24 13:41:31,030 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:41:31,030 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~#unsigned_char_Array_0~0!base][~bvadd~32(3bv32, ~#unsigned_char_Array_0~0!offset)] could not be translated [2023-12-24 13:41:31,030 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:41:31,030 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:41:31,030 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet50#1_31 : 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~nondet50#1_31)) could not be translated [2023-12-24 13:41:31,030 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:41:31,030 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:41:31,031 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:41:31,031 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#signed_short_int_Array_0~0!base][~bvadd~32(~#signed_short_int_Array_0~0!offset, 10bv32)] could not be translated [2023-12-24 13:41:31,031 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:41:31,031 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:41:31,031 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#signed_short_int_Array_0~0!base][~bvadd~32(~#signed_short_int_Array_0~0!offset, 8bv32)] could not be translated [2023-12-24 13:41:31,031 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:41:31,031 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:41:31,031 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet50#1_31 : 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~nondet50#1_31)) could not be translated [2023-12-24 13:41:31,031 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#signed_long_int_Array_0~0!base][~#signed_long_int_Array_0~0!offset] could not be translated [2023-12-24 13:41:31,031 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_short_int_Array_0~0!base][~bvadd~32(4bv32, ~#unsigned_short_int_Array_0~0!offset)] could not be translated [2023-12-24 13:41:31,032 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet61#1_38 : bv16 :: #memory_int#5[~#unsigned_short_int_Array_0~0!base][~bvadd~32(4bv32, ~#unsigned_short_int_Array_0~0!offset)] == ~sign_extend~32~8(v_ULTIMATE.start_updateVariables_#t~nondet61#1_38)) could not be translated [2023-12-24 13:41:31,032 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet54#1_45 : bv8 :: ~sign_extend~32~8(v_ULTIMATE.start_updateVariables_#t~nondet54#1_45) == #memory_int#4[~#unsigned_char_Array_0~0!base][~bvadd~32(3bv32, ~#unsigned_char_Array_0~0!offset)]) could not be translated [2023-12-24 13:41:31,032 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_short_int_Array_0~0!base][~bvadd~32(~#unsigned_short_int_Array_0~0!offset, 2bv32)] could not be translated [2023-12-24 13:41:31,032 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_short_int_Array_0~0!base][~bvadd~32(4bv32, ~#unsigned_short_int_Array_0~0!offset)] could not be translated [2023-12-24 13:41:31,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 01:41:31 BoogieIcfgContainer [2023-12-24 13:41:31,032 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 13:41:31,033 INFO L158 Benchmark]: Toolchain (without parser) took 761961.63ms. Allocated memory was 165.7MB in the beginning and 805.3MB in the end (delta: 639.6MB). Free memory was 106.7MB in the beginning and 750.2MB in the end (delta: -643.5MB). Peak memory consumption was 468.3MB. Max. memory is 8.0GB. [2023-12-24 13:41:31,037 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 165.7MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 13:41:31,041 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.15ms. Allocated memory is still 165.7MB. Free memory was 106.5MB in the beginning and 89.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-24 13:41:31,041 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.26ms. Allocated memory is still 165.7MB. Free memory was 89.7MB in the beginning and 86.3MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-24 13:41:31,041 INFO L158 Benchmark]: Boogie Preprocessor took 95.12ms. Allocated memory was 165.7MB in the beginning and 268.4MB in the end (delta: 102.8MB). Free memory was 86.0MB in the beginning and 234.7MB in the end (delta: -148.7MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. [2023-12-24 13:41:31,041 INFO L158 Benchmark]: RCFGBuilder took 837.37ms. Allocated memory is still 268.4MB. Free memory was 234.7MB in the beginning and 196.4MB in the end (delta: 38.3MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. [2023-12-24 13:41:31,041 INFO L158 Benchmark]: TraceAbstraction took 760688.45ms. Allocated memory was 268.4MB in the beginning and 805.3MB in the end (delta: 536.9MB). Free memory was 195.3MB in the beginning and 750.2MB in the end (delta: -554.8MB). Peak memory consumption was 451.8MB. Max. memory is 8.0GB. [2023-12-24 13:41:31,041 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.13ms. Allocated memory is still 165.7MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 282.15ms. Allocated memory is still 165.7MB. Free memory was 106.5MB in the beginning and 89.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.26ms. Allocated memory is still 165.7MB. Free memory was 89.7MB in the beginning and 86.3MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 95.12ms. Allocated memory was 165.7MB in the beginning and 268.4MB in the end (delta: 102.8MB). Free memory was 86.0MB in the beginning and 234.7MB in the end (delta: -148.7MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. * RCFGBuilder took 837.37ms. Allocated memory is still 268.4MB. Free memory was 234.7MB in the beginning and 196.4MB in the end (delta: 38.3MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. * TraceAbstraction took 760688.45ms. Allocated memory was 268.4MB in the beginning and 805.3MB in the end (delta: 536.9MB). Free memory was 195.3MB in the beginning and 750.2MB in the end (delta: -554.8MB). Peak memory consumption was 451.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_short_int_Array_0~0!base][~bvadd~32(~#unsigned_short_int_Array_0~0!offset, 2bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet47#1_45 : bv8 :: #memory_int#4[~#unsigned_char_Array_0~0!base][~#unsigned_char_Array_0~0!offset] == ~sign_extend~32~8(v_ULTIMATE.start_updateVariables_#t~nondet47#1_45)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~#unsigned_char_Array_0~0!base][~bvadd~32(3bv32, ~#unsigned_char_Array_0~0!offset)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet58#1_38 : bv16 :: #memory_int#5[~#unsigned_short_int_Array_0~0!base][~bvadd~32(~#unsigned_short_int_Array_0~0!offset, 2bv32)] == ~sign_extend~32~8(v_ULTIMATE.start_updateVariables_#t~nondet58#1_38)) 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(3bv32, ~#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(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][~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~nondet50#1_31 : 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~nondet50#1_31)) 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][~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][~bvadd~32(2bv32, ~#unsigned_char_Array_0~0!offset)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#signed_short_int_Array_0~0!base][~bvadd~32(~#signed_short_int_Array_0~0!offset, 10bv32)] 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][~bvadd~32(2bv32, ~#unsigned_char_Array_0~0!offset)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#signed_short_int_Array_0~0!base][~bvadd~32(~#signed_short_int_Array_0~0!offset, 8bv32)] 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: 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~nondet50#1_31 : 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~nondet50#1_31)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#signed_long_int_Array_0~0!base][~#signed_long_int_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_short_int_Array_0~0!base][~bvadd~32(4bv32, ~#unsigned_short_int_Array_0~0!offset)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet61#1_38 : bv16 :: #memory_int#5[~#unsigned_short_int_Array_0~0!base][~bvadd~32(4bv32, ~#unsigned_short_int_Array_0~0!offset)] == ~sign_extend~32~8(v_ULTIMATE.start_updateVariables_#t~nondet61#1_38)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet54#1_45 : bv8 :: ~sign_extend~32~8(v_ULTIMATE.start_updateVariables_#t~nondet54#1_45) == #memory_int#4[~#unsigned_char_Array_0~0!base][~bvadd~32(3bv32, ~#unsigned_char_Array_0~0!offset)]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_short_int_Array_0~0!base][~bvadd~32(~#unsigned_short_int_Array_0~0!offset, 2bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_short_int_Array_0~0!base][~bvadd~32(4bv32, ~#unsigned_short_int_Array_0~0!offset)] 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, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 760.6s, OverallIterations: 30, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 62.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 638.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3850 SdHoareTripleChecker+Valid, 46.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3716 mSDsluCounter, 17769 SdHoareTripleChecker+Invalid, 42.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13945 mSDsCounter, 537 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9833 IncrementalHoareTripleChecker+Invalid, 10370 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 537 mSolverCounterUnsat, 3824 mSDtfsCounter, 9833 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5226 GetRequests, 4798 SyntacticMatches, 2 SemanticMatches, 426 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2922 ImplicationChecksByTransitivity, 31.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=550occurred in iteration=27, InterpolantAutomatonStates: 359, 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, 30 MinimizatonAttempts, 1940 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 879 PreInvPairs, 984 NumberOfFragments, 4822 HoareAnnotationTreeSize, 879 FormulaSimplifications, 16501820 FormulaSimplificationTreeSizeReduction, 90.9s HoareSimplificationTime, 22 FormulaSimplificationsInter, 5408746 FormulaSimplificationTreeSizeReductionInter, 547.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 5.4s SatisfiabilityAnalysisTime, 43.8s InterpolantComputationTime, 4479 NumberOfCodeBlocks, 4479 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 5051 ConstructedInterpolants, 720 QuantifiedInterpolants, 46942 SizeOfPredicates, 288 NumberOfNonLiveVariables, 9282 ConjunctsInSsa, 441 ConjunctsInUnsatCore, 34 InterpolantComputations, 30 PerfectInterpolantSequences, 25600/25840 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: 108]: Loop Invariant Derived loop invariant: ((((((null & 32767) <= 32767) && !(((null & 127) == 0))) && ((null & 32767) >= 16383)) && ((null & 32767) >= 16383)) && ((null & 32767) <= 32767)) RESULT: Ultimate proved your program to be correct! [2023-12-24 13:41:31,193 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...