/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-ap_file-62.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 15:19:02,677 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 15:19:02,748 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 15:19:02,753 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 15:19:02,753 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 15:19:02,775 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 15:19:02,775 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 15:19:02,775 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 15:19:02,776 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 15:19:02,778 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 15:19:02,779 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 15:19:02,779 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 15:19:02,779 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 15:19:02,780 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 15:19:02,780 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 15:19:02,781 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 15:19:02,781 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 15:19:02,781 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 15:19:02,781 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 15:19:02,781 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 15:19:02,782 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 15:19:02,782 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 15:19:02,782 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 15:19:02,782 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 15:19:02,782 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 15:19:02,782 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 15:19:02,782 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 15:19:02,783 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 15:19:02,783 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 15:19:02,783 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 15:19:02,784 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 15:19:02,784 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 15:19:02,784 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 15:19:02,784 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 15:19:02,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 15:19:02,784 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 15:19:02,784 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 15:19:02,784 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 15:19:02,784 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 15:19:02,785 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 15:19:02,785 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 15:19:02,785 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 15:19:02,785 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 15:19:02,785 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 15:19:02,785 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 15:19:02,785 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 15:19:02,785 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 15:19:02,965 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 15:19:02,981 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 15:19:02,982 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 15:19:02,983 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 15:19:02,983 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 15:19:02,985 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-62.i [2023-12-24 15:19:03,905 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 15:19:04,024 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 15:19:04,024 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-62.i [2023-12-24 15:19:04,031 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/988d9fe85/cd899ba44e574ed3a367ef0c8091673d/FLAG768b2a7e8 [2023-12-24 15:19:04,040 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/988d9fe85/cd899ba44e574ed3a367ef0c8091673d [2023-12-24 15:19:04,041 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 15:19:04,042 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 15:19:04,043 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 15:19:04,044 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 15:19:04,046 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 15:19:04,047 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 03:19:04" (1/1) ... [2023-12-24 15:19:04,047 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@381fc17a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 03:19:04, skipping insertion in model container [2023-12-24 15:19:04,047 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 03:19:04" (1/1) ... [2023-12-24 15:19:04,069 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 15:19:04,152 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-ap_file-62.i[917,930] [2023-12-24 15:19:04,190 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 15:19:04,204 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 15:19:04,212 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-ap_file-62.i[917,930] [2023-12-24 15:19:04,229 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 15:19:04,243 INFO L206 MainTranslator]: Completed translation [2023-12-24 15:19:04,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 03:19:04 WrapperNode [2023-12-24 15:19:04,244 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 15:19:04,244 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 15:19:04,244 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 15:19:04,245 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 15:19:04,249 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 03:19:04" (1/1) ... [2023-12-24 15:19:04,257 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 03:19:04" (1/1) ... [2023-12-24 15:19:04,292 INFO L138 Inliner]: procedures = 33, calls = 111, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 338 [2023-12-24 15:19:04,293 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 15:19:04,293 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 15:19:04,293 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 15:19:04,293 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 15:19:04,302 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 03:19:04" (1/1) ... [2023-12-24 15:19:04,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 03:19:04" (1/1) ... [2023-12-24 15:19:04,306 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 03:19:04" (1/1) ... [2023-12-24 15:19:04,319 INFO L175 MemorySlicer]: Split 87 memory accesses to 6 slices as follows [2, 10, 29, 26, 4, 16]. 33 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 3, 3, 1, 2]. The 14 writes are split as follows [0, 1, 4, 6, 1, 2]. [2023-12-24 15:19:04,319 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 03:19:04" (1/1) ... [2023-12-24 15:19:04,320 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 03:19:04" (1/1) ... [2023-12-24 15:19:04,336 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 03:19:04" (1/1) ... [2023-12-24 15:19:04,338 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 03:19:04" (1/1) ... [2023-12-24 15:19:04,341 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 03:19:04" (1/1) ... [2023-12-24 15:19:04,342 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 03:19:04" (1/1) ... [2023-12-24 15:19:04,350 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 15:19:04,351 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 15:19:04,351 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 15:19:04,351 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 15:19:04,351 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 03:19:04" (1/1) ... [2023-12-24 15:19:04,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 15:19:04,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 15:19:04,382 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 15:19:04,398 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 15:19:04,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 15:19:04,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-12-24 15:19:04,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-12-24 15:19:04,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-12-24 15:19:04,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-12-24 15:19:04,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2023-12-24 15:19:04,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2023-12-24 15:19:04,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2023-12-24 15:19:04,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2023-12-24 15:19:04,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2023-12-24 15:19:04,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2023-12-24 15:19:04,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2023-12-24 15:19:04,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2023-12-24 15:19:04,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 15:19:04,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 15:19:04,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-24 15:19:04,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-24 15:19:04,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-12-24 15:19:04,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2023-12-24 15:19:04,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2023-12-24 15:19:04,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2023-12-24 15:19:04,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2023-12-24 15:19:04,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2023-12-24 15:19:04,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2023-12-24 15:19:04,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2023-12-24 15:19:04,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-24 15:19:04,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-24 15:19:04,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-24 15:19:04,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-12-24 15:19:04,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2023-12-24 15:19:04,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2023-12-24 15:19:04,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2023-12-24 15:19:04,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2023-12-24 15:19:04,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2023-12-24 15:19:04,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2023-12-24 15:19:04,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2023-12-24 15:19:04,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2023-12-24 15:19:04,419 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 15:19:04,419 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 15:19:04,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 15:19:04,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 15:19:04,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-12-24 15:19:04,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-12-24 15:19:04,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2023-12-24 15:19:04,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2023-12-24 15:19:04,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2023-12-24 15:19:04,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2023-12-24 15:19:04,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2023-12-24 15:19:04,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2023-12-24 15:19:04,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2023-12-24 15:19:04,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2023-12-24 15:19:04,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2023-12-24 15:19:04,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2023-12-24 15:19:04,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-24 15:19:04,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-24 15:19:04,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-24 15:19:04,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-12-24 15:19:04,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-12-24 15:19:04,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2023-12-24 15:19:04,570 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 15:19:04,572 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 15:19:04,922 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 15:19:04,972 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 15:19:04,972 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 15:19:04,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 03:19:04 BoogieIcfgContainer [2023-12-24 15:19:04,973 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 15:19:04,974 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 15:19:04,974 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 15:19:04,976 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 15:19:04,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 03:19:04" (1/3) ... [2023-12-24 15:19:04,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@82141cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 03:19:04, skipping insertion in model container [2023-12-24 15:19:04,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 03:19:04" (2/3) ... [2023-12-24 15:19:04,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@82141cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 03:19:04, skipping insertion in model container [2023-12-24 15:19:04,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 03:19:04" (3/3) ... [2023-12-24 15:19:04,978 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-62.i [2023-12-24 15:19:04,990 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 15:19:04,991 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 15:19:05,029 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 15:19:05,035 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;@75d2d2d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 15:19:05,035 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 15:19:05,046 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 56 states have internal predecessors, (81), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-24 15:19:05,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-24 15:19:05,054 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:19:05,055 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 15:19:05,056 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:19:05,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:19:05,060 INFO L85 PathProgramCache]: Analyzing trace with hash 679761065, now seen corresponding path program 1 times [2023-12-24 15:19:05,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:19:05,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2093497735] [2023-12-24 15:19:05,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:19:05,072 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 15:19:05,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:19:05,074 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 15:19:05,079 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 15:19:05,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:19:05,250 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 15:19:05,255 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:19:05,275 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-12-24 15:19:05,275 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 15:19:05,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:19:05,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2093497735] [2023-12-24 15:19:05,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2093497735] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 15:19:05,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 15:19:05,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 15:19:05,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799533037] [2023-12-24 15:19:05,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:19:05,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 15:19:05,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:19:05,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 15:19:05,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 15:19:05,302 INFO L87 Difference]: Start difference. First operand has 66 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 56 states have internal predecessors, (81), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-24 15:19:05,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:19:05,329 INFO L93 Difference]: Finished difference Result 129 states and 200 transitions. [2023-12-24 15:19:05,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 15:19:05,333 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 68 [2023-12-24 15:19:05,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:19:05,338 INFO L225 Difference]: With dead ends: 129 [2023-12-24 15:19:05,338 INFO L226 Difference]: Without dead ends: 64 [2023-12-24 15:19:05,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 15:19:05,342 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 15:19:05,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 15:19:05,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-12-24 15:19:05,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-12-24 15:19:05,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 54 states have internal predecessors, (76), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-24 15:19:05,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 92 transitions. [2023-12-24 15:19:05,370 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 92 transitions. Word has length 68 [2023-12-24 15:19:05,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:19:05,370 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 92 transitions. [2023-12-24 15:19:05,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-24 15:19:05,370 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 92 transitions. [2023-12-24 15:19:05,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-24 15:19:05,372 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:19:05,372 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 15:19:05,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-24 15:19:05,576 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 15:19:05,576 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:19:05,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:19:05,577 INFO L85 PathProgramCache]: Analyzing trace with hash 619301017, now seen corresponding path program 1 times [2023-12-24 15:19:05,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:19:05,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1700514804] [2023-12-24 15:19:05,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:19:05,578 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 15:19:05,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:19:05,579 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 15:19:05,583 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 15:19:05,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:19:05,701 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 15:19:05,704 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:19:05,757 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 15:19:05,757 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 15:19:05,758 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:19:05,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1700514804] [2023-12-24 15:19:05,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1700514804] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 15:19:05,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 15:19:05,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 15:19:05,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230289891] [2023-12-24 15:19:05,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:19:05,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 15:19:05,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:19:05,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 15:19:05,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-24 15:19:05,766 INFO L87 Difference]: Start difference. First operand 64 states and 92 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 15:19:05,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:19:05,946 INFO L93 Difference]: Finished difference Result 151 states and 217 transitions. [2023-12-24 15:19:05,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 15:19:05,946 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 68 [2023-12-24 15:19:05,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:19:05,947 INFO L225 Difference]: With dead ends: 151 [2023-12-24 15:19:05,947 INFO L226 Difference]: Without dead ends: 88 [2023-12-24 15:19:05,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-12-24 15:19:05,949 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 53 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 15:19:05,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 399 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 15:19:05,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-12-24 15:19:05,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 70. [2023-12-24 15:19:05,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 60 states have (on average 1.3666666666666667) internal successors, (82), 60 states have internal predecessors, (82), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-24 15:19:05,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 98 transitions. [2023-12-24 15:19:05,956 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 98 transitions. Word has length 68 [2023-12-24 15:19:05,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:19:05,957 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 98 transitions. [2023-12-24 15:19:05,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 15:19:05,957 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2023-12-24 15:19:05,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-24 15:19:05,958 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:19:05,959 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 15:19:05,971 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 15:19:06,159 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 15:19:06,160 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:19:06,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:19:06,160 INFO L85 PathProgramCache]: Analyzing trace with hash 676559319, now seen corresponding path program 1 times [2023-12-24 15:19:06,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:19:06,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [833287698] [2023-12-24 15:19:06,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:19:06,161 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 15:19:06,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:19:06,167 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 15:19:06,168 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 15:19:06,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:19:06,277 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 15:19:06,280 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:19:06,310 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 15:19:06,310 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 15:19:06,310 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:19:06,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [833287698] [2023-12-24 15:19:06,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [833287698] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 15:19:06,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 15:19:06,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-24 15:19:06,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917511468] [2023-12-24 15:19:06,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:19:06,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 15:19:06,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:19:06,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 15:19:06,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-24 15:19:06,317 INFO L87 Difference]: Start difference. First operand 70 states and 98 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 15:19:06,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:19:06,451 INFO L93 Difference]: Finished difference Result 158 states and 218 transitions. [2023-12-24 15:19:06,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-24 15:19:06,452 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 68 [2023-12-24 15:19:06,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:19:06,454 INFO L225 Difference]: With dead ends: 158 [2023-12-24 15:19:06,454 INFO L226 Difference]: Without dead ends: 89 [2023-12-24 15:19:06,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2023-12-24 15:19:06,455 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 43 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 15:19:06,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 472 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 15:19:06,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-24 15:19:06,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 72. [2023-12-24 15:19:06,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 62 states have (on average 1.3548387096774193) internal successors, (84), 62 states have internal predecessors, (84), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-24 15:19:06,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 100 transitions. [2023-12-24 15:19:06,464 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 100 transitions. Word has length 68 [2023-12-24 15:19:06,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:19:06,464 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 100 transitions. [2023-12-24 15:19:06,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 15:19:06,465 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 100 transitions. [2023-12-24 15:19:06,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-24 15:19:06,466 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:19:06,466 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 15:19:06,471 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 15:19:06,668 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 15:19:06,669 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:19:06,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:19:06,669 INFO L85 PathProgramCache]: Analyzing trace with hash 676618901, now seen corresponding path program 1 times [2023-12-24 15:19:06,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:19:06,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [379109227] [2023-12-24 15:19:06,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:19:06,670 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 15:19:06,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:19:06,671 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 15:19:06,696 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 15:19:06,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:19:06,812 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 15:19:06,818 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:19:07,222 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 15:19:07,252 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 24 treesize of output 12 [2023-12-24 15:19:07,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2023-12-24 15:19:07,300 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 15:19:07,300 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 15:19:07,300 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:19:07,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [379109227] [2023-12-24 15:19:07,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [379109227] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 15:19:07,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 15:19:07,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 15:19:07,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420184777] [2023-12-24 15:19:07,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:19:07,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 15:19:07,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:19:07,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 15:19:07,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-24 15:19:07,302 INFO L87 Difference]: Start difference. First operand 72 states and 100 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 15:19:07,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:19:07,419 INFO L93 Difference]: Finished difference Result 150 states and 207 transitions. [2023-12-24 15:19:07,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 15:19:07,420 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 68 [2023-12-24 15:19:07,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:19:07,421 INFO L225 Difference]: With dead ends: 150 [2023-12-24 15:19:07,421 INFO L226 Difference]: Without dead ends: 79 [2023-12-24 15:19:07,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-24 15:19:07,422 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 129 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 15:19:07,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 164 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 15:19:07,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-12-24 15:19:07,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2023-12-24 15:19:07,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 65 states have (on average 1.323076923076923) internal successors, (86), 66 states have internal predecessors, (86), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-24 15:19:07,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 106 transitions. [2023-12-24 15:19:07,433 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 106 transitions. Word has length 68 [2023-12-24 15:19:07,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:19:07,433 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 106 transitions. [2023-12-24 15:19:07,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 15:19:07,433 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 106 transitions. [2023-12-24 15:19:07,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-24 15:19:07,434 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:19:07,434 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 15:19:07,440 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 (5)] Forceful destruction successful, exit code 0 [2023-12-24 15:19:07,638 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 15:19:07,638 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:19:07,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:19:07,639 INFO L85 PathProgramCache]: Analyzing trace with hash -707403974, now seen corresponding path program 1 times [2023-12-24 15:19:07,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:19:07,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1557869449] [2023-12-24 15:19:07,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:19:07,639 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 15:19:07,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:19:07,640 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 15:19:07,641 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 15:19:07,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:19:07,775 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-24 15:19:07,782 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:19:07,790 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 15:19:07,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2023-12-24 15:19:07,828 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 15:19:07,828 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 15:19:07,829 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:19:07,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1557869449] [2023-12-24 15:19:07,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1557869449] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 15:19:07,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 15:19:07,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 15:19:07,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312877562] [2023-12-24 15:19:07,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:19:07,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 15:19:07,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:19:07,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 15:19:07,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-24 15:19:07,830 INFO L87 Difference]: Start difference. First operand 78 states and 106 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 15:19:07,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:19:07,971 INFO L93 Difference]: Finished difference Result 227 states and 307 transitions. [2023-12-24 15:19:07,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 15:19:07,972 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 70 [2023-12-24 15:19:07,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:19:07,974 INFO L225 Difference]: With dead ends: 227 [2023-12-24 15:19:07,974 INFO L226 Difference]: Without dead ends: 154 [2023-12-24 15:19:07,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-12-24 15:19:07,975 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 172 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 470 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.1s IncrementalHoareTripleChecker+Time [2023-12-24 15:19:07,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 470 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 15:19:07,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-12-24 15:19:07,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 88. [2023-12-24 15:19:07,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 75 states have (on average 1.3333333333333333) internal successors, (100), 76 states have internal predecessors, (100), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-24 15:19:07,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 120 transitions. [2023-12-24 15:19:07,983 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 120 transitions. Word has length 70 [2023-12-24 15:19:07,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:19:07,983 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 120 transitions. [2023-12-24 15:19:07,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 15:19:07,983 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 120 transitions. [2023-12-24 15:19:07,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-24 15:19:07,987 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:19:07,987 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 15:19:07,993 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 15:19:08,192 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 15:19:08,192 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:19:08,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:19:08,193 INFO L85 PathProgramCache]: Analyzing trace with hash -746674476, now seen corresponding path program 1 times [2023-12-24 15:19:08,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:19:08,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [83037201] [2023-12-24 15:19:08,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:19:08,193 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 15:19:08,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:19:08,194 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 15:19:08,196 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 15:19:08,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:19:08,301 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-24 15:19:08,304 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:19:08,477 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 6 proven. 46 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-24 15:19:08,477 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 15:19:08,542 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 15:19:08,542 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:19:08,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [83037201] [2023-12-24 15:19:08,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [83037201] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 15:19:08,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 15:19:08,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2023-12-24 15:19:08,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122722474] [2023-12-24 15:19:08,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:19:08,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 15:19:08,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:19:08,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 15:19:08,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-24 15:19:08,544 INFO L87 Difference]: Start difference. First operand 88 states and 120 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 15:19:08,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:19:08,605 INFO L93 Difference]: Finished difference Result 229 states and 311 transitions. [2023-12-24 15:19:08,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 15:19:08,606 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 72 [2023-12-24 15:19:08,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:19:08,607 INFO L225 Difference]: With dead ends: 229 [2023-12-24 15:19:08,607 INFO L226 Difference]: Without dead ends: 146 [2023-12-24 15:19:08,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-12-24 15:19:08,608 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 128 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 15:19:08,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 347 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 15:19:08,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-12-24 15:19:08,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 88. [2023-12-24 15:19:08,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 75 states have (on average 1.32) internal successors, (99), 76 states have internal predecessors, (99), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-24 15:19:08,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 119 transitions. [2023-12-24 15:19:08,615 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 119 transitions. Word has length 72 [2023-12-24 15:19:08,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:19:08,615 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 119 transitions. [2023-12-24 15:19:08,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 15:19:08,616 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 119 transitions. [2023-12-24 15:19:08,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-24 15:19:08,616 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:19:08,616 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 15:19:08,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-24 15:19:08,822 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 15:19:08,822 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:19:08,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:19:08,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1499775503, now seen corresponding path program 1 times [2023-12-24 15:19:08,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:19:08,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [416946314] [2023-12-24 15:19:08,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:19:08,823 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 15:19:08,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:19:08,824 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 15:19:08,825 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 15:19:08,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:19:08,941 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 15:19:08,943 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:19:08,957 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 15:19:08,957 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 15:19:08,957 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:19:08,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [416946314] [2023-12-24 15:19:08,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [416946314] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 15:19:08,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 15:19:08,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 15:19:08,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823102932] [2023-12-24 15:19:08,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:19:08,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 15:19:08,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:19:08,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 15:19:08,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 15:19:08,959 INFO L87 Difference]: Start difference. First operand 88 states and 119 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 15:19:09,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:19:09,004 INFO L93 Difference]: Finished difference Result 187 states and 253 transitions. [2023-12-24 15:19:09,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 15:19:09,004 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 72 [2023-12-24 15:19:09,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:19:09,005 INFO L225 Difference]: With dead ends: 187 [2023-12-24 15:19:09,005 INFO L226 Difference]: Without dead ends: 104 [2023-12-24 15:19:09,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-24 15:19:09,006 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 60 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 15:19:09,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 319 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 15:19:09,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-12-24 15:19:09,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 91. [2023-12-24 15:19:09,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 78 states have (on average 1.3076923076923077) internal successors, (102), 79 states have internal predecessors, (102), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-24 15:19:09,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 122 transitions. [2023-12-24 15:19:09,013 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 122 transitions. Word has length 72 [2023-12-24 15:19:09,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:19:09,013 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 122 transitions. [2023-12-24 15:19:09,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 15:19:09,013 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 122 transitions. [2023-12-24 15:19:09,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-24 15:19:09,014 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:19:09,014 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 15:19:09,020 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 15:19:09,218 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 15:19:09,218 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:19:09,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:19:09,219 INFO L85 PathProgramCache]: Analyzing trace with hash 300332512, now seen corresponding path program 1 times [2023-12-24 15:19:09,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:19:09,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [33969926] [2023-12-24 15:19:09,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:19:09,219 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 15:19:09,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:19:09,221 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 15:19:09,254 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 15:19:09,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:19:09,335 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-24 15:19:09,337 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:19:09,483 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 15:19:09,510 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 6 proven. 46 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-24 15:19:09,510 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 15:19:09,573 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 15:19:09,573 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:19:09,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [33969926] [2023-12-24 15:19:09,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [33969926] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 15:19:09,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 15:19:09,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2023-12-24 15:19:09,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539090980] [2023-12-24 15:19:09,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:19:09,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 15:19:09,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:19:09,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 15:19:09,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-12-24 15:19:09,575 INFO L87 Difference]: Start difference. First operand 91 states and 122 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 15:19:09,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:19:09,627 INFO L93 Difference]: Finished difference Result 208 states and 277 transitions. [2023-12-24 15:19:09,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 15:19:09,628 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 72 [2023-12-24 15:19:09,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:19:09,629 INFO L225 Difference]: With dead ends: 208 [2023-12-24 15:19:09,629 INFO L226 Difference]: Without dead ends: 122 [2023-12-24 15:19:09,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-12-24 15:19:09,629 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 73 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 15:19:09,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 326 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 15:19:09,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-12-24 15:19:09,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 91. [2023-12-24 15:19:09,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 78 states have (on average 1.294871794871795) internal successors, (101), 79 states have internal predecessors, (101), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-24 15:19:09,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 121 transitions. [2023-12-24 15:19:09,635 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 121 transitions. Word has length 72 [2023-12-24 15:19:09,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:19:09,635 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 121 transitions. [2023-12-24 15:19:09,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 15:19:09,635 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 121 transitions. [2023-12-24 15:19:09,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-24 15:19:09,636 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:19:09,636 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 15:19:09,642 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 15:19:09,840 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 15:19:09,840 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:19:09,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:19:09,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1216085754, now seen corresponding path program 1 times [2023-12-24 15:19:09,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:19:09,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1936188855] [2023-12-24 15:19:09,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:19:09,841 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 15:19:09,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:19:09,842 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 15:19:09,843 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 15:19:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:19:09,969 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-24 15:19:09,973 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:19:11,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-24 15:19:11,394 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 15:19:11,496 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 25 treesize of output 13 [2023-12-24 15:19:11,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-12-24 15:19:11,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-24 15:19:11,560 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 3 proven. 73 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-24 15:19:11,560 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 15:19:11,814 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 15:19:11,814 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 206 treesize of output 204 [2023-12-24 15:19:11,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 218 [2023-12-24 15:19:12,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 267 treesize of output 255 [2023-12-24 15:19:15,379 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:19:15,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1936188855] [2023-12-24 15:19:15,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1936188855] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 15:19:15,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1017737509] [2023-12-24 15:19:15,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:19:15,379 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 15:19:15,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 15:19:15,421 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 15:19:15,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2023-12-24 15:19:15,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:19:15,639 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-24 15:19:15,642 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:19:15,978 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 15:19:16,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-24 15:19:16,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-24 15:19:16,508 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 3 proven. 73 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-24 15:19:16,508 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 15:19:16,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2023-12-24 15:19:17,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1017737509] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 15:19:17,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 15:19:17,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 21 [2023-12-24 15:19:17,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522201254] [2023-12-24 15:19:17,024 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 15:19:17,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-24 15:19:17,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:19:17,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-24 15:19:17,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=971, Unknown=0, NotChecked=0, Total=1122 [2023-12-24 15:19:17,025 INFO L87 Difference]: Start difference. First operand 91 states and 121 transitions. Second operand has 22 states, 20 states have (on average 3.45) internal successors, (69), 19 states have internal predecessors, (69), 6 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) [2023-12-24 15:19:18,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:19:18,712 INFO L93 Difference]: Finished difference Result 247 states and 318 transitions. [2023-12-24 15:19:18,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-24 15:19:18,713 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 3.45) internal successors, (69), 19 states have internal predecessors, (69), 6 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) Word has length 74 [2023-12-24 15:19:18,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:19:18,715 INFO L225 Difference]: With dead ends: 247 [2023-12-24 15:19:18,715 INFO L226 Difference]: Without dead ends: 161 [2023-12-24 15:19:18,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=521, Invalid=2029, Unknown=0, NotChecked=0, Total=2550 [2023-12-24 15:19:18,717 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 623 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-24 15:19:18,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 636 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-24 15:19:18,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2023-12-24 15:19:18,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 91. [2023-12-24 15:19:18,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 79 states have (on average 1.2658227848101267) internal successors, (100), 79 states have internal predecessors, (100), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-24 15:19:18,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 116 transitions. [2023-12-24 15:19:18,729 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 116 transitions. Word has length 74 [2023-12-24 15:19:18,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:19:18,730 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 116 transitions. [2023-12-24 15:19:18,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 3.45) internal successors, (69), 19 states have internal predecessors, (69), 6 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) [2023-12-24 15:19:18,730 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 116 transitions. [2023-12-24 15:19:18,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-24 15:19:18,731 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:19:18,731 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 15:19:18,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2023-12-24 15:19:18,941 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 15:19:19,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 15:19:19,139 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:19:19,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:19:19,139 INFO L85 PathProgramCache]: Analyzing trace with hash -748214023, now seen corresponding path program 1 times [2023-12-24 15:19:19,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:19:19,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [251275281] [2023-12-24 15:19:19,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:19:19,140 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 15:19:19,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:19:19,141 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 15:19:19,143 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 15:19:19,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:19:19,267 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-24 15:19:19,271 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:19:19,504 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 15:19:20,084 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 22 treesize of output 21 [2023-12-24 15:19:20,191 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 47 treesize of output 41 [2023-12-24 15:19:20,365 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 15:19:20,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 33 [2023-12-24 15:19:20,457 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 5 proven. 63 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-12-24 15:19:20,457 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 15:19:21,800 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-12-24 15:19:21,801 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 31700 treesize of output 30104 [2023-12-24 15:19:21,969 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 15:19:21,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4284 treesize of output 4054 [2023-12-24 15:19:22,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1102 treesize of output 1062 [2023-12-24 15:19:26,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2674 treesize of output 2580 [2023-12-24 15:19:36,704 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-12-24 15:19:36,704 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:19:36,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [251275281] [2023-12-24 15:19:36,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [251275281] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 15:19:36,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 15:19:36,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2023-12-24 15:19:36,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634352159] [2023-12-24 15:19:36,704 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 15:19:36,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-24 15:19:36,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:19:36,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-24 15:19:36,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=656, Unknown=0, NotChecked=0, Total=812 [2023-12-24 15:19:36,706 INFO L87 Difference]: Start difference. First operand 91 states and 116 transitions. Second operand has 29 states, 27 states have (on average 2.740740740740741) internal successors, (74), 28 states have internal predecessors, (74), 6 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) [2023-12-24 15:19:38,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:19:38,748 INFO L93 Difference]: Finished difference Result 286 states and 360 transitions. [2023-12-24 15:19:38,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-12-24 15:19:38,749 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 2.740740740740741) internal successors, (74), 28 states have internal predecessors, (74), 6 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) Word has length 75 [2023-12-24 15:19:38,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:19:38,750 INFO L225 Difference]: With dead ends: 286 [2023-12-24 15:19:38,750 INFO L226 Difference]: Without dead ends: 196 [2023-12-24 15:19:38,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=677, Invalid=2403, Unknown=0, NotChecked=0, Total=3080 [2023-12-24 15:19:38,751 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 755 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-24 15:19:38,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 1013 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-24 15:19:38,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2023-12-24 15:19:38,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 105. [2023-12-24 15:19:38,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 92 states have (on average 1.2608695652173914) internal successors, (116), 92 states have internal predecessors, (116), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-24 15:19:38,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 132 transitions. [2023-12-24 15:19:38,762 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 132 transitions. Word has length 75 [2023-12-24 15:19:38,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:19:38,763 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 132 transitions. [2023-12-24 15:19:38,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 2.740740740740741) internal successors, (74), 28 states have internal predecessors, (74), 6 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) [2023-12-24 15:19:38,763 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 132 transitions. [2023-12-24 15:19:38,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-24 15:19:38,763 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:19:38,763 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 15:19:38,769 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 15:19:38,967 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 15:19:38,967 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:19:38,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:19:38,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1759331273, now seen corresponding path program 1 times [2023-12-24 15:19:38,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:19:38,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [517031609] [2023-12-24 15:19:38,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:19:38,968 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 15:19:38,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:19:38,969 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 15:19:38,970 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 15:19:39,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:19:39,091 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 15:19:39,093 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:19:39,446 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 15:19:39,492 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 25 treesize of output 13 [2023-12-24 15:19:39,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-12-24 15:19:39,526 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 15:19:39,526 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 15:19:39,526 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:19:39,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [517031609] [2023-12-24 15:19:39,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [517031609] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 15:19:39,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 15:19:39,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-24 15:19:39,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793483778] [2023-12-24 15:19:39,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:19:39,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 15:19:39,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:19:39,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 15:19:39,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-24 15:19:39,528 INFO L87 Difference]: Start difference. First operand 105 states and 132 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 15:19:39,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:19:39,853 INFO L93 Difference]: Finished difference Result 283 states and 357 transitions. [2023-12-24 15:19:39,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 15:19:39,854 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2023-12-24 15:19:39,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:19:39,855 INFO L225 Difference]: With dead ends: 283 [2023-12-24 15:19:39,855 INFO L226 Difference]: Without dead ends: 179 [2023-12-24 15:19:39,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2023-12-24 15:19:39,855 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 298 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 15:19:39,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 336 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 15:19:39,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2023-12-24 15:19:39,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 105. [2023-12-24 15:19:39,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 92 states have (on average 1.25) internal successors, (115), 92 states have internal predecessors, (115), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-24 15:19:39,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 131 transitions. [2023-12-24 15:19:39,867 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 131 transitions. Word has length 75 [2023-12-24 15:19:39,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:19:39,867 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 131 transitions. [2023-12-24 15:19:39,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 15:19:39,867 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 131 transitions. [2023-12-24 15:19:39,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-24 15:19:39,869 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:19:39,869 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 15:19:39,873 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 15:19:40,069 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 15:19:40,070 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:19:40,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:19:40,070 INFO L85 PathProgramCache]: Analyzing trace with hash -529359305, now seen corresponding path program 1 times [2023-12-24 15:19:40,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:19:40,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1871739730] [2023-12-24 15:19:40,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:19:40,070 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 15:19:40,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:19:40,071 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 15:19:40,072 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 15:19:40,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:19:40,199 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 15:19:40,201 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:19:40,532 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 15:19:40,576 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 14 [2023-12-24 15:19:40,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-24 15:19:40,620 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 15:19:40,620 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 15:19:40,620 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:19:40,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1871739730] [2023-12-24 15:19:40,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1871739730] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 15:19:40,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 15:19:40,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-24 15:19:40,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807608090] [2023-12-24 15:19:40,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:19:40,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 15:19:40,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:19:40,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 15:19:40,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-24 15:19:40,621 INFO L87 Difference]: Start difference. First operand 105 states and 131 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 15:19:41,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:19:41,087 INFO L93 Difference]: Finished difference Result 248 states and 310 transitions. [2023-12-24 15:19:41,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 15:19:41,088 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2023-12-24 15:19:41,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:19:41,089 INFO L225 Difference]: With dead ends: 248 [2023-12-24 15:19:41,089 INFO L226 Difference]: Without dead ends: 144 [2023-12-24 15:19:41,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-12-24 15:19:41,089 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 212 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-24 15:19:41,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 362 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-24 15:19:41,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-12-24 15:19:41,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 105. [2023-12-24 15:19:41,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 92 states have (on average 1.2391304347826086) internal successors, (114), 92 states have internal predecessors, (114), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-24 15:19:41,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 130 transitions. [2023-12-24 15:19:41,098 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 130 transitions. Word has length 75 [2023-12-24 15:19:41,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:19:41,098 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 130 transitions. [2023-12-24 15:19:41,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 15:19:41,098 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 130 transitions. [2023-12-24 15:19:41,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-24 15:19:41,099 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:19:41,099 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 15:19:41,119 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 15:19:41,302 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 15:19:41,302 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:19:41,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:19:41,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1540476555, now seen corresponding path program 1 times [2023-12-24 15:19:41,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:19:41,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [46949687] [2023-12-24 15:19:41,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:19:41,303 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 15:19:41,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:19:41,305 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 15:19:41,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-24 15:19:41,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:19:41,431 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-24 15:19:41,433 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:19:41,487 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 15:19:41,717 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 15:19:42,190 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 15:19:42,291 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 51 treesize of output 45 [2023-12-24 15:19:42,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 15:19:42,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 36 [2023-12-24 15:19:42,565 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-12-24 15:19:42,565 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 15:19:42,717 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 15:19:42,717 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:19:42,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [46949687] [2023-12-24 15:19:42,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [46949687] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 15:19:42,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 15:19:42,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15] total 21 [2023-12-24 15:19:42,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500331634] [2023-12-24 15:19:42,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:19:42,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-24 15:19:42,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:19:42,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-24 15:19:42,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2023-12-24 15:19:42,718 INFO L87 Difference]: Start difference. First operand 105 states and 130 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 15:19:43,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:19:43,040 INFO L93 Difference]: Finished difference Result 246 states and 306 transitions. [2023-12-24 15:19:43,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-24 15:19:43,041 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2023-12-24 15:19:43,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:19:43,042 INFO L225 Difference]: With dead ends: 246 [2023-12-24 15:19:43,042 INFO L226 Difference]: Without dead ends: 142 [2023-12-24 15:19:43,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2023-12-24 15:19:43,043 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 185 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 15:19:43,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 758 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 15:19:43,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-12-24 15:19:43,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 99. [2023-12-24 15:19:43,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 86 states have (on average 1.244186046511628) internal successors, (107), 86 states have internal predecessors, (107), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-24 15:19:43,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 123 transitions. [2023-12-24 15:19:43,050 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 123 transitions. Word has length 75 [2023-12-24 15:19:43,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:19:43,050 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 123 transitions. [2023-12-24 15:19:43,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 15:19:43,050 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 123 transitions. [2023-12-24 15:19:43,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-24 15:19:43,051 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:19:43,051 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 15:19:43,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-12-24 15:19:43,255 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 15:19:43,255 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:19:43,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:19:43,255 INFO L85 PathProgramCache]: Analyzing trace with hash 574790036, now seen corresponding path program 1 times [2023-12-24 15:19:43,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:19:43,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [472797403] [2023-12-24 15:19:43,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:19:43,256 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 15:19:43,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:19:43,257 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 15:19:43,257 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 15:19:43,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:19:43,363 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-24 15:19:43,364 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:19:43,503 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 15:19:43,520 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 6 proven. 46 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-24 15:19:43,520 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 15:19:43,595 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 15:19:43,595 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:19:43,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [472797403] [2023-12-24 15:19:43,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [472797403] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 15:19:43,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 15:19:43,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2023-12-24 15:19:43,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140568615] [2023-12-24 15:19:43,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:19:43,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 15:19:43,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:19:43,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 15:19:43,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-12-24 15:19:43,596 INFO L87 Difference]: Start difference. First operand 99 states and 123 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 15:19:43,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:19:43,646 INFO L93 Difference]: Finished difference Result 231 states and 288 transitions. [2023-12-24 15:19:43,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 15:19:43,647 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2023-12-24 15:19:43,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:19:43,647 INFO L225 Difference]: With dead ends: 231 [2023-12-24 15:19:43,647 INFO L226 Difference]: Without dead ends: 133 [2023-12-24 15:19:43,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-12-24 15:19:43,648 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 84 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 15:19:43,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 228 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 15:19:43,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-12-24 15:19:43,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 99. [2023-12-24 15:19:43,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 86 states have (on average 1.2325581395348837) internal successors, (106), 86 states have internal predecessors, (106), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-24 15:19:43,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 122 transitions. [2023-12-24 15:19:43,654 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 122 transitions. Word has length 75 [2023-12-24 15:19:43,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:19:43,655 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 122 transitions. [2023-12-24 15:19:43,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 15:19:43,655 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 122 transitions. [2023-12-24 15:19:43,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-24 15:19:43,655 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:19:43,655 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 15:19:43,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-12-24 15:19:43,859 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 15:19:43,859 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:19:43,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:19:43,860 INFO L85 PathProgramCache]: Analyzing trace with hash 4851948, now seen corresponding path program 1 times [2023-12-24 15:19:43,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:19:43,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [23748270] [2023-12-24 15:19:43,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:19:43,860 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 15:19:43,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:19:43,861 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 15:19:43,862 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 15:19:43,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:19:43,968 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-24 15:19:43,970 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:19:44,126 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 15:19:44,142 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 6 proven. 46 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-24 15:19:44,142 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 15:19:44,213 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 15:19:44,213 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:19:44,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [23748270] [2023-12-24 15:19:44,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [23748270] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 15:19:44,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 15:19:44,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2023-12-24 15:19:44,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28203031] [2023-12-24 15:19:44,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:19:44,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 15:19:44,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:19:44,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 15:19:44,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-12-24 15:19:44,214 INFO L87 Difference]: Start difference. First operand 99 states and 122 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 15:19:44,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:19:44,271 INFO L93 Difference]: Finished difference Result 263 states and 329 transitions. [2023-12-24 15:19:44,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 15:19:44,275 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 76 [2023-12-24 15:19:44,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:19:44,276 INFO L225 Difference]: With dead ends: 263 [2023-12-24 15:19:44,276 INFO L226 Difference]: Without dead ends: 165 [2023-12-24 15:19:44,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-12-24 15:19:44,276 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 111 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 15:19:44,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 261 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 15:19:44,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-12-24 15:19:44,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 104. [2023-12-24 15:19:44,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 91 states have (on average 1.2307692307692308) internal successors, (112), 91 states have internal predecessors, (112), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-24 15:19:44,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 128 transitions. [2023-12-24 15:19:44,283 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 128 transitions. Word has length 76 [2023-12-24 15:19:44,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:19:44,284 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 128 transitions. [2023-12-24 15:19:44,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 15:19:44,284 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 128 transitions. [2023-12-24 15:19:44,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-24 15:19:44,284 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:19:44,284 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 15:19:44,301 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 15:19:44,500 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 15:19:44,500 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:19:44,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:19:44,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1451267443, now seen corresponding path program 1 times [2023-12-24 15:19:44,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:19:44,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [640319602] [2023-12-24 15:19:44,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:19:44,501 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 15:19:44,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:19:44,502 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 15:19:44,503 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 15:19:44,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:19:44,632 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 15:19:44,634 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:19:44,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2023-12-24 15:19:44,679 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 15:19:44,693 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 15:19:44,693 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 15:19:44,693 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:19:44,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [640319602] [2023-12-24 15:19:44,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [640319602] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 15:19:44,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 15:19:44,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 15:19:44,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658056087] [2023-12-24 15:19:44,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:19:44,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 15:19:44,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:19:44,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 15:19:44,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 15:19:44,694 INFO L87 Difference]: Start difference. First operand 104 states and 128 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 15:19:44,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:19:44,862 INFO L93 Difference]: Finished difference Result 204 states and 252 transitions. [2023-12-24 15:19:44,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 15:19:44,863 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 76 [2023-12-24 15:19:44,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:19:44,864 INFO L225 Difference]: With dead ends: 204 [2023-12-24 15:19:44,864 INFO L226 Difference]: Without dead ends: 101 [2023-12-24 15:19:44,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-24 15:19:44,864 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 73 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 15:19:44,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 178 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 15:19:44,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-12-24 15:19:44,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2023-12-24 15:19:44,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 88 states have internal predecessors, (107), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-24 15:19:44,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 123 transitions. [2023-12-24 15:19:44,871 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 123 transitions. Word has length 76 [2023-12-24 15:19:44,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:19:44,871 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 123 transitions. [2023-12-24 15:19:44,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 15:19:44,871 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2023-12-24 15:19:44,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-24 15:19:44,872 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:19:44,872 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 15:19:44,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-12-24 15:19:45,076 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 15:19:45,076 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:19:45,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:19:45,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1674557519, now seen corresponding path program 1 times [2023-12-24 15:19:45,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:19:45,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [452873019] [2023-12-24 15:19:45,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:19:45,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 15:19:45,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:19:45,078 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 15:19:45,080 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 15:19:45,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:19:45,215 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-24 15:19:45,217 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:19:45,548 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 15:19:45,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-12-24 15:19:45,853 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 15:19:45,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 34 [2023-12-24 15:19:45,896 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 24 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-24 15:19:45,897 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 15:19:45,988 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 15:19:45,988 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:19:45,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [452873019] [2023-12-24 15:19:45,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [452873019] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 15:19:45,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 15:19:45,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 15 [2023-12-24 15:19:45,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153629870] [2023-12-24 15:19:45,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:19:45,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 15:19:45,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:19:45,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 15:19:45,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2023-12-24 15:19:45,990 INFO L87 Difference]: Start difference. First operand 101 states and 123 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 15:19:46,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:19:46,335 INFO L93 Difference]: Finished difference Result 327 states and 399 transitions. [2023-12-24 15:19:46,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-24 15:19:46,336 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 78 [2023-12-24 15:19:46,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:19:46,337 INFO L225 Difference]: With dead ends: 327 [2023-12-24 15:19:46,337 INFO L226 Difference]: Without dead ends: 227 [2023-12-24 15:19:46,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=692, Unknown=0, NotChecked=0, Total=870 [2023-12-24 15:19:46,338 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 305 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 15:19:46,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 617 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 15:19:46,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-12-24 15:19:46,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 177. [2023-12-24 15:19:46,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 154 states have (on average 1.1753246753246753) internal successors, (181), 155 states have internal predecessors, (181), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-24 15:19:46,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 209 transitions. [2023-12-24 15:19:46,350 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 209 transitions. Word has length 78 [2023-12-24 15:19:46,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:19:46,350 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 209 transitions. [2023-12-24 15:19:46,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 15:19:46,350 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 209 transitions. [2023-12-24 15:19:46,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-24 15:19:46,350 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:19:46,350 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 15:19:46,357 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 15:19:46,559 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 15:19:46,560 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:19:46,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:19:46,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1455702801, now seen corresponding path program 1 times [2023-12-24 15:19:46,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:19:46,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [68280897] [2023-12-24 15:19:46,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:19:46,561 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 15:19:46,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:19:46,561 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 15:19:46,564 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 15:19:46,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:19:46,674 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-24 15:19:46,676 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:19:46,758 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 15:19:46,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2023-12-24 15:19:46,782 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 15:19:46,782 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 15:19:46,782 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:19:46,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [68280897] [2023-12-24 15:19:46,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [68280897] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 15:19:46,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 15:19:46,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-24 15:19:46,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420183957] [2023-12-24 15:19:46,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:19:46,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 15:19:46,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:19:46,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 15:19:46,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-24 15:19:46,784 INFO L87 Difference]: Start difference. First operand 177 states and 209 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 15:19:47,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:19:47,001 INFO L93 Difference]: Finished difference Result 416 states and 493 transitions. [2023-12-24 15:19:47,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 15:19:47,004 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 78 [2023-12-24 15:19:47,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:19:47,005 INFO L225 Difference]: With dead ends: 416 [2023-12-24 15:19:47,005 INFO L226 Difference]: Without dead ends: 240 [2023-12-24 15:19:47,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-24 15:19:47,006 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 88 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 15:19:47,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 474 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 15:19:47,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2023-12-24 15:19:47,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 192. [2023-12-24 15:19:47,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 169 states have (on average 1.165680473372781) internal successors, (197), 170 states have internal predecessors, (197), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-24 15:19:47,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 225 transitions. [2023-12-24 15:19:47,024 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 225 transitions. Word has length 78 [2023-12-24 15:19:47,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:19:47,024 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 225 transitions. [2023-12-24 15:19:47,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 15:19:47,024 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 225 transitions. [2023-12-24 15:19:47,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-12-24 15:19:47,027 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:19:47,027 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 15:19:47,033 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 15:19:47,231 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 15:19:47,231 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:19:47,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:19:47,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1177574646, now seen corresponding path program 1 times [2023-12-24 15:19:47,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:19:47,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [880106526] [2023-12-24 15:19:47,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:19:47,232 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 15:19:47,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:19:47,234 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 15:19:47,267 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 15:19:47,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:19:47,387 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-24 15:19:47,389 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:19:47,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-12-24 15:19:47,776 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-12-24 15:19:47,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2023-12-24 15:19:47,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 39 [2023-12-24 15:19:47,980 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2023-12-24 15:19:47,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 37 [2023-12-24 15:19:47,998 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 15:19:47,999 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 15:19:47,999 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:19:47,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [880106526] [2023-12-24 15:19:47,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [880106526] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 15:19:47,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 15:19:47,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 15:19:47,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867601770] [2023-12-24 15:19:47,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:19:48,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 15:19:48,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:19:48,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 15:19:48,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-24 15:19:48,001 INFO L87 Difference]: Start difference. First operand 192 states and 225 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 15:19:48,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:19:48,202 INFO L93 Difference]: Finished difference Result 225 states and 259 transitions. [2023-12-24 15:19:48,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 15:19:48,202 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 80 [2023-12-24 15:19:48,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:19:48,203 INFO L225 Difference]: With dead ends: 225 [2023-12-24 15:19:48,203 INFO L226 Difference]: Without dead ends: 223 [2023-12-24 15:19:48,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-24 15:19:48,204 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 74 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 15:19:48,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 267 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 15:19:48,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2023-12-24 15:19:48,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 220. [2023-12-24 15:19:48,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 189 states have (on average 1.1481481481481481) internal successors, (217), 191 states have internal predecessors, (217), 18 states have call successors, (18), 12 states have call predecessors, (18), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-24 15:19:48,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 253 transitions. [2023-12-24 15:19:48,221 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 253 transitions. Word has length 80 [2023-12-24 15:19:48,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:19:48,222 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 253 transitions. [2023-12-24 15:19:48,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 15:19:48,222 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 253 transitions. [2023-12-24 15:19:48,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-12-24 15:19:48,222 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:19:48,222 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 15:19:48,231 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 15:19:48,426 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 15:19:48,426 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:19:48,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:19:48,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1177515064, now seen corresponding path program 1 times [2023-12-24 15:19:48,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:19:48,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1328833121] [2023-12-24 15:19:48,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:19:48,427 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 15:19:48,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:19:48,428 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 15:19:48,440 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 15:19:48,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:19:48,576 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-24 15:19:48,578 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:19:48,835 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 15 treesize of output 15 [2023-12-24 15:19:49,001 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 15:19:49,001 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 15:19:49,001 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:19:49,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1328833121] [2023-12-24 15:19:49,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1328833121] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 15:19:49,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 15:19:49,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 15:19:49,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530697557] [2023-12-24 15:19:49,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:19:49,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 15:19:49,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:19:49,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 15:19:49,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-24 15:19:49,002 INFO L87 Difference]: Start difference. First operand 220 states and 253 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 15:19:49,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:19:49,142 INFO L93 Difference]: Finished difference Result 424 states and 488 transitions. [2023-12-24 15:19:49,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 15:19:49,142 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 80 [2023-12-24 15:19:49,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:19:49,143 INFO L225 Difference]: With dead ends: 424 [2023-12-24 15:19:49,143 INFO L226 Difference]: Without dead ends: 221 [2023-12-24 15:19:49,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 75 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 15:19:49,144 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 82 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 15:19:49,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 271 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 15:19:49,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2023-12-24 15:19:49,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 220. [2023-12-24 15:19:49,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 189 states have (on average 1.1375661375661377) internal successors, (215), 191 states have internal predecessors, (215), 18 states have call successors, (18), 12 states have call predecessors, (18), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-24 15:19:49,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 251 transitions. [2023-12-24 15:19:49,167 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 251 transitions. Word has length 80 [2023-12-24 15:19:49,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:19:49,168 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 251 transitions. [2023-12-24 15:19:49,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 15:19:49,168 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 251 transitions. [2023-12-24 15:19:49,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-12-24 15:19:49,168 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:19:49,168 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 15:19:49,175 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 15:19:49,375 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 15:19:49,375 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:19:49,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:19:49,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1120256762, now seen corresponding path program 1 times [2023-12-24 15:19:49,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:19:49,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [720108184] [2023-12-24 15:19:49,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:19:49,376 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 15:19:49,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:19:49,377 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 15:19:49,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-12-24 15:19:49,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:19:49,523 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-24 15:19:49,526 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:19:50,516 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 15:19:50,795 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 27 treesize of output 27 [2023-12-24 15:19:50,963 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 39 treesize of output 37 [2023-12-24 15:19:51,112 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 39 treesize of output 27 [2023-12-24 15:19:51,508 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-12-24 15:19:51,508 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 15:19:53,166 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:19:53,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [720108184] [2023-12-24 15:19:53,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [720108184] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 15:19:53,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1939524745] [2023-12-24 15:19:53,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:19:53,166 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 15:19:53,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 15:19:53,167 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 15:19:53,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2023-12-24 15:19:53,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:19:53,408 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-24 15:19:53,411 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:19:54,500 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 15:19:54,902 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 15:19:55,240 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 27 treesize of output 27 [2023-12-24 15:19:55,435 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 39 treesize of output 37 [2023-12-24 15:19:55,664 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 39 treesize of output 27 [2023-12-24 15:19:56,155 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-24 15:19:56,155 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 15:19:58,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1939524745] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 15:19:58,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 15:19:58,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 15 [2023-12-24 15:19:58,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188926243] [2023-12-24 15:19:58,434 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 15:19:58,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-24 15:19:58,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:19:58,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-24 15:19:58,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2023-12-24 15:19:58,435 INFO L87 Difference]: Start difference. First operand 220 states and 251 transitions. Second operand has 16 states, 16 states have (on average 5.4375) internal successors, (87), 15 states have internal predecessors, (87), 5 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2023-12-24 15:19:59,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:19:59,605 INFO L93 Difference]: Finished difference Result 568 states and 652 transitions. [2023-12-24 15:19:59,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-24 15:19:59,606 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.4375) internal successors, (87), 15 states have internal predecessors, (87), 5 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) Word has length 80 [2023-12-24 15:19:59,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:19:59,607 INFO L225 Difference]: With dead ends: 568 [2023-12-24 15:19:59,607 INFO L226 Difference]: Without dead ends: 365 [2023-12-24 15:19:59,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 201 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2023-12-24 15:19:59,608 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 299 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-24 15:19:59,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 386 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-24 15:19:59,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2023-12-24 15:19:59,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 321. [2023-12-24 15:19:59,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 290 states have (on average 1.1413793103448275) internal successors, (331), 292 states have internal predecessors, (331), 18 states have call successors, (18), 12 states have call predecessors, (18), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-24 15:19:59,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 367 transitions. [2023-12-24 15:19:59,644 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 367 transitions. Word has length 80 [2023-12-24 15:19:59,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:19:59,646 INFO L495 AbstractCegarLoop]: Abstraction has 321 states and 367 transitions. [2023-12-24 15:19:59,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.4375) internal successors, (87), 15 states have internal predecessors, (87), 5 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2023-12-24 15:19:59,646 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 367 transitions. [2023-12-24 15:19:59,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-12-24 15:19:59,647 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:19:59,647 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 15:19:59,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Ended with exit code 0 [2023-12-24 15:19:59,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2023-12-24 15:20:00,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 15:20:00,050 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:20:00,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:20:00,050 INFO L85 PathProgramCache]: Analyzing trace with hash 318973285, now seen corresponding path program 1 times [2023-12-24 15:20:00,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:20:00,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [218432740] [2023-12-24 15:20:00,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:20:00,051 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 15:20:00,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:20:00,058 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 15:20:00,059 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 15:20:00,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:20:00,174 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-24 15:20:00,176 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:20:00,319 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 6 proven. 46 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-24 15:20:00,319 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 15:20:00,375 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 15:20:00,375 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:20:00,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [218432740] [2023-12-24 15:20:00,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [218432740] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 15:20:00,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 15:20:00,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2023-12-24 15:20:00,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354407195] [2023-12-24 15:20:00,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:20:00,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 15:20:00,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:20:00,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 15:20:00,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-24 15:20:00,376 INFO L87 Difference]: Start difference. First operand 321 states and 367 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 15:20:00,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:20:00,450 INFO L93 Difference]: Finished difference Result 673 states and 770 transitions. [2023-12-24 15:20:00,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 15:20:00,452 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 81 [2023-12-24 15:20:00,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:20:00,453 INFO L225 Difference]: With dead ends: 673 [2023-12-24 15:20:00,453 INFO L226 Difference]: Without dead ends: 369 [2023-12-24 15:20:00,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-12-24 15:20:00,454 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 51 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 15:20:00,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 327 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 15:20:00,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2023-12-24 15:20:00,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 279. [2023-12-24 15:20:00,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 248 states have (on average 1.125) internal successors, (279), 250 states have internal predecessors, (279), 18 states have call successors, (18), 12 states have call predecessors, (18), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-24 15:20:00,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 315 transitions. [2023-12-24 15:20:00,476 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 315 transitions. Word has length 81 [2023-12-24 15:20:00,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:20:00,477 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 315 transitions. [2023-12-24 15:20:00,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 15:20:00,477 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 315 transitions. [2023-12-24 15:20:00,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-12-24 15:20:00,477 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:20:00,477 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 15:20:00,483 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 15:20:00,681 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 15:20:00,681 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:20:00,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:20:00,681 INFO L85 PathProgramCache]: Analyzing trace with hash -283922431, now seen corresponding path program 1 times [2023-12-24 15:20:00,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:20:00,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [337224761] [2023-12-24 15:20:00,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:20:00,682 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 15:20:00,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:20:00,683 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 15:20:00,687 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 15:20:00,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:20:00,836 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-24 15:20:00,839 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:20:00,897 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 15:20:01,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-24 15:20:01,595 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 24 treesize of output 23 [2023-12-24 15:20:01,625 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 15:20:01,625 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 1 case distinctions, treesize of input 35 treesize of output 26 [2023-12-24 15:20:01,759 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 15:20:01,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 16 [2023-12-24 15:20:01,785 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-12-24 15:20:01,785 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 15:20:02,258 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:20:02,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [337224761] [2023-12-24 15:20:02,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [337224761] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 15:20:02,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [425564381] [2023-12-24 15:20:02,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:20:02,259 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 15:20:02,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 15:20:02,260 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 15:20:02,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2023-12-24 15:20:02,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:20:02,490 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 35 conjunts are in the unsatisfiable core [2023-12-24 15:20:02,493 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:20:03,531 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 15:20:03,943 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 15:20:04,355 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 27 treesize of output 27 [2023-12-24 15:20:04,612 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 39 treesize of output 37 [2023-12-24 15:20:04,829 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 31 [2023-12-24 15:20:05,614 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-24 15:20:05,614 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 15:20:08,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [425564381] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 15:20:08,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 15:20:08,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2023-12-24 15:20:08,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179166813] [2023-12-24 15:20:08,801 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 15:20:08,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-24 15:20:08,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:20:08,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-24 15:20:08,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=891, Unknown=0, NotChecked=0, Total=992 [2023-12-24 15:20:08,802 INFO L87 Difference]: Start difference. First operand 279 states and 315 transitions. Second operand has 20 states, 20 states have (on average 4.7) internal successors, (94), 19 states have internal predecessors, (94), 5 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2023-12-24 15:20:21,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:20:21,277 INFO L93 Difference]: Finished difference Result 1019 states and 1151 transitions. [2023-12-24 15:20:21,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2023-12-24 15:20:21,278 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.7) internal successors, (94), 19 states have internal predecessors, (94), 5 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) Word has length 82 [2023-12-24 15:20:21,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:20:21,280 INFO L225 Difference]: With dead ends: 1019 [2023-12-24 15:20:21,280 INFO L226 Difference]: Without dead ends: 757 [2023-12-24 15:20:21,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1816 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=1557, Invalid=5753, Unknown=0, NotChecked=0, Total=7310 [2023-12-24 15:20:21,282 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 1519 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 1157 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1519 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-12-24 15:20:21,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1519 Valid, 862 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1157 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2023-12-24 15:20:21,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2023-12-24 15:20:21,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 523. [2023-12-24 15:20:21,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 475 states have (on average 1.1368421052631579) internal successors, (540), 477 states have internal predecessors, (540), 28 states have call successors, (28), 19 states have call predecessors, (28), 19 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-24 15:20:21,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 596 transitions. [2023-12-24 15:20:21,321 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 596 transitions. Word has length 82 [2023-12-24 15:20:21,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:20:21,321 INFO L495 AbstractCegarLoop]: Abstraction has 523 states and 596 transitions. [2023-12-24 15:20:21,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.7) internal successors, (94), 19 states have internal predecessors, (94), 5 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2023-12-24 15:20:21,321 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 596 transitions. [2023-12-24 15:20:21,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-12-24 15:20:21,322 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:20:21,322 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 15:20:21,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (27)] Forceful destruction successful, exit code 0 [2023-12-24 15:20:21,529 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 15:20:21,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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 15:20:21,726 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:20:21,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:20:21,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1678882448, now seen corresponding path program 1 times [2023-12-24 15:20:21,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:20:21,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1217452368] [2023-12-24 15:20:21,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:20:21,727 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 15:20:21,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:20:21,728 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 15:20:21,728 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 15:20:21,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:20:21,847 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-24 15:20:21,849 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:20:21,856 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 15:20:21,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-12-24 15:20:21,930 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 15:20:21,930 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 15:20:21,930 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:20:21,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1217452368] [2023-12-24 15:20:21,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1217452368] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 15:20:21,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 15:20:21,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 15:20:21,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166244764] [2023-12-24 15:20:21,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:20:21,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 15:20:21,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:20:21,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 15:20:21,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-24 15:20:21,932 INFO L87 Difference]: Start difference. First operand 523 states and 596 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 15:20:22,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:20:22,219 INFO L93 Difference]: Finished difference Result 1023 states and 1161 transitions. [2023-12-24 15:20:22,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 15:20:22,219 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 82 [2023-12-24 15:20:22,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:20:22,221 INFO L225 Difference]: With dead ends: 1023 [2023-12-24 15:20:22,221 INFO L226 Difference]: Without dead ends: 529 [2023-12-24 15:20:22,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-12-24 15:20:22,223 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 124 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 15:20:22,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 400 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 15:20:22,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2023-12-24 15:20:22,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 475. [2023-12-24 15:20:22,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 427 states have (on average 1.126463700234192) internal successors, (481), 429 states have internal predecessors, (481), 28 states have call successors, (28), 19 states have call predecessors, (28), 19 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-24 15:20:22,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 537 transitions. [2023-12-24 15:20:22,264 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 537 transitions. Word has length 82 [2023-12-24 15:20:22,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:20:22,264 INFO L495 AbstractCegarLoop]: Abstraction has 475 states and 537 transitions. [2023-12-24 15:20:22,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 15:20:22,264 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 537 transitions. [2023-12-24 15:20:22,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-24 15:20:22,265 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:20:22,265 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 15:20:22,271 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 15:20:22,468 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 15:20:22,468 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:20:22,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:20:22,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1981685327, now seen corresponding path program 1 times [2023-12-24 15:20:22,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:20:22,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1984121905] [2023-12-24 15:20:22,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:20:22,469 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 15:20:22,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:20:22,470 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 15:20:22,471 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 15:20:22,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:20:22,598 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 15:20:22,600 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:20:22,607 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 15:20:22,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-24 15:20:22,697 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 15:20:22,697 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 15:20:22,697 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:20:22,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1984121905] [2023-12-24 15:20:22,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1984121905] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 15:20:22,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 15:20:22,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 15:20:22,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177208464] [2023-12-24 15:20:22,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:20:22,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 15:20:22,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:20:22,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 15:20:22,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-24 15:20:22,698 INFO L87 Difference]: Start difference. First operand 475 states and 537 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 15:20:23,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:20:23,009 INFO L93 Difference]: Finished difference Result 963 states and 1085 transitions. [2023-12-24 15:20:23,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 15:20:23,009 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 85 [2023-12-24 15:20:23,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:20:23,010 INFO L225 Difference]: With dead ends: 963 [2023-12-24 15:20:23,010 INFO L226 Difference]: Without dead ends: 517 [2023-12-24 15:20:23,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-12-24 15:20:23,011 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 93 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 15:20:23,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 371 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 15:20:23,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2023-12-24 15:20:23,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 495. [2023-12-24 15:20:23,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 447 states have (on average 1.116331096196868) internal successors, (499), 449 states have internal predecessors, (499), 28 states have call successors, (28), 19 states have call predecessors, (28), 19 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-24 15:20:23,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 555 transitions. [2023-12-24 15:20:23,059 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 555 transitions. Word has length 85 [2023-12-24 15:20:23,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:20:23,060 INFO L495 AbstractCegarLoop]: Abstraction has 495 states and 555 transitions. [2023-12-24 15:20:23,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 15:20:23,061 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 555 transitions. [2023-12-24 15:20:23,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-12-24 15:20:23,062 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:20:23,062 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 15:20:23,076 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 15:20:23,266 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 15:20:23,266 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:20:23,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:20:23,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1202244133, now seen corresponding path program 1 times [2023-12-24 15:20:23,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:20:23,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1557092105] [2023-12-24 15:20:23,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:20:23,267 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 15:20:23,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:20:23,268 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 15:20:23,269 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 15:20:23,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:20:23,439 INFO L262 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-24 15:20:23,442 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:20:23,781 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 32 proven. 287 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2023-12-24 15:20:23,781 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 15:20:23,834 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 498 trivial. 0 not checked. [2023-12-24 15:20:23,834 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:20:23,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1557092105] [2023-12-24 15:20:23,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1557092105] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 15:20:23,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 15:20:23,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2023-12-24 15:20:23,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124166133] [2023-12-24 15:20:23,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:20:23,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 15:20:23,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:20:23,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 15:20:23,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-24 15:20:23,836 INFO L87 Difference]: Start difference. First operand 495 states and 555 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 15:20:23,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:20:23,951 INFO L93 Difference]: Finished difference Result 848 states and 959 transitions. [2023-12-24 15:20:23,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 15:20:23,952 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 161 [2023-12-24 15:20:23,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:20:23,954 INFO L225 Difference]: With dead ends: 848 [2023-12-24 15:20:23,954 INFO L226 Difference]: Without dead ends: 582 [2023-12-24 15:20:23,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-12-24 15:20:23,955 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 92 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 15:20:23,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 308 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 15:20:23,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2023-12-24 15:20:23,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 497. [2023-12-24 15:20:23,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 449 states have (on average 1.1158129175946547) internal successors, (501), 451 states have internal predecessors, (501), 28 states have call successors, (28), 19 states have call predecessors, (28), 19 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-24 15:20:23,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 557 transitions. [2023-12-24 15:20:23,998 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 557 transitions. Word has length 161 [2023-12-24 15:20:23,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:20:23,999 INFO L495 AbstractCegarLoop]: Abstraction has 497 states and 557 transitions. [2023-12-24 15:20:23,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 15:20:23,999 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 557 transitions. [2023-12-24 15:20:24,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-12-24 15:20:24,000 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:20:24,000 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 15:20:24,008 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 15:20:24,205 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 15:20:24,205 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:20:24,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:20:24,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1224876387, now seen corresponding path program 1 times [2023-12-24 15:20:24,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:20:24,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [720817160] [2023-12-24 15:20:24,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:20:24,206 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 15:20:24,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:20:24,207 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 15:20:24,207 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 15:20:24,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:20:24,402 INFO L262 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 15:20:24,405 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:20:24,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-24 15:20:24,443 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 497 trivial. 0 not checked. [2023-12-24 15:20:24,443 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 15:20:24,443 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:20:24,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [720817160] [2023-12-24 15:20:24,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [720817160] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 15:20:24,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 15:20:24,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 15:20:24,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183413092] [2023-12-24 15:20:24,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:20:24,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 15:20:24,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:20:24,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 15:20:24,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 15:20:24,445 INFO L87 Difference]: Start difference. First operand 497 states and 557 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 15:20:24,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:20:24,572 INFO L93 Difference]: Finished difference Result 685 states and 768 transitions. [2023-12-24 15:20:24,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 15:20:24,572 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 161 [2023-12-24 15:20:24,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:20:24,573 INFO L225 Difference]: With dead ends: 685 [2023-12-24 15:20:24,574 INFO L226 Difference]: Without dead ends: 417 [2023-12-24 15:20:24,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 158 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 15:20:24,574 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 3 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 15:20:24,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 205 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 15:20:24,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2023-12-24 15:20:24,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2023-12-24 15:20:24,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 369 states have (on average 1.102981029810298) internal successors, (407), 371 states have internal predecessors, (407), 28 states have call successors, (28), 19 states have call predecessors, (28), 19 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-24 15:20:24,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 463 transitions. [2023-12-24 15:20:24,610 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 463 transitions. Word has length 161 [2023-12-24 15:20:24,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:20:24,610 INFO L495 AbstractCegarLoop]: Abstraction has 417 states and 463 transitions. [2023-12-24 15:20:24,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 15:20:24,610 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 463 transitions. [2023-12-24 15:20:24,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-12-24 15:20:24,611 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:20:24,611 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 15:20:24,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 15:20:24,816 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 15:20:24,816 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:20:24,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:20:24,816 INFO L85 PathProgramCache]: Analyzing trace with hash 778090512, now seen corresponding path program 1 times [2023-12-24 15:20:24,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:20:24,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2094470131] [2023-12-24 15:20:24,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:20:24,817 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 15:20:24,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:20:24,818 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 15:20:24,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2023-12-24 15:20:25,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:20:25,018 INFO L262 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-24 15:20:25,021 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:20:25,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-12-24 15:20:25,461 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 13 proven. 306 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2023-12-24 15:20:25,462 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 15:20:25,555 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2023-12-24 15:20:25,555 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:20:25,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2094470131] [2023-12-24 15:20:25,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2094470131] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 15:20:25,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 15:20:25,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2023-12-24 15:20:25,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599691768] [2023-12-24 15:20:25,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:20:25,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 15:20:25,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:20:25,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 15:20:25,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-12-24 15:20:25,557 INFO L87 Difference]: Start difference. First operand 417 states and 463 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 15:20:25,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:20:25,659 INFO L93 Difference]: Finished difference Result 719 states and 800 transitions. [2023-12-24 15:20:25,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 15:20:25,659 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 163 [2023-12-24 15:20:25,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:20:25,661 INFO L225 Difference]: With dead ends: 719 [2023-12-24 15:20:25,661 INFO L226 Difference]: Without dead ends: 531 [2023-12-24 15:20:25,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-12-24 15:20:25,661 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 39 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 15:20:25,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 301 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 15:20:25,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2023-12-24 15:20:25,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 431. [2023-12-24 15:20:25,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 383 states have (on average 1.1096605744125327) internal successors, (425), 385 states have internal predecessors, (425), 28 states have call successors, (28), 19 states have call predecessors, (28), 19 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-24 15:20:25,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 481 transitions. [2023-12-24 15:20:25,699 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 481 transitions. Word has length 163 [2023-12-24 15:20:25,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:20:25,699 INFO L495 AbstractCegarLoop]: Abstraction has 431 states and 481 transitions. [2023-12-24 15:20:25,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 15:20:25,699 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 481 transitions. [2023-12-24 15:20:25,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-12-24 15:20:25,700 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:20:25,700 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 15:20:25,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2023-12-24 15:20:25,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 15:20:25,906 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:20:25,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:20:25,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1479155090, now seen corresponding path program 1 times [2023-12-24 15:20:25,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:20:25,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1628477821] [2023-12-24 15:20:25,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:20:25,907 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 15:20:25,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:20:25,909 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 15:20:25,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2023-12-24 15:20:26,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:20:26,110 INFO L262 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 15:20:26,113 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:20:26,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-24 15:20:26,131 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 518 trivial. 0 not checked. [2023-12-24 15:20:26,131 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 15:20:26,131 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:20:26,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1628477821] [2023-12-24 15:20:26,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1628477821] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 15:20:26,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 15:20:26,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 15:20:26,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995600992] [2023-12-24 15:20:26,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:20:26,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 15:20:26,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:20:26,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 15:20:26,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 15:20:26,132 INFO L87 Difference]: Start difference. First operand 431 states and 481 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 15:20:26,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:20:26,260 INFO L93 Difference]: Finished difference Result 627 states and 698 transitions. [2023-12-24 15:20:26,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 15:20:26,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 163 [2023-12-24 15:20:26,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:20:26,261 INFO L225 Difference]: With dead ends: 627 [2023-12-24 15:20:26,261 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 15:20:26,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 161 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 15:20:26,262 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 16 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 15:20:26,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 183 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 15:20:26,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 15:20:26,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 15:20:26,263 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 15:20:26,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 15:20:26,263 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 163 [2023-12-24 15:20:26,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:20:26,263 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 15:20:26,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 15:20:26,263 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 15:20:26,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 15:20:26,265 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 15:20:26,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2023-12-24 15:20:26,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 15:20:26,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 15:25:21,917 WARN L293 SmtUtils]: Spent 4.86m on a formula simplification. DAG size of input: 234 DAG size of output: 518 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 15:25:49,525 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-24 15:25:49,526 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-24 15:25:49,526 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-24 15:25:49,526 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-24 15:25:49,526 INFO L895 garLoopResultBuilder]: At program point L93(line 93) the Hoare annotation is: (and (= (_ bv6 32) |~#signed_long_int_Array_0~0.base|) (= (_ bv6 32) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base) (= |~#signed_char_Array_0~0.base| ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) (= |~#signed_char_Array_0~0.offset| (_ bv0 32)) (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset (_ bv2 32)) (= |~#unsigned_char_Array_0~0.offset| (_ bv0 32)) (bvsge ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#2| ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) (_ bv0 32)))) (_ bv4294967170 32)) (bvsge (select (select |#memory_int#3| (_ bv6 32)) (_ bv4 32)) (_ bv1073741822 32)) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) (= (_ bv8 32) |~#unsigned_char_Array_0~0.base|) (= (_ bv1 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset) (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset (_ bv0 32)) (= (_ bv8 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) (= (_ bv0 32) |~#signed_long_int_Array_0~0.offset|) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet34#1_45| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet34#1_45|) (select (select |#memory_int#5| (_ bv8 32)) (_ bv0 32)))) (= ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset (_ bv0 32)) (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base (_ bv6 32)) (= (_ bv8 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset (_ bv1 32)) (= (_ bv8 32) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset) (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base (_ bv6 32)) (= (_ bv4 32) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.offset) (= (_ bv0 32) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset)) [2023-12-24 15:25:49,526 INFO L899 garLoopResultBuilder]: For program point L93-1(line 93) no Hoare annotation was computed. [2023-12-24 15:25:49,526 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 83) no Hoare annotation was computed. [2023-12-24 15:25:49,526 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-24 15:25:49,526 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-24 15:25:49,526 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-24 15:25:49,527 INFO L899 garLoopResultBuilder]: For program point L77(lines 77 81) no Hoare annotation was computed. [2023-12-24 15:25:49,527 INFO L895 garLoopResultBuilder]: At program point L110-2(lines 110 116) the Hoare annotation is: (let ((.cse35 (select |#memory_int#3| (_ bv6 32)))) (let ((.cse36 (select .cse35 (_ bv4 32))) (.cse34 (select |#memory_int#5| (_ bv8 32)))) (let ((.cse32 (select .cse34 (_ bv0 32))) (.cse26 (= ((_ sign_extend 24) (_ bv14 8)) (select (select |#memory_int#2| ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) (_ bv2 32)))) (.cse29 ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#2| ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) (_ bv0 32))))) (.cse27 (bvsge .cse36 (_ bv1073741822 32))) (.cse28 (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base)) (.cse30 (select .cse35 (_ bv0 32)))) (let ((.cse5 (= .cse30 .cse36)) (.cse18 (= (select (select |#memory_int#4| ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base) ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset) ((_ sign_extend 16) ((_ extract 15 0) (select .cse35 (_ bv8 32)))))) (.cse0 (or (and .cse26 .cse27 .cse28) (and (bvslt .cse29 (_ bv0 32)) .cse27 .cse28))) (.cse1 (= (_ bv6 32) |~#signed_long_int_Array_0~0.base|)) (.cse2 (= (_ bv6 32) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base)) (.cse3 (= |~#signed_char_Array_0~0.base| ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base)) (.cse4 (= |~#signed_char_Array_0~0.offset| (_ bv0 32))) (.cse6 (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset (_ bv2 32))) (.cse7 (= |~#unsigned_char_Array_0~0.offset| (_ bv0 32))) (.cse8 (bvsge .cse29 (_ bv4294967170 32))) (.cse9 (= (_ bv8 32) |~#unsigned_char_Array_0~0.base|)) (.cse10 (= (_ bv1 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset)) (.cse11 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset (_ bv0 32))) (.cse12 (= (_ bv8 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base)) (.cse13 (not (= ((_ extract 7 0) (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset)) (_ bv0 8)))) (.cse14 (= (_ bv0 32) |~#signed_long_int_Array_0~0.offset|)) (.cse15 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet34#1_45| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet34#1_45|) .cse32))) (.cse16 (= ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset (_ bv0 32))) (.cse17 (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base (_ bv6 32))) (.cse19 (= (_ bv8 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base)) (.cse20 (= ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base)) (.cse21 (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset (_ bv1 32))) (.cse22 (= (_ bv8 32) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset)) (.cse23 (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base (_ bv6 32))) (.cse24 (= (_ bv4 32) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.offset)) (.cse25 (= (_ bv0 32) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse1 .cse2 .cse4 .cse5 .cse6 .cse26 .cse7 (= |~#signed_char_Array_0~0.base| ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) .cse8 .cse27 .cse28 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (let ((.cse31 (select .cse34 (_ bv1 32))) (.cse33 ((_ sign_extend 24) (_ bv16 8)))) (and .cse0 (bvslt .cse29 .cse30) .cse1 .cse2 .cse3 .cse4 (not (bvsle ((_ zero_extend 24) ~last_1_unsigned_char_Array_0_1_~0) .cse29)) .cse6 .cse7 (= ((_ zero_extend 24) ((_ extract 7 0) .cse31)) ((_ zero_extend 24) ((_ extract 7 0) .cse32))) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= .cse33 .cse31) .cse17 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (= ((_ extract 7 0) .cse33) ~last_1_unsigned_char_Array_0_1_~0)))))))) [2023-12-24 15:25:49,527 INFO L899 garLoopResultBuilder]: For program point L110-3(lines 110 116) no Hoare annotation was computed. [2023-12-24 15:25:49,527 INFO L895 garLoopResultBuilder]: At program point L86(line 86) the Hoare annotation is: (let ((.cse18 (select |#memory_int#3| (_ bv6 32))) (.cse30 (select |#memory_int#5| (_ bv8 32)))) (let ((.cse28 (select .cse30 (_ bv0 32))) (.cse26 ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#2| ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) (_ bv0 32))))) (.cse6 (select .cse18 (_ bv4 32)))) (let ((.cse0 (let ((.cse31 (bvsge .cse6 (_ bv1073741822 32))) (.cse32 (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base))) (or (and (= ((_ sign_extend 24) (_ bv14 8)) (select (select |#memory_int#2| ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) (_ bv2 32))) .cse31 .cse32) (and (bvslt .cse26 (_ bv0 32)) .cse31 .cse32)))) (.cse5 (select .cse18 (_ bv0 32))) (.cse1 (= (_ bv6 32) |~#signed_long_int_Array_0~0.base|)) (.cse2 (= (_ bv6 32) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base)) (.cse3 (= |~#signed_char_Array_0~0.base| ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base)) (.cse4 (= |~#signed_char_Array_0~0.offset| (_ bv0 32))) (.cse7 (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset (_ bv2 32))) (.cse8 (= |~#unsigned_char_Array_0~0.offset| (_ bv0 32))) (.cse9 (bvsge .cse26 (_ bv4294967170 32))) (.cse10 (= (_ bv8 32) |~#unsigned_char_Array_0~0.base|)) (.cse11 (= (_ bv1 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset)) (.cse12 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset (_ bv0 32))) (.cse13 (= (_ bv8 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base)) (.cse14 (= (_ bv0 32) |~#signed_long_int_Array_0~0.offset|)) (.cse15 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet34#1_45| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet34#1_45|) .cse28))) (.cse16 (= ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset (_ bv0 32))) (.cse17 (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base (_ bv6 32))) (.cse19 (= (_ bv8 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base)) (.cse20 (= ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base)) (.cse21 (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset (_ bv1 32))) (.cse22 (= (_ bv8 32) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset)) (.cse23 (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base (_ bv6 32))) (.cse24 (= (_ bv4 32) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.offset)) (.cse25 (= (_ bv0 32) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= .cse5 .cse6) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= (select (select |#memory_int#4| ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base) ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset) ((_ sign_extend 16) ((_ extract 15 0) (select .cse18 (_ bv8 32))))) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (let ((.cse27 (select .cse30 (_ bv1 32))) (.cse29 ((_ sign_extend 24) (_ bv16 8)))) (and .cse0 (bvslt .cse26 .cse5) .cse1 .cse2 .cse3 .cse4 (not (bvsle ((_ zero_extend 24) ~last_1_unsigned_char_Array_0_1_~0) .cse26)) .cse7 .cse8 (= ((_ zero_extend 24) ((_ extract 7 0) .cse27)) ((_ zero_extend 24) ((_ extract 7 0) .cse28))) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= .cse29 .cse27) .cse17 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (= ((_ extract 7 0) .cse29) ~last_1_unsigned_char_Array_0_1_~0))))))) [2023-12-24 15:25:49,527 INFO L899 garLoopResultBuilder]: For program point L86-1(line 86) no Hoare annotation was computed. [2023-12-24 15:25:49,527 INFO L899 garLoopResultBuilder]: For program point L78(lines 78 80) no Hoare annotation was computed. [2023-12-24 15:25:49,527 INFO L899 garLoopResultBuilder]: For program point L70(lines 70 74) no Hoare annotation was computed. [2023-12-24 15:25:49,527 INFO L899 garLoopResultBuilder]: For program point L70-2(lines 70 74) no Hoare annotation was computed. [2023-12-24 15:25:49,527 INFO L895 garLoopResultBuilder]: At program point L95(line 95) the Hoare annotation is: (and (= (_ bv6 32) |~#signed_long_int_Array_0~0.base|) (= (_ bv6 32) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base) (= |~#signed_char_Array_0~0.base| ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) (= |~#signed_char_Array_0~0.offset| (_ bv0 32)) (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset (_ bv2 32)) (= |~#unsigned_char_Array_0~0.offset| (_ bv0 32)) (bvsge ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#2| ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) (_ bv0 32)))) (_ bv4294967170 32)) (bvsge (select (select |#memory_int#3| (_ bv6 32)) (_ bv4 32)) (_ bv1073741822 32)) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) (= (_ bv8 32) |~#unsigned_char_Array_0~0.base|) (= (_ bv1 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset) (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset (_ bv0 32)) (= (_ bv8 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) (= (_ bv0 32) |~#signed_long_int_Array_0~0.offset|) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet34#1_45| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet34#1_45|) (select (select |#memory_int#5| (_ bv8 32)) (_ bv0 32)))) (= ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset (_ bv0 32)) (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base (_ bv6 32)) (= (_ bv8 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset (_ bv1 32)) (= (_ bv8 32) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset) (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base (_ bv6 32)) (= (_ bv4 32) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.offset) (= (_ bv0 32) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset)) [2023-12-24 15:25:49,527 INFO L899 garLoopResultBuilder]: For program point L95-1(line 95) no Hoare annotation was computed. [2023-12-24 15:25:49,528 INFO L895 garLoopResultBuilder]: At program point L87(line 87) the Hoare annotation is: (let ((.cse18 (select |#memory_int#3| (_ bv6 32))) (.cse30 (select |#memory_int#5| (_ bv8 32)))) (let ((.cse28 (select .cse30 (_ bv0 32))) (.cse26 ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#2| ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) (_ bv0 32))))) (.cse6 (select .cse18 (_ bv4 32)))) (let ((.cse0 (let ((.cse31 (bvsge .cse6 (_ bv1073741822 32))) (.cse32 (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base))) (or (and (= ((_ sign_extend 24) (_ bv14 8)) (select (select |#memory_int#2| ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) (_ bv2 32))) .cse31 .cse32) (and (bvslt .cse26 (_ bv0 32)) .cse31 .cse32)))) (.cse5 (select .cse18 (_ bv0 32))) (.cse1 (= (_ bv6 32) |~#signed_long_int_Array_0~0.base|)) (.cse2 (= (_ bv6 32) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base)) (.cse3 (= |~#signed_char_Array_0~0.base| ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base)) (.cse4 (= |~#signed_char_Array_0~0.offset| (_ bv0 32))) (.cse7 (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset (_ bv2 32))) (.cse8 (= |~#unsigned_char_Array_0~0.offset| (_ bv0 32))) (.cse9 (bvsge .cse26 (_ bv4294967170 32))) (.cse10 (= (_ bv8 32) |~#unsigned_char_Array_0~0.base|)) (.cse11 (= (_ bv1 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset)) (.cse12 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset (_ bv0 32))) (.cse13 (= (_ bv8 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base)) (.cse14 (= (_ bv0 32) |~#signed_long_int_Array_0~0.offset|)) (.cse15 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet34#1_45| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet34#1_45|) .cse28))) (.cse16 (= ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset (_ bv0 32))) (.cse17 (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base (_ bv6 32))) (.cse19 (= (_ bv8 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base)) (.cse20 (= ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base)) (.cse21 (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset (_ bv1 32))) (.cse22 (= (_ bv8 32) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset)) (.cse23 (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base (_ bv6 32))) (.cse24 (= (_ bv4 32) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.offset)) (.cse25 (= (_ bv0 32) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= .cse5 .cse6) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= (select (select |#memory_int#4| ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base) ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset) ((_ sign_extend 16) ((_ extract 15 0) (select .cse18 (_ bv8 32))))) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (let ((.cse27 (select .cse30 (_ bv1 32))) (.cse29 ((_ sign_extend 24) (_ bv16 8)))) (and .cse0 (bvslt .cse26 .cse5) .cse1 .cse2 .cse3 .cse4 (not (bvsle ((_ zero_extend 24) ~last_1_unsigned_char_Array_0_1_~0) .cse26)) .cse7 .cse8 (= ((_ zero_extend 24) ((_ extract 7 0) .cse27)) ((_ zero_extend 24) ((_ extract 7 0) .cse28))) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= .cse29 .cse27) .cse17 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (= ((_ extract 7 0) .cse29) ~last_1_unsigned_char_Array_0_1_~0))))))) [2023-12-24 15:25:49,528 INFO L899 garLoopResultBuilder]: For program point L87-1(line 87) no Hoare annotation was computed. [2023-12-24 15:25:49,528 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 15:25:49,528 INFO L899 garLoopResultBuilder]: For program point L104(line 104) no Hoare annotation was computed. [2023-12-24 15:25:49,528 INFO L899 garLoopResultBuilder]: For program point L104-1(line 104) no Hoare annotation was computed. [2023-12-24 15:25:49,528 INFO L899 garLoopResultBuilder]: For program point L104-3(line 104) no Hoare annotation was computed. [2023-12-24 15:25:49,528 INFO L899 garLoopResultBuilder]: For program point L104-5(line 104) no Hoare annotation was computed. [2023-12-24 15:25:49,528 INFO L899 garLoopResultBuilder]: For program point L104-6(line 104) no Hoare annotation was computed. [2023-12-24 15:25:49,528 INFO L895 garLoopResultBuilder]: At program point L96(line 96) the Hoare annotation is: (and (= (_ bv6 32) |~#signed_long_int_Array_0~0.base|) (= (_ bv6 32) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base) (= |~#signed_char_Array_0~0.base| ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) (= |~#signed_char_Array_0~0.offset| (_ bv0 32)) (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset (_ bv2 32)) (= |~#unsigned_char_Array_0~0.offset| (_ bv0 32)) (bvsge ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#2| ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) (_ bv0 32)))) (_ bv4294967170 32)) (bvsge (select (select |#memory_int#3| (_ bv6 32)) (_ bv4 32)) (_ bv1073741822 32)) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) (= (_ bv8 32) |~#unsigned_char_Array_0~0.base|) (= (_ bv1 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset) (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset (_ bv0 32)) (= (_ bv8 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) (= (_ bv0 32) |~#signed_long_int_Array_0~0.offset|) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet34#1_45| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet34#1_45|) (select (select |#memory_int#5| (_ bv8 32)) (_ bv0 32)))) (= ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset (_ bv0 32)) (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base (_ bv6 32)) (= (_ bv8 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset (_ bv1 32)) (= (_ bv8 32) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset) (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base (_ bv6 32)) (= (_ bv4 32) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.offset) (= (_ bv0 32) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset)) [2023-12-24 15:25:49,528 INFO L899 garLoopResultBuilder]: For program point L104-8(line 104) no Hoare annotation was computed. [2023-12-24 15:25:49,528 INFO L899 garLoopResultBuilder]: For program point L96-1(line 96) no Hoare annotation was computed. [2023-12-24 15:25:49,528 INFO L899 garLoopResultBuilder]: For program point L104-9(line 104) no Hoare annotation was computed. [2023-12-24 15:25:49,529 INFO L899 garLoopResultBuilder]: For program point L104-10(line 104) no Hoare annotation was computed. [2023-12-24 15:25:49,529 INFO L899 garLoopResultBuilder]: For program point L104-11(line 104) no Hoare annotation was computed. [2023-12-24 15:25:49,529 INFO L899 garLoopResultBuilder]: For program point L104-12(line 104) no Hoare annotation was computed. [2023-12-24 15:25:49,529 INFO L899 garLoopResultBuilder]: For program point L104-14(line 104) no Hoare annotation was computed. [2023-12-24 15:25:49,529 INFO L899 garLoopResultBuilder]: For program point L104-16(line 104) no Hoare annotation was computed. [2023-12-24 15:25:49,529 INFO L899 garLoopResultBuilder]: For program point L55(lines 55 67) no Hoare annotation was computed. [2023-12-24 15:25:49,529 INFO L899 garLoopResultBuilder]: For program point L55-1(lines 55 67) no Hoare annotation was computed. [2023-12-24 15:25:49,529 INFO L899 garLoopResultBuilder]: For program point L104-18(line 104) no Hoare annotation was computed. [2023-12-24 15:25:49,529 INFO L899 garLoopResultBuilder]: For program point L104-20(line 104) no Hoare annotation was computed. [2023-12-24 15:25:49,529 INFO L899 garLoopResultBuilder]: For program point L104-21(line 104) no Hoare annotation was computed. [2023-12-24 15:25:49,529 INFO L899 garLoopResultBuilder]: For program point L104-22(line 104) no Hoare annotation was computed. [2023-12-24 15:25:49,529 INFO L899 garLoopResultBuilder]: For program point L104-23(line 104) no Hoare annotation was computed. [2023-12-24 15:25:49,529 INFO L899 garLoopResultBuilder]: For program point L104-25(line 104) no Hoare annotation was computed. [2023-12-24 15:25:49,529 INFO L899 garLoopResultBuilder]: For program point L104-27(line 104) no Hoare annotation was computed. [2023-12-24 15:25:49,529 INFO L899 garLoopResultBuilder]: For program point L104-28(line 104) no Hoare annotation was computed. [2023-12-24 15:25:49,529 INFO L899 garLoopResultBuilder]: For program point L104-30(line 104) no Hoare annotation was computed. [2023-12-24 15:25:49,529 INFO L899 garLoopResultBuilder]: For program point L104-32(line 104) no Hoare annotation was computed. [2023-12-24 15:25:49,529 INFO L899 garLoopResultBuilder]: For program point L104-33(line 104) no Hoare annotation was computed. [2023-12-24 15:25:49,529 INFO L899 garLoopResultBuilder]: For program point L104-35(line 104) no Hoare annotation was computed. [2023-12-24 15:25:49,529 INFO L899 garLoopResultBuilder]: For program point L104-36(line 104) no Hoare annotation was computed. [2023-12-24 15:25:49,530 INFO L899 garLoopResultBuilder]: For program point L104-38(line 104) no Hoare annotation was computed. [2023-12-24 15:25:49,530 INFO L895 garLoopResultBuilder]: At program point L89(line 89) the Hoare annotation is: (let ((.cse27 (select |#memory_int#3| (_ bv6 32))) (.cse26 (select |#memory_int#5| (_ bv8 32)))) (let ((.cse7 (select .cse26 (_ bv0 32))) (.cse28 (select .cse27 (_ bv4 32)))) (let ((.cse0 (= (_ bv6 32) |~#signed_long_int_Array_0~0.base|)) (.cse1 (= (_ bv6 32) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base)) (.cse2 (= |~#signed_char_Array_0~0.offset| (_ bv0 32))) (.cse3 (= |ULTIMATE.start_updateVariables_#t~mem29#1| ((_ extract 7 0) (select (select |#memory_int#2| ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) (_ bv0 32))))) (.cse4 (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset (_ bv2 32))) (.cse5 (= |~#unsigned_char_Array_0~0.offset| (_ bv0 32))) (.cse8 (bvsge .cse28 (_ bv1073741822 32))) (.cse9 (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base)) (.cse10 (= (_ bv8 32) |~#unsigned_char_Array_0~0.base|)) (.cse11 (= (_ bv1 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset)) (.cse12 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset (_ bv0 32))) (.cse13 (= (_ bv8 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base)) (.cse14 (= (_ bv0 32) |~#signed_long_int_Array_0~0.offset|)) (.cse15 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet34#1_45| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet34#1_45|) .cse7))) (.cse16 (= ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset (_ bv0 32))) (.cse18 (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base (_ bv6 32))) (.cse19 (= (_ bv8 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base)) (.cse20 (= ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base)) (.cse21 (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset (_ bv1 32))) (.cse22 (= (_ bv8 32) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset)) (.cse23 (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base (_ bv6 32))) (.cse24 (= (_ bv4 32) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.offset)) (.cse25 (= (_ bv0 32) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset))) (or (let ((.cse6 (select .cse26 (_ bv1 32))) (.cse17 ((_ sign_extend 24) (_ bv16 8)))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ((_ zero_extend 24) ((_ extract 7 0) .cse6)) ((_ zero_extend 24) ((_ extract 7 0) .cse7))) (= |~#signed_char_Array_0~0.base| ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= .cse17 .cse6) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (= ((_ extract 7 0) .cse17) ~last_1_unsigned_char_Array_0_1_~0))) (and .cse0 .cse1 (= |~#signed_char_Array_0~0.base| ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) .cse2 (= (select .cse27 (_ bv0 32)) .cse28) .cse3 .cse4 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 (= (select (select |#memory_int#4| ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base) ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset) ((_ sign_extend 16) ((_ extract 15 0) (select .cse27 (_ bv8 32))))) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25))))) [2023-12-24 15:25:49,530 INFO L899 garLoopResultBuilder]: For program point L89-1(line 89) no Hoare annotation was computed. [2023-12-24 15:25:49,530 INFO L899 garLoopResultBuilder]: For program point L56(lines 56 64) no Hoare annotation was computed. [2023-12-24 15:25:49,530 INFO L899 garLoopResultBuilder]: For program point L73(line 73) no Hoare annotation was computed. [2023-12-24 15:25:49,530 INFO L899 garLoopResultBuilder]: For program point L73-2(line 73) no Hoare annotation was computed. [2023-12-24 15:25:49,530 INFO L895 garLoopResultBuilder]: At program point L90(line 90) the Hoare annotation is: (let ((.cse27 (select |#memory_int#3| (_ bv6 32))) (.cse26 (select |#memory_int#5| (_ bv8 32)))) (let ((.cse6 (select .cse26 (_ bv0 32))) (.cse28 (select .cse27 (_ bv4 32)))) (let ((.cse0 (= (_ bv6 32) |~#signed_long_int_Array_0~0.base|)) (.cse1 (= (_ bv6 32) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base)) (.cse2 (= |~#signed_char_Array_0~0.offset| (_ bv0 32))) (.cse3 (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset (_ bv2 32))) (.cse4 (= |~#unsigned_char_Array_0~0.offset| (_ bv0 32))) (.cse7 (bvsge ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#2| ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) (_ bv0 32)))) (_ bv4294967170 32))) (.cse8 (bvsge .cse28 (_ bv1073741822 32))) (.cse9 (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base)) (.cse10 (= (_ bv8 32) |~#unsigned_char_Array_0~0.base|)) (.cse11 (= (_ bv1 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset)) (.cse12 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset (_ bv0 32))) (.cse13 (= (_ bv8 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base)) (.cse14 (= (_ bv0 32) |~#signed_long_int_Array_0~0.offset|)) (.cse15 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet34#1_45| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet34#1_45|) .cse6))) (.cse16 (= ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset (_ bv0 32))) (.cse18 (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base (_ bv6 32))) (.cse19 (= (_ bv8 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base)) (.cse20 (= ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base)) (.cse21 (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset (_ bv1 32))) (.cse22 (= (_ bv8 32) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset)) (.cse23 (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base (_ bv6 32))) (.cse24 (= (_ bv4 32) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.offset)) (.cse25 (= (_ bv0 32) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset))) (or (let ((.cse5 (select .cse26 (_ bv1 32))) (.cse17 ((_ sign_extend 24) (_ bv16 8)))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ((_ zero_extend 24) ((_ extract 7 0) .cse5)) ((_ zero_extend 24) ((_ extract 7 0) .cse6))) .cse7 (= |~#signed_char_Array_0~0.base| ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= .cse17 .cse5) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (= ((_ extract 7 0) .cse17) ~last_1_unsigned_char_Array_0_1_~0))) (and .cse0 .cse1 (= |~#signed_char_Array_0~0.base| ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) .cse2 (= (select .cse27 (_ bv0 32)) .cse28) .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 (= (select (select |#memory_int#4| ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base) ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset) ((_ sign_extend 16) ((_ extract 15 0) (select .cse27 (_ bv8 32))))) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25))))) [2023-12-24 15:25:49,530 INFO L899 garLoopResultBuilder]: For program point L90-1(line 90) no Hoare annotation was computed. [2023-12-24 15:25:49,530 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-24 15:25:49,530 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 15:25:49,531 INFO L895 garLoopResultBuilder]: At program point L92(line 92) the Hoare annotation is: (and (= (_ bv6 32) |~#signed_long_int_Array_0~0.base|) (= (_ bv6 32) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base) (= |~#signed_char_Array_0~0.base| ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) (= |~#signed_char_Array_0~0.offset| (_ bv0 32)) (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset (_ bv2 32)) (= |~#unsigned_char_Array_0~0.offset| (_ bv0 32)) (bvsge ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#2| ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) (_ bv0 32)))) (_ bv4294967170 32)) (= |ULTIMATE.start_updateVariables_#t~mem32#1| (select (select |#memory_int#3| (_ bv6 32)) (_ bv4 32))) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) (= (_ bv8 32) |~#unsigned_char_Array_0~0.base|) (= (_ bv1 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset) (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset (_ bv0 32)) (= (_ bv8 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) (= (_ bv0 32) |~#signed_long_int_Array_0~0.offset|) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet34#1_45| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet34#1_45|) (select (select |#memory_int#5| (_ bv8 32)) (_ bv0 32)))) (= ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset (_ bv0 32)) (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base (_ bv6 32)) (= (_ bv8 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset (_ bv1 32)) (= (_ bv8 32) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset) (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base (_ bv6 32)) (= (_ bv4 32) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.offset) (= (_ bv0 32) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset)) [2023-12-24 15:25:49,531 INFO L899 garLoopResultBuilder]: For program point L92-1(line 92) no Hoare annotation was computed. [2023-12-24 15:25:49,531 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 63) no Hoare annotation was computed. [2023-12-24 15:25:49,531 INFO L899 garLoopResultBuilder]: For program point L76(lines 76 82) no Hoare annotation was computed. [2023-12-24 15:25:49,534 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] [2023-12-24 15:25:49,535 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 15:25:49,549 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0!base][2bv32] could not be translated [2023-12-24 15:25:49,551 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[6bv32][4bv32] could not be translated [2023-12-24 15:25:49,552 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0!base][0bv32] could not be translated [2023-12-24 15:25:49,552 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[6bv32][4bv32] could not be translated [2023-12-24 15:25:49,553 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[6bv32][0bv32] could not be translated [2023-12-24 15:25:49,553 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[6bv32][4bv32] could not be translated [2023-12-24 15:25:49,554 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0!base][0bv32] could not be translated [2023-12-24 15:25:49,554 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!base][~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!offset] could not be translated [2023-12-24 15:25:49,554 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet34#1_45 : bv8 :: ~sign_extend~32~16(v_ULTIMATE.start_updateVariables_#t~nondet34#1_45) == #memory_int#5[8bv32][0bv32]) could not be translated [2023-12-24 15:25:49,554 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!base][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!offset] could not be translated [2023-12-24 15:25:49,554 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[6bv32][8bv32] could not be translated [2023-12-24 15:25:49,555 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[6bv32][0bv32] could not be translated [2023-12-24 15:25:49,555 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[6bv32][4bv32] could not be translated [2023-12-24 15:25:49,555 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0!base][2bv32] could not be translated [2023-12-24 15:25:49,555 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0!base][0bv32] could not be translated [2023-12-24 15:25:49,556 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[6bv32][4bv32] could not be translated [2023-12-24 15:25:49,556 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet34#1_45 : bv8 :: ~sign_extend~32~16(v_ULTIMATE.start_updateVariables_#t~nondet34#1_45) == #memory_int#5[8bv32][0bv32]) could not be translated [2023-12-24 15:25:49,557 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!base][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!offset] could not be translated [2023-12-24 15:25:49,557 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[6bv32][8bv32] could not be translated [2023-12-24 15:25:49,562 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0!base][2bv32] could not be translated [2023-12-24 15:25:49,562 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[6bv32][4bv32] could not be translated [2023-12-24 15:25:49,562 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0!base][0bv32] could not be translated [2023-12-24 15:25:49,562 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[6bv32][4bv32] could not be translated [2023-12-24 15:25:49,563 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0!base][0bv32] could not be translated [2023-12-24 15:25:49,563 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[6bv32][0bv32] could not be translated [2023-12-24 15:25:49,563 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0!base][0bv32] could not be translated [2023-12-24 15:25:49,563 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[8bv32][1bv32] could not be translated [2023-12-24 15:25:49,563 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[8bv32][0bv32] could not be translated [2023-12-24 15:25:49,564 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0!base][0bv32] could not be translated [2023-12-24 15:25:49,565 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!base][~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!offset] could not be translated [2023-12-24 15:25:49,565 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet34#1_45 : bv8 :: ~sign_extend~32~16(v_ULTIMATE.start_updateVariables_#t~nondet34#1_45) == #memory_int#5[8bv32][0bv32]) could not be translated [2023-12-24 15:25:49,565 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[8bv32][1bv32] could not be translated [2023-12-24 15:25:49,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 03:25:49 BoogieIcfgContainer [2023-12-24 15:25:49,569 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 15:25:49,569 INFO L158 Benchmark]: Toolchain (without parser) took 405527.36ms. Allocated memory was 272.6MB in the beginning and 994.1MB in the end (delta: 721.4MB). Free memory was 223.2MB in the beginning and 486.8MB in the end (delta: -263.5MB). Peak memory consumption was 589.5MB. Max. memory is 8.0GB. [2023-12-24 15:25:49,569 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 215.0MB. Free memory was 166.9MB in the beginning and 166.8MB in the end (delta: 132.9kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 15:25:49,570 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.29ms. Allocated memory is still 272.6MB. Free memory was 223.0MB in the beginning and 208.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-24 15:25:49,570 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.44ms. Allocated memory is still 272.6MB. Free memory was 208.2MB in the beginning and 205.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 15:25:49,570 INFO L158 Benchmark]: Boogie Preprocessor took 56.74ms. Allocated memory is still 272.6MB. Free memory was 205.4MB in the beginning and 200.9MB in the end (delta: 4.5MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-24 15:25:49,570 INFO L158 Benchmark]: RCFGBuilder took 622.18ms. Allocated memory is still 272.6MB. Free memory was 200.9MB in the beginning and 216.6MB in the end (delta: -15.6MB). Peak memory consumption was 19.8MB. Max. memory is 8.0GB. [2023-12-24 15:25:49,580 INFO L158 Benchmark]: TraceAbstraction took 404594.88ms. Allocated memory was 272.6MB in the beginning and 994.1MB in the end (delta: 721.4MB). Free memory was 216.1MB in the beginning and 486.8MB in the end (delta: -270.7MB). Peak memory consumption was 581.3MB. Max. memory is 8.0GB. [2023-12-24 15:25:49,581 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 215.0MB. Free memory was 166.9MB in the beginning and 166.8MB in the end (delta: 132.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 200.29ms. Allocated memory is still 272.6MB. Free memory was 223.0MB in the beginning and 208.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.44ms. Allocated memory is still 272.6MB. Free memory was 208.2MB in the beginning and 205.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 56.74ms. Allocated memory is still 272.6MB. Free memory was 205.4MB in the beginning and 200.9MB in the end (delta: 4.5MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 622.18ms. Allocated memory is still 272.6MB. Free memory was 200.9MB in the beginning and 216.6MB in the end (delta: -15.6MB). Peak memory consumption was 19.8MB. Max. memory is 8.0GB. * TraceAbstraction took 404594.88ms. Allocated memory was 272.6MB in the beginning and 994.1MB in the end (delta: 721.4MB). Free memory was 216.1MB in the beginning and 486.8MB in the end (delta: -270.7MB). Peak memory consumption was 581.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0!base][2bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[6bv32][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[6bv32][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[6bv32][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[6bv32][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!base][~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet34#1_45 : bv8 :: ~sign_extend~32~16(v_ULTIMATE.start_updateVariables_#t~nondet34#1_45) == #memory_int#5[8bv32][0bv32]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!base][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[6bv32][8bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[6bv32][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[6bv32][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0!base][2bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[6bv32][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet34#1_45 : bv8 :: ~sign_extend~32~16(v_ULTIMATE.start_updateVariables_#t~nondet34#1_45) == #memory_int#5[8bv32][0bv32]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!base][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[6bv32][8bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0!base][2bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[6bv32][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[6bv32][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[6bv32][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[8bv32][1bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[8bv32][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!base][~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet34#1_45 : bv8 :: ~sign_extend~32~16(v_ULTIMATE.start_updateVariables_#t~nondet34#1_45) == #memory_int#5[8bv32][0bv32]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[8bv32][1bv32] could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 404.5s, OverallIterations: 29, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 21.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 323.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5784 SdHoareTripleChecker+Valid, 8.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5784 mSDsluCounter, 11329 SdHoareTripleChecker+Invalid, 8.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8681 mSDsCounter, 380 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5007 IncrementalHoareTripleChecker+Invalid, 5387 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 380 mSolverCounterUnsat, 2648 mSDtfsCounter, 5007 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4024 GetRequests, 3570 SyntacticMatches, 2 SemanticMatches, 452 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3460 ImplicationChecksByTransitivity, 25.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=523occurred in iteration=23, InterpolantAutomatonStates: 297, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 29 MinimizatonAttempts, 1347 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 343 PreInvPairs, 375 NumberOfFragments, 1901 HoareAnnotationTreeSize, 343 FormulaSimplifications, 26015635 FormulaSimplificationTreeSizeReduction, 311.8s HoareSimplificationTime, 10 FormulaSimplificationsInter, 519639 FormulaSimplificationTreeSizeReductionInter, 11.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 47.9s InterpolantComputationTime, 2769 NumberOfCodeBlocks, 2769 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 3655 ConstructedInterpolants, 102 QuantifiedInterpolants, 33584 SizeOfPredicates, 345 NumberOfNonLiveVariables, 7319 ConjunctsInSsa, 445 ConjunctsInUnsatCore, 42 InterpolantComputations, 25 PerfectInterpolantSequences, 5809/7188 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: 110]: Loop Invariant Derived loop invariant: (((((null & 127) >= -126) && !(((null & 127) == 0))) || ((null & 127) >= -126)) || ((((!((last_1_unsigned_char_Array_0_1_ <= (null & 127))) && ((null & 127) == (null & 127))) && ((null & 127) >= -126)) && !(((null & 127) == 0))) && ((16 & 127) == last_1_unsigned_char_Array_0_1_))) RESULT: Ultimate proved your program to be correct! [2023-12-24 15:25:49,633 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...